Calculating the exact bounds of optimal values in LP with interval coefficients

DOI10.1023/A:1018985914065zbMATH Open0908.90188OpenAlexW139049954MaRDI QIDQ1265869FDOQ1265869

František Mráz

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

zbMATH Keywords

linear programming probleminterval coefficientsinexact dataexact upper and lower bounds

Mathematics Subject Classification ID

Linear programming (90C05)

Cited In (26)

• Monte Carlo simulation for computing the worst value of the objective function in the interval linear programming
• Quantifying outcome functions of linear programs: an approach based on interval-valued right-hand sides
• Some results on the upper bound of optimal values in interval convex quadratic programming
• On sufficiency and duality for a class of interval-valued programming problems
• Optimal value bounds in nonlinear programming with interval data
• Optimal value range in interval linear programming
• The best, the worst and the semi-strong: optimal values in interval linear programming
• KKT optimality conditions in interval valued multiobjective programming with generalized differentiable functions
• Generalized linear fractional programming under interval uncertainty
• Newton's method for interval-valued multiobjective optimization problem
• The Karush-Kuhn-Tucker optimality conditions in multiobjective programming problems with interval-valued objective functions
• The Worst Case Finite Optimal Value in Interval Linear Programming
• New method for computing the upper bound of optimal value in interval quadratic program
• The \(F\)-objective function method for differentiable interval-valued vector optimization problems
• The outcome range problem in interval linear programming
• How to determine basis stability in interval linear programming
• Some properties of the lower bound of optimal values in interval convex quadratic programming
• Linear programming sensitivity measured by the optimal value worst-case analysis
• Interval linear programming under transformations: optimal solutions and optimal value range
• Title not available (Why is that?)
• Bounds on the worst optimal value in interval linear programming
• New efficiency conditions for multiobjective interval-valued programming problems
• Inverse linear programming with interval coefficients
• Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases
• A novel interval linear programming based on probabilistic dominance
• On optimality conditions and duality for non-differentiable interval-valued programming problems with the generalized \((F, \rho)\)-convexity

This page was built for publication: Calculating the exact bounds of optimal values in LP with interval coefficients

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1265869)