Abstract
We consider 0–1 programming problems with a minimax objective function and any set of constraints. Upon appropriate transformations of its cost coefficients, such a minimax problem can be reduced to a linear minisum problem with the same set of feasible solutions such that an optimal solution to the latter will also solve the original minimax problem. Although this reducibility applies for any 0–1 programming problem, it is of particular interest for certain locational decision models. Among the obvious implications are that an algorithm for solving a p-median (minisum) problem in a network will also solve a corresponding p-center (minimax) problem. It should be emphasized that the results presented will in general only hold for 0–1 problems due to intrinsic properties of the minimax criterion.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have