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

DOI10.1007/BF00940686zbMath0725.90068MaRDI QIDQ2277362

Yanyan Li

Publication date: 1991

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

zbMATH Keywords

branch-and-bound algorithmfixed-charge linear programmingfixed-charge continuous knapsack problem

Mathematics Subject Classification ID

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

Related Items (4)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An efficient algorithm for solving fixed charge problems
• Scheduling of power generation via large-scale nonlinear optimization
• Fixed-cost transportation problems
• A branch-and-bound algorithm for solving fixed charge problems
• Improved Penalties for Fixed Cost Linear Programs Using Lagrangean Relaxation
• A SIMPLEX PROCEDURE FOR A FIXED CHARGE PROBLEM
• A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
• A branch-and-bound algorithm for solving a fixed charge problem in the profit optimization of sawn timber production
• An approximate solution method for the fixed charge problem
• An approximative algorithm for the fixed charge problem
• The fixed charge problem

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