Applications of the parametric programming procedure

DOI10.1016/0377-2217(91)90323-NMaRDI QIDQ1179007zbMATH OpenFDO

Authors N. A. Bryson

Publication date 26 June 1992

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

Full work available at URL https://doi.org/10.1016/0377-2217(91)90323-N

zbMATH Keywords

clusteringLagrangian relaxationlinear one-parametric programming

Mathematics Subject Classification ID

Linear programming (90C05) Integer programming (90C10) Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31) Programming involving graphs or networks (90C35)

Review text

This article presents five recent applications of the parametric programming procedure of Gass and Saaty for solving a linear one- parametric programming problem with a parametric objective function. At first an outline of this parametric programming procedure is given. Afterwards relationships between the parametric programming procedure and a) a Lagrangian relaxation of a linear integer programming problem, b) a clustering problem, c) the three-objective linear programming problem, d) a network flow problem with one side constraint, e) a cycling avoidance in the simplex method, are explored.

Recommendations

• Parametric programming and the primal-dual algorithm
• Parametric linear programming and cluster analysis
• Parametric objective function. I
• Parametric methods in integer linear programming

Cites work

• A general method for determining the set of all efficient solutions to a linear vectormaximum problem
• A Lagrangean relaxation method for the constrained assignment problem
• A Lagrangian treatment of certain nonlinear clustering problems
• Computational complexity of parametric linear programming
• Finding all efficient extreme points for multiple objective linear programs
• scientific article; zbMATH DE number 4010155 (Why is no real title available?)
• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• Identifying Efficient Vectors: Some Theory and Computational Results
• Linear multiobjective programming
• Making progress during a stall in the simplex algorithm
• Network flow problems with one side constraint: A comparison of three solution methods
• Parametric linear programming and anti-cycling pivoting rules
• The Average number of pivot steps required by the Simplex-Method is polynomial
• The constrained shortest path problem
• The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program

Cited in

(6)

• Parametric linear programming and cluster analysis
• Parametric programming and Lagrangian relaxation: The case of the network problem with a single side-constraint
• A parametric programming methodology to solve the Lagrangian dual for network problems with multiple side-constraints
• scientific article; zbMATH DE number 5168299 (Why is no real title available?)
• scientific article; zbMATH DE number 1471810 (Why is no real title available?)
• Parametric programming and the primal-dual algorithm

This page was built for publication: Applications of the parametric programming procedure

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