An enumerative algorithm for computing all possibly optimal solutions to an interval LP
type: Item
instance of: scholarly article
title: An enumerative algorithm for computing all possibly optimal solutions to an interval LP
zbMATH Open document ID: 1297.90082
author: Carlos Henggeler Antunes
author: Carlos Barrico
author: Carla Henriques
published in: Top
publication date: 2014-09-26T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 6348319
zbMATH Keywords: interval linear programming
zbMATH Keywords: optimizing approach
zbMATH Keywords: possibly optimal solutions
MaRDI profile type: Publication
full work available at URL: s11750-012-0268-2
OpenAlex ID: W2082791145
cites work: Q3998396
cites work: Possible and necessary optimality tests in possibilistic linear programming problems
cites work: Minimax regret solution to linear programming problems with an interval objective function
cites work: Possible and necessary efficiency in possibilistic multiobjective linear programming problems and possible efficiency test
cites work: Multiple objective linear programming models with interval coefficients -- an illustrated overview
cites work: An interactive method of tackling uncertainty in interval multiple objective linear programming
cites work: Q4161114
cites work: Algorithms for Linear Programming Problems with Interval Objective Function Coefficients
cites work: Q3815146
DOI: 10.1007/S11750-012-0268-2
description: scientific article; zbMATH DE number 6348319