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

DOI10.1016/0305-0548(91)90084-5zbMath0742.90078OpenAlexW2084369628MaRDI 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 relaxationparametric programmingnetwork problemsingle linear side-constraint

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Sensitivity, stability, parametric optimization (90C31) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

Related Items (9)

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

Uses Software

• XMP

This page was built for publication: Parametric programming and Lagrangian relaxation: The case of the network problem with a single side-constraint