Applications of the parametric programming procedure (Q1179007): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: N. A. Bryson / rank
Normal rank
 
Property / author
 
Property / author: N. A. Bryson / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangean relaxation method for the constrained assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The constrained shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network flow problems with one side constraint: A comparison of three solution methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Average number of pivot steps required by the Simplex-Method is polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3760254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Making progress during a stall in the simplex algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding all efficient extreme points for multiple objective linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general method for determining the set of all efficient solutions to a linear vectormaximum problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric linear programming and anti-cycling pivoting rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of parametric linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian treatment of certain nonlinear clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear multiobjective programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying Efficient Vectors: Some Theory and Computational Results / rank
 
Normal rank

Latest revision as of 13:38, 15 May 2024

scientific article
Language Label Description Also known as
English
Applications of the parametric programming procedure
scientific article

    Statements

    Applications of the parametric programming procedure (English)
    0 references
    26 June 1992
    0 references
    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.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    linear one-parametric programming
    0 references
    Lagrangian relaxation
    0 references
    clustering
    0 references
    0 references