Improved Penalties for Fixed Cost Linear Programs Using Lagrangean Relaxation
From MaRDI portal
Recommendations
- An exact penalty-Lagrangian approach for large-scale nonlinear programming
- A Lagrange penalty reformulation method for constrained optimization
- On a Lagrangian penalty function method for nonlinear programming problems
- An Exact Penalty Function and Relaxation Approach for Solving Decomposable Nonlinear Programs
- An exact penalty-lagrangian approach for a class of constrained optimization problems with bounded variables
- scientific article; zbMATH DE number 1440126
- A penalty method for solving mixed linear complementarity problems
- EXTENSIONS OF THE MULTIPLICATIVE PENALTY FUNCTION METHOD FOR LINEAR PROGRAMMING
- A penalty approach to linear programs with many two-sided constraints
- A new penalty method for nonlinear programming
Cited in
(11)- Tabu search applied to the general fixed charge problem
- Some branch-and-bound procedures for fixed-cost transportation problems
- COLE: a new heuristic approach for fixed charge problem computational results
- Algorithms for solving the single-sink fixed-charge transportation problem
- scientific article; zbMATH DE number 1330764 (Why is no real title available?)
- A tabu search heuristic procedure for the fixed charge transportation problem
- Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics
- Penalty computations for the set partitioning problem
- Exact algorithm for solving a special fixed-charge linear programming problem
- An improved branch and bound algorithm for minimum concave cost network flow problems
- A computational study of using preprocessing and stronger formulations to solve large general fixed charge problems
This page was built for publication: Improved Penalties for Fixed Cost Linear Programs Using Lagrangean Relaxation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3735468)
