Checking weak and strong optimality of the solution to interval convex quadratic programming in a general form

DOI10.1007/s11590-023-01998-7OpenAlexW4366990687MaRDI QIDQ6181380

Meng-xue Xia, Haohao Li, Daojun Xu

Publication date: 22 January 2024

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-023-01998-7

zbMATH Keywords

feasible directionsinterval convex quadratic programstrongly optimal solutionweakly optimal solution

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Some results on the upper bound of optimal values in interval convex quadratic programming
• Weak and strong solvability of interval linear systems of equations and inequalities
• Optimal value bounds in nonlinear programming with interval data
• Solvability and feasibility of interval linear equations and inequalities
• Some properties of the lower bound of optimal values in interval convex quadratic programming
• On strong optimality of interval linear programming
• Interval convex quadratic programming problems in a general form
• Checking weak and strong optimality of the solution to interval convex quadratic program
• Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases
• A note on dependency between interval linear systems
• New method for computing the upper bound of optimal value in interval quadratic program
• Strong optimal solutions of interval linear programming
• Necessary and sufficient conditions of some strong optimal solutions to the 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
• Solution set characterization of linear interval systems with a specific dependence structure
• Linear programming with interval coefficients
• Duality in quadratic programming
• Linear interval inequalities
• Explicit Description of AE Solution Sets for Parametric Linear Systems
• Linear Optimization Problems with Inexact Data
• Unnamed Item
• Unnamed Item

This page was built for publication: Checking weak and strong optimality of the solution to interval convex quadratic programming in a general form