A note on the duality gap in nonconvex optimization and a very simple procedure for bid evaluation type problems
type: Item
instance of: scholarly article
title: A note on the duality gap in nonconvex optimization and a very simple procedure for bid evaluation type problems
zbMATH Open document ID: 0445.90074
DOI: 10.1016/0377-2217(80)90091-0
author: Reiner Horst
published in: European Journal of Operational Research
publication date: 1980-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 3696844
zbMATH Keywords: nonconvex optimization
zbMATH Keywords: bid evaluation type problems
zbMATH Keywords: duality gap
zbMATH Keywords: gap estimation
MaRDI profile type: Publication
full work available at URL: 0377-2217(80)90091-0
OpenAlex ID: W2044182937
cites work: Estimates of the Duality Gap in Nonconvex Optimization
cites work: Q5589755
cites work: Q4077092
cites work: Q4048858
cites work: Lagrange Multipliers and Nonconvex Programs
cites work: A Successive Underestimation Method for Concave Minimization Problems
cites work: Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
cites work: A Branch-and-Bound Algorithm for Multi-Level Fixed-Charge Problems
cites work: Q5638112
description: scientific article; zbMATH DE number 3696844