Tolerance Sensitivity and Optimality Bounds in Linear Programming

DOI10.1287/mnsc.1030.0221zbMath1232.90305OpenAlexW2067630120MaRDI QIDQ3114906

Richard E. Wendell

Publication date: 19 February 2012

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.1030.0221

zbMATH Keywords

linear programmingsensitivity analysisoptimality bounds

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05)

Related Items (13)

Multiple cost coefficients sensitivity theorems of integer linear optimization ⋮ Construction of the largest sensitivity region for general linear programs ⋮ LINEAR PROGRAMMING MODELS WITH CHANGEABLE PARAMETERS — THEORETICAL ANALYSIS ON "TAKING LOSS AT THE ORDERING TIME AND MAKING PROFIT AT THE DELIVERY TIME" ⋮ Managerial insights from service industry models: a new scenario decomposition method ⋮ Faster Kriging: Facing High-Dimensional Simulators ⋮ Global sensitivity analysis via a statistical tolerance approach ⋮ Enlarging the radius of stability and stability regions in data envelopment analysis ⋮ A fresh view on the tolerance approach to sensitivity analysis in linear programming ⋮ New conditions for testing necessarily/possibly efficiency of non-degenerate basic solutions based on the tolerance approach ⋮ Tolerance analysis in linear systems and linear programming ⋮ A note on robustness tolerances for combinatorial optimization problems ⋮ Multiparametric linear programming: support set and optimal partition invariancy ⋮ Linear Programming with Interval Data: A Two-Level Programming Approach

This page was built for publication: Tolerance Sensitivity and Optimality Bounds in Linear Programming