Pages that link to "Item:Q1278928"
From MaRDI portal
The following pages link to Sensitivity analysis in linear programming: Just be careful! (Q1278928):
Displayed 14 items.
- Post-optimality analysis of the optimal solution of a degenerate linear program using a pivoting algorithm (Q868125) (← links)
- Sensitivity analysis in linear semi-infinite programming: perturbing cost and right-hand-side coefficients (Q877589) (← links)
- Active constraint set invariancy sensitivity analysis in linear optimization (Q946305) (← links)
- A reverse search algorithm for the neighborhood problem (Q1306348) (← links)
- Pivot versus interior point methods: Pros and cons (Q1598748) (← links)
- Sensitivity analysis of the optimal assignment. (Q1811143) (← links)
- Construction of the largest sensitivity region for general linear programs (Q2383657) (← links)
- Sensitivity analysis in linear optimization: invariant support set intervals (Q2572886) (← links)
- A STUDY ON SENSITIVITY ANALYSIS FOR CONVEX QUADRATIC PROGRAMS (Q3421859) (← links)
- SENSITIVITY ANALYSIS OF OBJECTIVE FUNCTION COEFFICIENTS OF THE ASSIGNMENT PROBLEM (Q3439887) (← links)
- POSITIVE SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING (Q4650618) (← links)
- ON THE PROPERTIES OF ∊-SENSITIVITY ANALYSIS FOR LINEAR PROGRAMMING (Q5315980) (← links)
- Sensitivity analysis in convex quadratic optimization: invariant support set interval (Q5466704) (← links)
- An easy way to teach interior-point methods. (Q5932020) (← links)