Sensitivity analysis of the optimal assignment.

DOI10.1016/S0377-2217(02)00439-3zbMath1035.90090OpenAlexW2094322543MaRDI QIDQ1811143

Chi-Jen Lin, Ue-Pyng Wen

Publication date: 10 June 2003

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00439-3

zbMATH Keywords

Sensitivity analysisAssignment problemDegeneracy

Mathematics Subject Classification ID

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

Related Items (9)

The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems ⋮ Sensitivity analysis for bottleneck assignment problems ⋮ A BRANCH-AND-BOUND ALGORITHM FOR FINDING ALL OPTIMAL SOLUTIONS OF THE ASSIGNMENT PROBLEM ⋮ Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem ⋮ A labeling algorithm for the sensitivity ranges of the assignment problem ⋮ Tolerance-based branch and bound algorithms for the ATSP ⋮ An addendum on: ``Sensitivity analysis of the optimal assignment ⋮ Sensitivity analysis in linear optimization: invariant support set intervals ⋮ SENSITIVITY ANALYSIS OF OBJECTIVE FUNCTION COEFFICIENTS OF THE ASSIGNMENT PROBLEM

Cites Work

• Unnamed Item
• A genuinely polynomial primal simplex algorithm for the assignment problem
• Approaches to sensitivity analysis in linear programming
• Shadow prices and sensitivity analysis in linear programming under degeneracy. State-of-the-art-survey
• Solution structures and sensitivity of special assignment problems
• Survey of solved and open problems in the degeneracy phenomenon
• A geometric view of parametric linear programming
• Weakly redundant constraints and their impact on postoptimal analyses in LP
• On the connectedness of optimum-degeneracy graphs
• Sensitivity analysis in linear programming: Just be careful!
• A basis-defiency-allowing variation of the simplex method for linear programming
• Treatment of combinatorial optimization problems using selection equations with cost terms. I: Two-dimensional assignment problems
• An operator theory of parametric programming for the transportation problem-I
• A Review of Sensitivity Results for Linear Networks and a New Approximation to Reduce the Effects of Degeneracy
• Integer Programming Post-Optimal Analysis with Cutting Planes
• Postoptimality Analyses of the Transportation Problem
• Implicit enumeration based algorithms for postoptimizing zero-one programs
• Postoptimality analysis in zero‐one programming by implicit enumeration
• Approximating reduced costs under degeneracy in a network flow problem with side constraints

This page was built for publication: Sensitivity analysis of the optimal assignment.