Groupe d’études et de recherche en analyse des décisions

G-94-52

Concavity Cuts for the Linear maxmin Problem

, et

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.

, 20 pages