An enumerative algorithm for computing all possibly optimal solutions to an interval LP (Q456920): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3998396 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Possible and necessary optimality tests in possibilistic linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax regret solution to linear programming problems with an interval objective function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Possible and necessary efficiency in possibilistic multiobjective linear programming problems and possible efficiency test / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple objective linear programming models with interval coefficients -- an illustrated overview / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interactive method of tackling uncertainty in interval multiple objective linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4161114 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Linear Programming Problems with Interval Objective Function Coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815146 / rank
 
Normal rank

Latest revision as of 02:48, 9 July 2024

scientific article
Language Label Description Also known as
English
An enumerative algorithm for computing all possibly optimal solutions to an interval LP
scientific article

    Statements

    Identifiers