Duality for minmax programs
A convex finite dimensional constrained minimization problem with objective function being a maximum of a finite number of convex functions is considered. Using conjugate duality theory for generalized geometric programming the authors derive a dual problem. For a particular class of practically meaningful objective functions the dual problem is relatively simple and allows numerical treatment.
convex finite dimensional constrained minimization
scientific article; zbMATH DE number 3871037