A parametric programming methodology to solve the Lagrangian dual for network problems with multiple side-constraints

DOI10.1016/0305-0548(93)90017-DzbMath0784.90092MaRDI QIDQ2368115

N. A. Bryson

Publication date: 23 August 1993

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

zbMATH Keywords

Lagrangian relaxationparametric programmingsubgradient methodlinear side-constraints

Mathematics Subject Classification ID

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

Related Items (1)

Partitioning of sequentially ordered systems using linear programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving network manpower problems with side constraints
• A Lagrangean relaxation method for the constrained assignment problem
• Parametric linear programming and anti-cycling pivoting rules
• Making progress during a stall in the simplex algorithm
• A Lagrangian treatment of certain nonlinear clustering problems
• Applications of the parametric programming procedure
• Linear multiobjective programming
• Parametric programming and Lagrangian relaxation: The case of the network problem with a single side-constraint
• Resource-Constrained Assignment Scheduling
• Solving Constrained Transportation Problems
• An Application of Lagrangian Relaxation to Scheduling in Power-Generation Systems
• Technical Note—The One-Dimensional Generalized Lagrange Multiplier Problem

This page was built for publication: A parametric programming methodology to solve the Lagrangian dual for network problems with multiple side-constraints