An enumerative algorithm for computing all possibly optimal solutions to an interval LP

DOI10.1007/S11750-012-0268-2MaRDI QIDQ456920zbMATH OpenOpenAlexFDO

Authors Carlos Henggeler Antunes, Carlos Barrico, Carla Henriques

Publication date 26 September 2014

Published in Top (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11750-012-0268-2

zbMATH Keywords

interval linear programmingoptimizing approachpossibly optimal solutions

Mathematics Subject Classification ID

Linear programming (90C05) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• scientific article; zbMATH DE number 4043607
• An interactive method of tackling uncertainty in interval multiple objective linear programming
• Linear programming with interval coefficients
• Linear programming with interval arithmetic
• Biobjective programming in optimization of interval linear programming

Cites work

• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• scientific article; zbMATH DE number 47262 (Why is no real title available?)
• scientific article; zbMATH DE number 3593344 (Why is no real title available?)
• Algorithms for Linear Programming Problems with Interval Objective Function Coefficients
• An interactive method of tackling uncertainty in interval multiple objective linear programming
• Minimax regret solution to linear programming problems with an interval objective function
• Multiple objective linear programming models with interval coefficients -- an illustrated overview
• Possible and necessary efficiency in possibilistic multiobjective linear programming problems and possible efficiency test
• Possible and necessary optimality tests in possibilistic linear programming problems

Cited in

(8)

• Inverse linear programming with interval coefficients
• An interactive method of tackling uncertainty in interval multiple objective linear programming
• A mathematical programming approach to sample coefficient of variation with interval-valued observations
• A new equivalent transformation for interval inequality constraints of interval linear programming
• An ensemble framework for assessing solutions of interval programming problems
• New conditions for testing necessarily/possibly efficiency of non-degenerate basic solutions based on the tolerance approach
• Generalized algorithm for summing the enumerators of suboptimal solutions
• On strong optimality of interval linear programming

This page was built for publication: An enumerative algorithm for computing all possibly optimal solutions to an interval LP

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