Pages that link to "Item:Q1075251"
From MaRDI portal
The following pages link to Shadow prices and sensitivity analysis in linear programming under degeneracy. State-of-the-art-survey (Q1075251):
Displayed 19 items.
- Post-optimality approach to prevent cycling in linear MPC target calculation (Q389830) (← links)
- A linear programming-based algorithm for the signed separation of (non-smooth) convex bodies (Q695915) (← links)
- Approaches to sensitivity analysis in linear programming (Q757255) (← links)
- Survey of solved and open problems in the degeneracy phenomenon (Q1101009) (← links)
- Average shadow price in a mixed integer linear programming problem (Q1127163) (← links)
- A new pivoting rule for solving various degeneracy problems (Q1198621) (← links)
- Weakly redundant constraints and their impact on postoptimal analyses in LP (Q1199513) (← links)
- On the connectedness of optimum-degeneracy graphs (Q1278372) (← links)
- Sensitivity analysis in linear programming: Just be careful! (Q1278928) (← links)
- Selected bibliography on degeneracy (Q1312748) (← links)
- Degeneracy graphs: Theory and applications. An updated survey (Q1312751) (← links)
- Degeneracy in interior point methods for linear programming: A survey (Q1312753) (← links)
- On some properties of \(0\)-degeneracy graphs (Q1312774) (← links)
- The use of the optimal partition in a linear programming solution for postoptimal analysis (Q1342079) (← links)
- Generalized average shadow prices and bottlenecks (Q1616793) (← links)
- Sensitivity analysis of the optimal assignment. (Q1811143) (← links)
- Construction of the largest sensitivity region for general linear programs (Q2383657) (← links)
- SENSITIVITY ANALYSIS OF OBJECTIVE FUNCTION COEFFICIENTS OF THE ASSIGNMENT PROBLEM (Q3439887) (← links)
- Support prices of activities in linear programming<sup>1</sup>,<sup>2</sup> (Q4733662) (← links)