On strong optimality of interval linear programming
From MaRDI portal
Publication:1676494
DOI10.1007/s11590-016-1088-3zbMath1408.90176OpenAlexW2538595016MaRDI QIDQ1676494
Publication date: 9 November 2017
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-016-1088-3
Related Items (5)
Interval transportation problem: feasibility, optimality and the worst optimal value ⋮ Checking weak and strong optimality of the solution to interval convex quadratic programming in a general form ⋮ The Worst Case Finite Optimal Value in Interval Linear Programming ⋮ The best, the worst and the semi-strong: optimal values 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
Cites Work
- Robust optimal solutions in interval linear programming with forall-exists quantifiers
- Weak and strong solvability of interval linear systems of equations and inequalities
- The optimal solution set of the interval linear programming problems
- An enumerative algorithm for computing all possibly optimal solutions to an interval LP
- On approximation of the best case optimal value in interval linear programming
- Necessary and sufficient conditions for unified optimality of interval linear program in the general form
- Optimal value range in interval linear programming
- Safe bounds in linear and mixed-integer linear programming
- Complexity of necessary efficiency in interval linear programming and multiobjective linear programming
- Strong optimal solutions of interval linear programming
- Necessary and sufficient conditions of some strong optimal solutions to the interval linear programming
- How to determine basis stability in interval linear programming
- Checking weak optimality of the solution to linear programming with interval right-hand side
- Checking strong optimality of interval linear programming with inequality constraints and nonnegative constraints
- Generalized solutions to interval linear programmes and related necessary and sufficient optimality conditions
- Linear interval inequalities
- Rigorous Lower and Upper Bounds in Linear Programming
- Linear Optimization Problems with Inexact Data
This page was built for publication: On strong optimality of interval linear programming
