Using convex envelopes to solve the interactive fixed-charge linear programming problem

DOI10.1007/BF00938310zbMath0628.90045MaRDI QIDQ1093525

B. George

Publication date: 1988

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

nonconvex programmingbranch-and-boundconvex envelopesexact optimal solutionfixed-charge linear programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Linear programming (90C05)

Related Items (8)

Deterministic methods in constrained global optimization: Some recent advances and new fields of application ⋮ A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron ⋮ Multiproduct dynamic lot-sizing model with coordinated replenishments ⋮ Existence and sum decomposition of vertex polyhedral convex envelopes ⋮ A new simplicial cover technique in constrained global optimization ⋮ A discrete dynamic convexized method for nonlinear integer programming ⋮ An algorithm and new penalties for concave integer minimization over a polyhedron ⋮ An algorithm for concave integer minimization over a polyhedron

Cites Work

• Unnamed Item
• Quasi-concave minimization subject to linear constraints
• The computation of fixed points and applications
• Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain
• A finite algorithm for concave minimization over a polyhedron
• The interactive fixed charge linear programming problem
• Global Maximization of a Convex Function with Linear Inequality Constraints
• Variations on a cutting plane method for solving concave minimization problems with linear constraints
• A Successive Underestimation Method for Concave Minimization Problems
• A Multi-Product Dynamic Lot-Size Model with Individual and Joint Set-up Costs
• Concave minimization over a convex polyhedron
• The Direct Power of Adjacent Vertex Programming Methods
• Lagrange Multipliers and Nonconvex Programs
• Convex Analysis

This page was built for publication: Using convex envelopes to solve the interactive fixed-charge linear programming problem