Pages that link to "Item:Q1278928"
From MaRDI portal
The following pages link to Sensitivity analysis in linear programming: Just be careful! (Q1278928):
Displaying 27 items.
- A labeling algorithm for the sensitivity ranges of the assignment problem (Q651673) (← links)
- 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)
- Partitioning multiple objective optimal solutions with applications in radiotherapy design (Q1027150) (← links)
- Multiparametric linear programming: support set and optimal partition invariancy (Q1038373) (← links)
- A reverse search algorithm for the neighborhood problem (Q1306348) (← links)
- Pivot versus interior point methods: Pros and cons (Q1598748) (← links)
- Generalized average shadow prices and bottlenecks (Q1616793) (← links)
- Capacity optimization and competition with cyclical and lead-time-dependent demands (Q1730571) (← links)
- A global tolerance approach to sensitivity analysis in linear programming (Q1754243) (← links)
- Sensitivity analysis of the optimal assignment. (Q1811143) (← links)
- Global sensitivity analysis via a statistical tolerance approach (Q2239933) (← links)
- Sensitivity analysis of linear programming in the presence of correlation among right-hand side parameters or objective function coefficients (Q2358161) (← links)
- Sensitivity analysis with finite changes: an application to modified EOQ models (Q2379532) (← links)
- Construction of the largest sensitivity region for general linear programs (Q2383657) (← links)
- Parametric LP for sensitivity analysis of efficiency in MOLP problems (Q2439493) (← links)
- Sensitivity analysis in linear optimization: invariant support set intervals (Q2572886) (← links)
- Computing shadow prices with multiple Lagrange multipliers (Q2666654) (← links)
- Sensitivity analysis for bottleneck assignment problems (Q2673565) (← links)
- Quantifying the Trade-off Between IMRT Treatment Plan Quality and Delivery Efficiency Using Direct Aperture Optimization (Q2815465) (← links)
- Tolerance analysis in linear systems and linear programming (Q3093049) (← links)
- A STUDY ON SENSITIVITY ANALYSIS FOR CONVEX QUADRATIC PROGRAMS (Q3421859) (← links)
- SENSITIVITY ANALYSIS OF OBJECTIVE FUNCTION COEFFICIENTS OF THE ASSIGNMENT PROBLEM (Q3439887) (← links)
- Fast Algorithms for Rank-1 Bimatrix Games (Q4994178) (← links)
- Directional shadow price in linearly constrained nonconvex optimization models (Q6154402) (← links)
- Informative Lagrange multipliers in nonlinear parametric programming models (Q6189856) (← links)
