Using convex envelopes to solve the interactive fixed-charge linear programming problem
From MaRDI portal
Recommendations
- The interactive fixed charge linear programming problem
- scientific article; zbMATH DE number 4135708
- scientific article; zbMATH DE number 37091
- scientific article; zbMATH DE number 895009
- A General Primal-Dual Envelope Method for Convex Programming Problems
- scientific article; zbMATH DE number 3856836
- On the convex programming approach to linear programming
- Solving the linear complementarity problem through concave programming
- Satisfying constraint sets through convex envelopes
- scientific article; zbMATH DE number 3847229
Cites work
- scientific article; zbMATH DE number 3215121 (Why is no real title available?)
- A Multi-Product Dynamic Lot-Size Model with Individual and Joint Set-up Costs
- A Successive Underestimation Method for Concave Minimization Problems
- A finite algorithm for concave minimization over a polyhedron
- Concave minimization over a convex polyhedron
- Convex Analysis
- Global Maximization of a Convex Function with Linear Inequality Constraints
- Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain
- Lagrange Multipliers and Nonconvex Programs
- Quasi-concave minimization subject to linear constraints
- The Direct Power of Adjacent Vertex Programming Methods
- The computation of fixed points and applications
- The interactive fixed charge linear programming problem
- Variations on a cutting plane method for solving concave minimization problems with linear constraints
Cited in
(9)- An algorithm for concave integer minimization over a polyhedron
- An algorithm and new penalties for concave integer minimization over a polyhedron
- Multiproduct dynamic lot-sizing model with coordinated replenishments
- A discrete dynamic convexized method for nonlinear integer programming
- Existence and sum decomposition of vertex polyhedral convex envelopes
- The interactive fixed charge linear programming problem
- A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron
- A new simplicial cover technique in constrained global optimization
- Deterministic methods in constrained global optimization: Some recent advances and new fields of application
This page was built for publication: Using convex envelopes to solve the interactive fixed-charge linear programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1093525)
