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

DOI10.1007/BF00940686zbMATH Open0725.90068MaRDI QIDQ2277362FDOQ2277362

Authors: 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

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

Cites Work

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

Cited In (4)

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

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)