Duality for minmax programs

DOI10.1016/0022-247X(84)90088-XzbMath0546.90074MaRDI QIDQ798567

T. R. Jefferson, Carlton H. Scott

Publication date: 1984

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

dual problemconjugate duality theoryconvex finite dimensional constrained minimizationlinear and nonlinear inequalitiesminmax programs

Mathematics Subject Classification ID

Convex programming (90C25) Existence of solutions for minimax problems (49J35) Duality theory (optimization) (49N15) Optimality conditions for minimax problems (49K35) Methods of successive quadratic programming type (90C55) Mathematical programming (90C99)

Related Items (7)

A comparison of alternative c-conjugate dual problems in infinite convex optimization ⋮ Fenchel-Lagrange duality versus geometric duality in convex optimization ⋮ Composite convex programs ⋮ Farkas-type results for max-functions and applications ⋮ A Lagrange duality approach for multi-composed optimization problems ⋮ Unnamed Item ⋮ Duality results for nonlinear single minimax location problems via multi-composed optimization

Cites Work

• Unnamed Item
• Saddle points of Hamiltonian systems in convex problems of Lagrange
• Geometric Programming
• A Minimax Ordering Policy for the Infinite Stage Dynamic Inventory Problem

This page was built for publication: Duality for minmax programs