Pages that link to "Item:Q3340644"

The following pages link to Using bounds on the data in linear programming: The tolerance approach to sensitivity analysis (Q3340644):

Displayed 31 items.

• Maximal and supremal tolerances in multiobjective linear programming (Q257229) ‎ (← links)
• Post-optimality approach to prevent cycling in linear MPC target calculation (Q389830) ‎ (← links)
• Approaches to sensitivity analysis in linear programming (Q757255) ‎ (← links)
• An interactive method of tackling uncertainty in interval multiple objective linear programming (Q844514) ‎ (← links)
• Multi-parametric analysis of the maximum tolerance in a linear programming problem (Q1261401) ‎ (← links)
• Stability aspects of the traveling salesman problem based on \(k\)-best solutions (Q1270780) ‎ (← links)
• Special cases of the tolerance approach in multiobjective linear programming (Q1278738) ‎ (← links)
• Tolerance approach to sensitivity analysis in linear complementarity problems (Q1321172) ‎ (← links)
• The tolerance approach in multiobjective linear fractional programming (Q1383319) ‎ (← links)
• A global tolerance approach to sensitivity analysis in linear programming (Q1754243) ‎ (← links)
• Perturbation analysis of general LP models: A unified approach to sensitivity, parametric, tolerance, and more-for-less analysis (Q1813475) ‎ (← links)
• Sensitivity analysis in multiple objective linear programming: The tolerance approach (Q1823157) ‎ (← links)
• A visual interactive tolerance approach to sensitivity analysis in MOLP (Q1848371) ‎ (← links)
• Enlarging the radius of stability and stability regions in data envelopment analysis (Q1999372) ‎ (← links)
• Global sensitivity analysis via a statistical tolerance approach (Q2239933) ‎ (← links)
• New conditions for testing necessarily/possibly efficiency of non-degenerate basic solutions based on the tolerance approach (Q2286943) ‎ (← links)
• Sensitivity analysis of linear programming in the presence of correlation among right-hand side parameters or objective function coefficients (Q2358161) ‎ (← links)
• Construction of the largest sensitivity region for general linear programs (Q2383657) ‎ (← links)
• Tolerance approach to sensitivity analysis in quadratic programming problems. (Q2468595) ‎ (← links)
• Globally tight bounds for almost differentiable functions over polytopes with application to tolerance analysis. (Q2477109) ‎ (← links)
• On multiparametric analysis in network linear programming. (Q2477127) ‎ (← links)
• A fresh view on the tolerance approach to sensitivity analysis in linear programming (Q2484336) ‎ (← links)
• Tolerance analysis in linear systems and linear programming (Q3093049) ‎ (← links)
• SENSITIVITY ANALYSIS OF OBJECTIVE FUNCTION COEFFICIENTS OF THE ASSIGNMENT PROBLEM (Q3439887) ‎ (← links)
• Extreme points of well-posed polytopes (Q3446581) ‎ (← links)
• Perturbation analysis for the minimum sum of absolute errors regression (Q3471509) ‎ (← links)
• LINEAR PROGRAMMING MODELS WITH CHANGEABLE PARAMETERS — THEORETICAL ANALYSIS ON "TAKING LOSS AT THE ORDERING TIME AND MAKING PROFIT AT THE DELIVERY TIME" (Q3503109) ‎ (← links)
• Dual contingency plans in optimal generalized linear designs (Q4311265) ‎ (← links)
• Tolerance Approach to Sensitivity Analysis in Multiobjective Transportation Problem (Q5140052) ‎ (← links)
• Linear Programming with Interval Data: A Two-Level Programming Approach (Q5244683) ‎ (← links)
• The concept of proper solution in linear programming (Q5925744) ‎ (← links)