Robust optimal solutions in interval linear programming with forall-exists quantifiers
From MaRDI portal
Abstract: We introduce a novel kind of robustness in linear programming. A solution x* is called robust optimal if for all realizations of objective functions coefficients and constraint matrix entries from given interval domains there are appropriate choices of the right-hand side entries from their interval domains such that x* remains optimal. we propose a method to check for robustness of a given point, and also recommend how a suitable candidate can be found. We also discuss topological properties of the robust optimal solution set. We illustrate applicability of our concept in a transportation problem.
Recommendations
- Strong optimal solutions of interval linear programming
- On strong optimality of interval linear programming
- On the optimal solution set in interval linear programming
- Necessary and sufficient conditions of some strong optimal solutions to the interval linear programming
- A concept of a robust solution of a multicriterial linear programming problem
Cites work
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- A new technique in systems analysis under interval uncertainty and ambiguity
- An interior-point method for generalized linear-fractional programming
- An interior-point method for multifractional programs with convex constraints
- An interval linear tolerance problem
- Checking strong optimality of interval linear programming with inequality constraints and nonnegative constraints
- Complexity of necessary efficiency in interval linear programming and multiobjective linear programming
- Derived eigenvalues of symmetric matrices, with applications to distance geometry
- Explicit Reformulations for Robust Optimization Problems with General Uncertainty Sets
- Explicit description of \(AE\) solution sets for parametric linear systems
- How to determine basis stability in interval linear programming
- Inner estimation of the parametric tolerable solution set
- Introduction to Interval Analysis
- Linear Optimization Problems with Inexact Data
- Maximal and supremal tolerances in multiobjective linear programming
- Minimax regret solution to linear programming problems with an interval objective function
- Minimax regret solution to multiobjective linear programming problems with interval objective functions coefficients
- Necessary and sufficient conditions of some strong optimal solutions to the interval linear programming
- New operator and method for solving real preconditioned interval linear equations
- On approximation of the best case optimal value in interval linear programming
- On the complexity of minmax regret linear programming
- Outer enclosures to the parametric \(AE\) solution set
- Robust optimization
- Robustness and duality in linear programming
- Strong optimal solutions of interval linear programming
- The optimal solution set of the interval linear programming problems
- Weak and strong solvability of interval linear systems of equations and inequalities
Cited in
(18)- A necessity measure of fuzzy inclusion relation in linear programming problems
- A robust BFGS algorithm for unconstrained nonlinear optimization problems
- Necessary and sufficient conditions for unified optimality of interval linear program in the general form
- Solving interval quadratic programming problems by using the numerical method and swarm algorithms
- Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases
- Optimality Analysis for Stochastic LP Problems
- An Extended Necessity Measure Maximisation Incorporating the Trade-Off between Robustness and Satisfaction in Fuzzy LP Problems
- scientific article; zbMATH DE number 2159096 (Why is no real title available?)
- A discussion on the robust vector autoregressive models: novel evidence from safe haven assets
- AE solutions to two-sided interval linear systems over max-plus algebra
- AE solutions to interval linear systems over max-plus algebra
- AE solutions and AE solvability to general interval linear systems
- Farkas-type conditions of general interval linear systems for AE solvability
- An interval sequential linear programming for nonlinear robust optimization problems
- EA solutions and EA solvability to general interval linear systems
- On strong optimality of interval linear programming
- A concept of a robust solution of a multicriterial linear programming problem
- A parameter method for linear algebra and optimization with uncertainties
This page was built for publication: Robust optimal solutions in interval linear programming with forall-exists quantifiers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q323404)
