Using convex envelopes to solve the interactive fixed-charge linear programming problem
From MaRDI portal
Publication:1093525
DOI10.1007/BF00938310zbMath0628.90045MaRDI QIDQ1093525
Publication date: 1988
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
nonconvex programming; branch-and-bound; convex envelopes; exact optimal solution; fixed-charge linear programming
65K05: Numerical mathematical programming methods
90C30: Nonlinear programming
90C05: Linear programming
Related Items