A note on the duality gap in nonconvex optimization and a very simple procedure for bid evaluation type problems

DOI10.1016/0377-2217(80)90091-0zbMath0445.90074OpenAlexW2044182937MaRDI QIDQ1145624

Reiner Horst

Publication date: 1980

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(80)90091-0

zbMATH Keywords

duality gapnonconvex optimizationbid evaluation type problemsgap estimation

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30)

Related Items (1)

A generalized duality and applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Successive Underestimation Method for Concave Minimization Problems
• Estimates of the Duality Gap in Nonconvex Optimization
• A Branch-and-Bound Algorithm for Multi-Level Fixed-Charge Problems
• Lagrange Multipliers and Nonconvex Programs
• Duality in Nonlinear Programming: A Simplified Applications-Oriented Development

This page was built for publication: A note on the duality gap in nonconvex optimization and a very simple procedure for bid evaluation type problems