Approaches to sensitivity analysis in linear programming (Q757255): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Shadow Prices in Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computation of Shadow Prices in Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3968042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Objective function bounds for the inexact linear programming problem with generalized cost coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: On stochastic linear programming distribution problems, stochastic technology matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3026160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivitätsanalysen und parametrische Programmierung / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Exact Solutions of Inexact Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to sensitivity and stability analysis in nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approach to Sensitivity Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Postoptimal analysis of a linear program under simultaneous changes in matrix coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4194726 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear parametric programming—A brief survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shadow prices and sensitivity analysis in linear programming under degeneracy. State-of-the-art-survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survey of solved and open problems in the degeneracy phenomenon / 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: Multiparametric Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On linear multiparametric optimization with parameter-dependent constraint matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of degeneracy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A construction method in parametric programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tolerance Approach to Sensitivity Analysis of Matrix Coefficients in Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tolerance Approach to Sensitivity Analysis of Matrix Coefficients in Linear Programming: General Perturbations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—A Duality Theory for Convex Programming with Set-Inclusive Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inexact linear programming with generalized resource sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Linear Programming Problems with Interval Objective Function Coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tolerance Approach to Sensitivity Analysis in Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using bounds on the data in linear programming: The tolerance approach to sensitivity analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A preview of a tolerance approach to sensitivity analysis in linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Technique for Resolving Degeneracy in Linear Programming / rank
 
Normal rank

Latest revision as of 15:09, 21 June 2024

scientific article
Language Label Description Also known as
English
Approaches to sensitivity analysis in linear programming
scientific article

    Statements

    Approaches to sensitivity analysis in linear programming (English)
    0 references
    0 references
    0 references
    0 references
    1990
    0 references
    This paper surveys approaches to sensitivity analysis in linear programming problems ``Max cx, s.t. \(Ax=b\), \(x\geq 0''\), emphasizing their role in summarizing the effects of variations in the parameters b and/or c in a manner that is computationally practical and that provides useful and easy-to-understand information for decision-makers. Both advantages and disadvantages of these approaches are pointed out.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references