Parametric programming and Lagrangian relaxation: The case of the network problem with a single side-constraint

DOI10.1016/0305-0548(91)90084-5zbMath0742.90078MaRDI QIDQ1814154

N. A. Bryson

Publication date: 25 June 1992

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(91)90084-5

zbMATH Keywords

Lagrangian relaxation; parametric programming; network problem; single linear side-constraint

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C31: Sensitivity, stability, parametric optimization

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

On finding representative non-dominated points for bi-objective integer network flow problems, A specialized network simplex algorithm for the constrained maximum flow problem, The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm, Partitioning of sequentially ordered systems using linear programming, The biobjective minimum cost flow problem, The singly constrained assignment problem: An AP basis algorithm, A novel approach to subgraph selection with multiple weights on arcs, A parametric programming methodology to solve the Lagrangian dual for network problems with multiple side-constraints, Interactive decision support for multiobjective transportation problems

Uses Software

• XMP

Cites Work

• A Lagrangean relaxation method for the constrained assignment problem
• An Application of Lagrangian Relaxation to Scheduling in Power-Generation Systems
• Technical Note—The One-Dimensional Generalized Lagrange Multiplier Problem
• Validation of subgradient optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item