The interactive fixed charge linear programming problem

DOI10.1002/NAV.3800330202zbMATH Open0597.90057OpenAlexW2075990255MaRDI QIDQ3731367FDOQ3731367

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

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

zbMATH Keywords

branch and boundoptimal solutionlinear subproblemsinteractive fixed charge linear programming problem

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)

Cited In (8)

• Discontinuous piecewise linear optimization
• Title not available (Why is that?)
• Title not available (Why is that?)
• A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron
• Fixed charge problems with identical fixed charges
• 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
• The interactive fixed charge inhomogeneous flows optimization problem

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)