SENSITIVITY ANALYSIS OF OBJECTIVE FUNCTION COEFFICIENTS OF THE ASSIGNMENT PROBLEM

DOI10.1142/S0217595907001115zbMath1121.90086MaRDI QIDQ3439887

Ue-Pyng Wen, Chi-Jen Lin

Publication date: 21 May 2007

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

sensitivity analysisdegeneracyassignment problemparametric analysis

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Discrete location and assignment (90B80)

Related Items (5)

Approximating the stability region for binary mixed-integer programs ⋮ Sensitivity analysis for bottleneck assignment problems ⋮ Auction algorithm sensitivity for multi-robot task allocation ⋮ Determining type II sensitivity ranges of the fractional assignment problem ⋮ A labeling algorithm for the sensitivity ranges of the assignment problem

Cites Work

• Unnamed Item
• Approaches to sensitivity analysis in linear programming
• Shadow prices and sensitivity analysis in linear programming under degeneracy. State-of-the-art-survey
• A geometric view of parametric linear programming
• Weakly redundant constraints and their impact on postoptimal analyses in LP
• Sensitivity analysis in linear programming: Just be careful!
• The use of the optimal partition in a linear programming solution for postoptimal analysis
• Sensitivity analysis of the optimal assignment.
• An Interior-Point Approach to Sensitivity Analysis in Degenerate Linear Programs
• Using bounds on the data in linear programming: The tolerance approach to sensitivity analysis
• POSITIVE SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING
• Simultaneous Primal-Dual Right-Hand-Side Sensitivity Analysis from a Strictly Complementary Solution of a Linear Program
• Approximating reduced costs under degeneracy in a network flow problem with side constraints

This page was built for publication: SENSITIVITY ANALYSIS OF OBJECTIVE FUNCTION COEFFICIENTS OF THE ASSIGNMENT PROBLEM