Checking weak optimality and strong boundedness in interval linear programming

DOI10.1007/S00500-018-3520-3MaRDI QIDQ2317620zbMATH OpenOpenAlexWikidataFDO

Authors Elif Garajová, Milan Hladík

Publication date 12 August 2019

Published in Soft Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00500-018-3520-3

zbMATH Keywords

computational complexityinterval linear programmingstrong boundednessweak optimality

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• Checking strong optimality of interval linear programming with inequality constraints and nonnegative constraints
• On strong optimality of interval linear programming
• Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases
• Checking weak optimality of the solution to interval linear program in the general form
• Checking weak optimality of the solution to linear programming with interval right-hand side

Cites work

• A heuristic solution technique to attain the minimal total cost bounds of transporting a homogeneous product with varying demands and supplies
• A note on dependency between interval linear systems
• An interval linear programming approach for portfolio selection model
• Checking weak optimality of the solution to linear programming with interval right-hand side
• Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides
• Complexity of some linear problems with interval data
• Enhanced-interval linear programming
• Fault detection in discrete dynamic systems with uncertainty based on interval optimization
• Fuzzy interval analysis
• Generalized solutions to interval linear programmes and related necessary and sufficient optimality conditions
• Inexact de Novo programming for water resources systems planning
• Interval analysis and fuzzy set theory
• Interval linear programming under transformations: optimal solutions and optimal value range
• Inverse linear programming with interval coefficients
• Linear programming with interval coefficients
• OPTIMIZING GIVEN SYSTEMS vs. DESIGNING OPTIMAL SYSTEMS: THE DE NOVO PROGRAMMING APPROACH
• Strong solvability of interval linear programming problems
• The optimal solution set of the interval linear programming problems
• Weak and strong solvability of interval linear systems of equations and inequalities
• Zur lösung linearer ungleichungssysteme bei störimg der rechten seite und der koeffizientenmatrix

Cited in

(7)

• Checking strong optimality of interval linear programming with inequality constraints and nonnegative constraints
• Checking weak and strong optimality of the solution to interval convex quadratic program
• Checking weak optimality of the solution to interval linear program in the general form
• Checking weak optimality of the solution to linear programming with interval right-hand side
• Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases
• Special issue on: Optimization methods for decision making: advances and applications
• On strong optimality of interval linear programming

This page was built for publication: Checking weak optimality and strong boundedness in interval linear programming

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