How to determine basis stability in interval linear programming
From MaRDI portal
Publication:2439525
DOI10.1007/s11590-012-0589-yzbMath1288.90047OpenAlexW2090242866MaRDI QIDQ2439525
Publication date: 14 March 2014
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-012-0589-y
Related Items (30)
Inverse optimization: towards the optimal parameter set of inverse LP with interval coefficients ⋮ Some results on the upper bound of optimal values in interval convex quadratic programming ⋮ Robust optimal solutions in interval linear programming with forall-exists quantifiers ⋮ Some properties of the lower bound of optimal values in interval convex quadratic programming ⋮ On strong optimality of interval linear programming ⋮ The outcome range problem in interval linear programming ⋮ Generalized solutions to interval linear programmes and related necessary and sufficient optimality conditions ⋮ A novel interval linear programming based on probabilistic dominance ⋮ An ensemble framework for assessing solutions of interval programming problems ⋮ Quantifying outcome functions of linear programs: an approach based on interval-valued right-hand sides ⋮ Solving interval quadratic programming problems by using the numerical method and swarm algorithms ⋮ A fuzzy logic based approach to solve interval multiobjective nonlinear transportation problem ⋮ Checking weak optimality of the solution to linear programming with interval right-hand side ⋮ AE solutions and AE solvability to general interval linear systems ⋮ On approximation of the best case optimal value in interval linear programming ⋮ The Worst Case Finite Optimal Value in Interval Linear Programming ⋮ On the optimal solution set in interval linear programming ⋮ On interval-valued pseudolinear functions and interval-valued pseudolinear optimization problems ⋮ Inverse linear programming with interval coefficients ⋮ Interval convex quadratic programming problems in a general form ⋮ Using modified maximum regret for finding a necessarily efficient solution in an interval MOLP problem ⋮ Checking weak optimality of the solution to interval linear program in the general form ⋮ Bounds on mean absolute deviation portfolios under interval-valued expected future asset returns ⋮ Duality gap in interval linear programming ⋮ Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases ⋮ Farkas-type theorems for interval linear systems ⋮ An improved three-step method for solving the interval linear programming problems ⋮ Solving interval linear programming problems with equality constraints using extended interval enclosure solutions ⋮ Monte Carlo simulation for computing the worst value of the objective function in the interval linear programming ⋮ New method for computing the upper bound of optimal value in interval quadratic program
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Systems of linear interval equations
- A modification of a solution concept of the linear programming problem with interval coefficients in the constraints
- Optimal value range in interval linear programming
- A dual-interval vertex analysis method and its application to environmental decision making under uncertainty
- Calculating the exact bounds of optimal values in LP with interval coefficients
- Complexity of necessary efficiency in interval linear programming and multiobjective linear programming
- Checking robust nonsingularity is NP-hard
- Stability of the optimal basis of a linear program under uncertainty
- Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides
- Fuzzy preference ordering of interval numbers in decision problems
- Sufficient condition of basis stability of an interval linear programming problem
- Linear programming with interval right hand sides
- Introduction to Interval Analysis
- Interval Methods for Systems of Equations
- Sufficient Conditions for Regularity and Singularity of Interval Matrices
- Linear interval inequalities
- A Comparison of some Methods for Solving Linear Interval Equations
- Rigorous solution of linear programming problems with uncertain data
- Computing Exact Componentwise Bounds on Solutions of Lineary Systems with Interval Data is NP-Hard
This page was built for publication: How to determine basis stability in interval linear programming
