Duality for nonconvex absolute value programming and a characterization of linear max-min programs

DOI10.1016/0167-6377(85)90039-2zbMath0565.90039OpenAlexW1990002700MaRDI QIDQ1058980

Amilcar S. Gonçalves

Publication date: 1985

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(85)90039-2

zbMATH Keywords

dual problemduality gapabsolute value functionalsbivalent variablesmax- min problemnonconvex linear programs

Mathematics Subject Classification ID

Linear programming (90C05) Existence of solutions for minimax problems (49J35) Duality theory (optimization) (49N15)

Cites Work

• A linear max—min problem
• Unnamed Item

This page was built for publication: Duality for nonconvex absolute value programming and a characterization of linear max-min programs