Checking weak and strong optimality of the solution to interval convex quadratic program
From MaRDI portal
Publication:2244344
Recommendations
- Checking weak optimality of the solution to interval linear program in the general form
- Checking strong optimality of interval linear programming with inequality constraints and nonnegative constraints
- Strong optimal solutions of interval linear programming
- On strong optimality of interval linear programming
- Checking weak optimality and strong boundedness in interval linear programming
Cites work
- A new technique in systems analysis under interval uncertainty and ambiguity
- A numerical solution method to interval quadratic programming
- An introduction to optimization
- Checking weak optimality of the solution to linear programming with interval right-hand side
- Complexity of necessary efficiency in interval linear programming and multiobjective linear programming
- Direct and iterative methods for interval parametric algebraic systems producing parametric solutions.
- Duality theory for optimization problems with interval-valued objective functions
- Interval convex quadratic programming problems in a general form
- Linear interval inequalities
- Linear Optimization Problems with Inexact Data
- Linear programming with interval coefficients
- Necessary and sufficient conditions of some strong optimal solutions to the interval linear programming
- New method for computing the upper bound of optimal value in interval quadratic program
- Numerical solution method for general interval quadratic programming
- On interval-valued nonlinear programming problems
- Optimal value bounds in nonlinear programming with interval data
- Rank one interval enclosure of the parametric united solution set
- Solvability and feasibility of interval linear equations and inequalities
- Solvability of Systems of Linear Interval Equations
- Some results on the upper bound of optimal values in interval convex quadratic programming
- Strong optimal solutions of interval linear programming
- Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases
- Weak and strong solvability of interval linear systems of equations and inequalities
Cited in
(4)- Some properties of the lower bound of optimal values in interval convex quadratic programming
- Checking weak optimality of the solution to interval linear program in the general form
- Checking weak and strong optimality of the solution to interval convex quadratic programming in a general form
- Basis stability in interval quadratic programming
This page was built for publication: Checking weak and strong optimality of the solution to interval convex quadratic program
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2244344)
