Linear max-min programming

Theoretical aspects of the programming problem of maximizing the minimum value of a set of linear functionals subject to linear constraints are explored. Solution strategies are discussed and an optimality condition is developed. An algorithm is also presented.This research was partially supported by the Management Research Center of the University of Wisconsin—Milwaukee.