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

DOI10.1007/S11750-012-0268-2zbMath1297.90082OpenAlexW2082791145MaRDI QIDQ456920

Carlos Barrico, Carlos Henggeler Antunes, 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

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

Related Items (5)

A mathematical programming approach to sample coefficient of variation with interval-valued observations ⋮ On strong optimality of interval linear programming ⋮ Inverse linear programming with interval coefficients ⋮ New conditions for testing necessarily/possibly efficiency of non-degenerate basic solutions based on the tolerance approach ⋮ A new equivalent transformation for interval inequality constraints of interval linear programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Possible and necessary efficiency in possibilistic multiobjective linear programming problems and possible efficiency test
• An interactive method of tackling uncertainty in interval multiple objective linear programming
• Multiple objective linear programming models with interval coefficients -- an illustrated overview
• Minimax regret solution to linear programming problems with an interval objective function
• Possible and necessary optimality tests in possibilistic linear programming problems
• Algorithms for Linear Programming Problems with Interval Objective Function Coefficients

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