Strong solvability of restricted interval systems and its applications in quadratic and geometric programming
From MaRDI portal
Publication:6536715
DOI10.1016/j.laa.2022.12.024zbMATH Open1545.65205MaRDI QIDQ6536715
Publication date: 13 May 2024
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
quadratic programminglinear systeminterval analysisconvex programminglinear interval systemrobust solution
Numerical mathematical programming methods (65K05) Convex programming (90C25) Quadratic programming (90C20) General methods in interval analysis (65G40) Linear equations (linear algebraic aspects) (15A06)
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- AE solutions and AE solvability to general interval linear systems
- Optimal value bounds in nonlinear programming with interval data
- Computational method for the profit bounds of inventory model with interval demand and unit cost
- Strong solvability of interval linear programming problems
- Interval convex quadratic programming problems in a general form
- New method for computing the upper bound of optimal value in interval quadratic program
- Fenchel-Lagrange duality versus geometric duality in convex optimization
- A numerical solution method to interval quadratic programming
- Posynomial geometric programming with interval exponents and coefficients
- Transformations of interval linear systems of equations and inequalities
- Positive Definiteness and Stability of Interval Matrices
- Linear interval inequalities
- Solvability of Systems of Linear Interval Equations
- Nonlinear Programming
- Linear Optimization Problems with Inexact Data
- Duality Theory for Geometric Programming
This page was built for publication: Strong solvability of restricted interval systems and its applications in quadratic and geometric programming
