Exact algorithm for solving a special fixed-charge linear programming problem

DOI10.1007/BF00940686MaRDI QIDQ2277362zbMATH OpenFDO

Authors Yanyan Li

Publication date 1991

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

Full work available at URL https://doi.org/10.1007/BF00940686

zbMATH Keywords

branch-and-bound algorithmfixed-charge continuous knapsack problemfixed-charge linear programming

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Production models (90B30) Linear programming (90C05) Integer programming (90C10) Applications of mathematical programming (90C90)

Review text

See the preview in Zbl 0702.90060.

Cites work

• A branch-and-bound algorithm for solving a fixed charge problem in the profit optimization of sawn timber production
• A branch-and-bound algorithm for solving fixed charge problems
• A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
• A SIMPLEX PROCEDURE FOR A FIXED CHARGE PROBLEM
• An approximate solution method for the fixed charge problem
• An approximative algorithm for the fixed charge problem
• An efficient algorithm for solving fixed charge problems
• Fixed-cost transportation problems
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3791939 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3594862 (Why is no real title available?)
• scientific article; zbMATH DE number 3286663 (Why is no real title available?)
• Improved Penalties for Fixed Cost Linear Programs Using Lagrangean Relaxation
• Scheduling of power generation via large-scale nonlinear optimization
• The fixed charge problem

Cited in

(4)

• Algorithms for solving the single-sink fixed-charge transportation problem
• A novel reformulation for the single-sink fixed-charge transportation problem
• Maximization of generalized convex functionals in locally convex spaces.
• An acquisition policy for a multi-supplier system with a finite-time horizon

This page was built for publication: Exact algorithm for solving a special fixed-charge linear programming problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277362)