On duality for convex minimization with nested maxima

Publisher Website
Google Scholar
Abstract
In this paper, we consider convex programs with linear constraints where the objective function involves nested maxima of linear functions as well as a convex function. A dual program is constructed which has interpretational significance and may be easier to solve than the primal formulation. A numerical example is given to illustrate the method.

This publication has 3 references indexed in Scilit: