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

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s11750-012-0268-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2082791145
@@ Property / OpenAlex ID: W2082791145 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3998396
@@ Property / cites work: Q3998396 / rank @@
+Normal rank
@@ Property / cites work @@
+Possible and necessary optimality tests in possibilistic linear programming problems
+Normal rank
@@ Property / cites work @@
+Minimax regret solution to linear programming problems with an interval objective function
+Normal rank
@@ Property / cites work @@
+Possible and necessary efficiency in possibilistic multiobjective linear programming problems and possible efficiency test
+Normal rank
@@ Property / cites work @@
+Multiple objective linear programming models with interval coefficients -- an illustrated overview
+Normal rank
@@ Property / cites work @@
+An interactive method of tackling uncertainty in interval multiple objective linear programming
+Normal rank
@@ Property / cites work @@
+Q4161114
@@ Property / cites work: Q4161114 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Linear Programming Problems with Interval Objective Function Coefficients
+Normal rank
@@ Property / cites work @@
+Q3815146
@@ Property / cites work: Q3815146 / rank @@
+Normal rank