Strong solvability of restricted interval systems and its applications in quadratic and geometric programming

DOI10.1016/J.LAA.2022.12.024MaRDI QIDQ6536715zbMATH OpenFDO

Authors Milan Hladík

Publication date 13 May 2024

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.LAA.2022.12.024

zbMATH Keywords

convex programminginterval analysislinear interval systemlinear systemquadratic programmingrobust solution

Mathematics Subject Classification ID

Linear equations (linear algebraic aspects) (15A06) General methods in interval analysis (65G40) Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Convex programming (90C25)

Recommendations

• Weak and strong solvability of interval linear systems of equations and inequalities
• Checking weak and strong optimality of the solution to interval convex quadratic programming in a general form
• Checking strong optimality of interval linear programming with inequality constraints and nonnegative constraints
• Necessary and sufficient conditions of some strong optimal solutions to the interval linear programming
• Strong optimal solutions of interval linear programming

Cites work

• A numerical solution method to interval quadratic programming
• AE solutions and AE solvability to general interval linear systems
• Computational method for the profit bounds of inventory model with interval demand and unit cost
• Duality Theory for Geometric Programming
• Fenchel-Lagrange duality versus geometric duality in convex optimization
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• Interval convex quadratic programming problems in a general form
• Linear interval inequalities
• Linear Optimization Problems with Inexact Data
• New method for computing the upper bound of optimal value in interval quadratic program
• Nonlinear Programming
• Optimal value bounds in nonlinear programming with interval data
• Positive Definiteness and Stability of Interval Matrices
• Posynomial geometric programming with interval exponents and coefficients
• Solvability of Systems of Linear Interval Equations
• Some results on the upper bound of optimal values in interval convex quadratic programming
• Strong solvability of interval linear programming problems
• Transformations of interval linear systems of equations and inequalities
• Weak and strong solvability of interval linear systems of equations and inequalities

Cited in

(1)

• Range of optimal values in absolute value linear programming with interval data

This page was built for publication: Strong solvability of restricted interval systems and its applications in quadratic and geometric programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536715)