G-94-52
Concavity Cuts for the Linear maxmin Problem
, , and BibTeX reference
We present a method to compute valid concavity cuts for the linear maxmin programming problem. We consider a primal and a dual approach. In both cases the problem is reformulated as a concave programming problem with linear constraints.
Published October 1994 , 20 pages