Checking weak optimality of the solution to interval linear program in the general form

DOI10.1007/S11590-015-0856-9MaRDI QIDQ5963692zbMATH OpenOpenAlexFDO

Authors Wei Li, Pengzhen Liu, Haohao Li

Publication date 23 February 2016

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-015-0856-9

zbMATH Keywords

interval linear programmingKKT conditionsweak feasible solutionweak optimal solution

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• Checking weak optimality and strong boundedness in interval linear programming
• Checking weak optimality of the solution to linear programming with interval right-hand side
• Checking weak and strong optimality of the solution to interval convex quadratic program
• Checking strong optimality of interval linear programming with inequality constraints and nonnegative constraints
• Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases
• On strong optimality of interval linear programming
• Necessary and sufficient conditions of some strong optimal solutions to the interval linear programming
• Strong optimal solutions of interval linear programming
• scientific article; zbMATH DE number 1023187
• Generalized solutions to interval linear programmes and related necessary and sufficient optimality conditions

Cites work

• A Farkas-type theorem for interval linear inequalities
• Algorithms for Linear Programming Problems with Interval Objective Function Coefficients
• Checking solvability of systems of interval linear equations and inequalities via mixed integer programming
• Checking weak optimality of the solution to linear programming with interval right-hand side
• Farkas-type theorems for interval linear systems
• Fault detection in discrete dynamic systems with uncertainty based on interval optimization
• Generalized solutions to interval linear programmes and related necessary and sufficient optimality conditions
• How to determine basis stability in interval linear programming
• Linear Optimization Problems with Inexact Data
• Linear programming with interval coefficients
• Linear programming with interval right hand sides
• Multiobjective programming in optimization of the interval objective function
• Necessary and sufficient conditions of some strong optimal solutions to the interval linear programming
• On approximation of the best case optimal value in interval linear programming
• Optimal value range in interval linear programming
• Solvability and feasibility of interval linear equations and inequalities
• The optimal solution set of the interval linear programming problems
• Weak and strong solvability of interval linear systems of equations and inequalities

Cited in

(7)

• Interval convex quadratic programming problems in a general form
• Weak optimal inverse problems of interval linear programming based on KKT conditions
• 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
• Checking weak optimality and strong boundedness in interval linear programming
• Checking weak optimality of the solution to linear programming with interval right-hand side
• Checking weak and strong optimality of the solution to interval convex quadratic programming in a general form

This page was built for publication: Checking weak optimality of the solution to interval linear program in the general form

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