Strong solvability of interval linear programming problems
From MaRDI portal
Publication:1147629
DOI10.1007/BF02243426zbMath0449.90062OpenAlexW412199253MaRDI QIDQ1147629
Publication date: 1981
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02243426
necessary and sufficient conditionssolvability conditionsinterval linear programmingstrong solvabilityfinite optimum
Related Items (25)
Stability of the optimal basis of a linear program under uncertainty ⋮ Some properties of the lower bound of optimal values in interval convex quadratic programming ⋮ Generalized solutions to interval linear programmes and related necessary and sufficient optimality conditions ⋮ Weak and strong solvability of interval linear systems of equations and inequalities ⋮ An ensemble framework for assessing solutions of interval programming problems ⋮ Solution convexity of a system of linear interval equations ⋮ Optimal value bounds in interval fractional linear programming and revenue efficiency measuring ⋮ Strong optimal solutions of interval linear programming ⋮ Necessary and sufficient conditions of some strong optimal solutions to the interval linear programming ⋮ AE solutions and AE solvability to general interval linear systems ⋮ On the optimal solution set in interval linear programming ⋮ The best, the worst and the semi-strong: optimal values in interval linear programming ⋮ Necessary and sufficient conditions for unified optimality of interval linear program in the general form ⋮ Interval systems of max-separable linear equations ⋮ Checking strong optimality of interval linear programming with inequality constraints and nonnegative constraints ⋮ Nonlinear equations and optimization ⋮ Duality gap in interval linear programming ⋮ Weak optimal inverse problems of interval linear programming based on KKT conditions ⋮ Analysis of structure in fuzzy linear programs ⋮ Checking weak optimality and strong boundedness in interval linear programming ⋮ A Farkas-type theorem for linear interval equations ⋮ Checking solvability of systems of interval linear equations and inequalities via mixed integer programming ⋮ Linear Programming with Inexact Data is NP‐Hard ⋮ EA solutions and EA solvability to general interval linear systems ⋮ New method for computing the upper bound of optimal value in interval quadratic program
Cites Work
This page was built for publication: Strong solvability of interval linear programming problems
