The interactive fixed charge linear programming problem

DOI10.1002/NAV.3800330202MaRDI QIDQ3731367zbMATH OpenOpenAlexFDO

Authors S. Selcuk Erenguc, Harold P. Benson

Publication date 1986

Published in Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.3800330202

zbMATH Keywords

branch and boundoptimal solutionlinear subproblemsinteractive fixed charge linear programming problem

Mathematics Subject Classification ID

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

Recommendations

• Using convex envelopes to solve the interactive fixed-charge linear programming problem
• Publication:3481490
• Fixed charge problems with identical fixed charges
• A branch-and-bound algorithm for solving fixed charge problems
• Solving large-scale mixed-integer programs with fixed charge variables

Cited in

(8)

• The interactive fixed charge inhomogeneous flows optimization problem
• Discontinuous piecewise linear optimization
• Fixed charge problems with identical fixed charges
• A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron
• A computational study of using preprocessing and stronger formulations to solve large general fixed charge problems
• Using convex envelopes to solve the interactive fixed-charge linear programming problem
• scientific article; zbMATH DE number 4143800 (Why is no real title available?)
• scientific article; zbMATH DE number 4152149 (Why is no real title available?)

This page was built for publication: 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 Q3731367)