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

DOI10.1016/0305-0548(93)90017-DMaRDI QIDQ2368115zbMATH OpenFDO

Authors N. A. Bryson

Publication date 23 August 1993

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

Full work available at URL https://doi.org/10.1016/0305-0548(93)90017-D

zbMATH Keywords

Lagrangian relaxationlinear side-constraintsparametric programmingsubgradient method

Mathematics Subject Classification ID

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

Recommendations

• Parametric programming and Lagrangian relaxation: The case of the network problem with a single side-constraint
• A surrogate and Lagrangian approach to constrained network problems
• scientific article; zbMATH DE number 1070392
• On Lagrangian duality for multiparametric programs
• On the efficiency of multiplier methods for nonlinear network problems with nonlinear constraints
• Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints
• scientific article; zbMATH DE number 433004
• A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows
• On a parametric shortest path problem from primal—dual multicommodity network optimization

Cites work

• A Lagrangean relaxation method for the constrained assignment problem
• A Lagrangian treatment of certain nonlinear clustering problems
• An Application of Lagrangian Relaxation to Scheduling in Power-Generation Systems
• Applications of the parametric programming procedure
• scientific article; zbMATH DE number 4010155 (Why is no real title available?)
• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• Linear multiobjective programming
• Making progress during a stall in the simplex algorithm
• Parametric linear programming and anti-cycling pivoting rules
• Parametric programming and Lagrangian relaxation: The case of the network problem with a single side-constraint
• Resource-Constrained Assignment Scheduling
• Solving Constrained Transportation Problems
• Solving network manpower problems with side constraints
• Technical Note—The One-Dimensional Generalized Lagrange Multiplier Problem

Cited in

(6)

• Partitioning of sequentially ordered systems using linear programming
• Parametric programming and Lagrangian relaxation: The case of the network problem with a single side-constraint
• A new idea to evaluate networking problem and MCGDM problem in parametric interval valued Pythagorean arena
• A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows
• A survey of exact and approximation algorithms for linear-parametric optimization problems
• A surrogate and Lagrangian approach to constrained network problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2368115)