Calculating the exact bounds of optimal values in LP with interval coefficients
From MaRDI portal
Publication:1265869
DOI10.1023/A:1018985914065zbMath0908.90188OpenAlexW139049954MaRDI QIDQ1265869
Publication date: 27 September 1998
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018985914065
Related Items (24)
Some results on the upper bound of optimal values in interval convex quadratic programming ⋮ The Karush-Kuhn-Tucker optimality conditions in multiobjective programming problems with interval-valued objective functions ⋮ KKT optimality conditions in interval valued multiobjective programming with generalized differentiable functions ⋮ The \(F\)-objective function method for differentiable interval-valued vector optimization problems ⋮ Some properties of the lower bound of optimal values in interval convex quadratic programming ⋮ The outcome range problem in interval linear programming ⋮ A novel interval linear programming based on probabilistic dominance ⋮ Quantifying outcome functions of linear programs: an approach based on interval-valued right-hand sides ⋮ Newton's method for interval-valued multiobjective optimization problem ⋮ On sufficiency and duality for a class of interval-valued programming problems ⋮ Optimal value bounds in nonlinear programming with interval data ⋮ How to determine basis stability in interval linear programming ⋮ On optimality conditions and duality for non-differentiable interval-valued programming problems with the generalized \((F, \rho)\)-convexity ⋮ The Worst Case Finite Optimal Value in Interval Linear Programming ⋮ The best, the worst and the semi-strong: optimal values in interval linear programming ⋮ Inverse linear programming with interval coefficients ⋮ Interval linear programming under transformations: optimal solutions and optimal value range ⋮ Generalized linear fractional programming under interval uncertainty ⋮ Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases ⋮ Optimal value range in interval linear programming ⋮ Monte Carlo simulation for computing the worst value of the objective function in the interval linear programming ⋮ Bounds on the worst optimal value in interval linear programming ⋮ New efficiency conditions for multiobjective interval-valued programming problems ⋮ New method for computing the upper bound of optimal value in interval quadratic program
This page was built for publication: Calculating the exact bounds of optimal values in LP with interval coefficients
