Applications of the parametric programming procedure

DOI10.1016/0377-2217(91)90323-NzbMath0744.90084MaRDI QIDQ1179007

N. A. Bryson

Publication date: 26 June 1992

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

Lagrangian relaxation; clustering; linear one-parametric programming

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C10: Integer programming

90C29: Multi-objective and goal programming

90C31: Sensitivity, stability, parametric optimization

90C05: Linear programming

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• A Lagrangean relaxation method for the constrained assignment problem
• Network flow problems with one side constraint: A comparison of three solution methods
• 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
• Linear multiobjective programming
• A general method for determining the set of all efficient solutions to a linear vectormaximum problem
• Computational complexity of parametric linear programming
• Identifying Efficient Vectors: Some Theory and Computational Results
• The Average number of pivot steps required by the Simplex-Method is polynomial
• The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
• Finding all efficient extreme points for multiple objective linear programs
• The constrained shortest path problem