Complexity of necessary efficiency in interval linear programming and multiobjective linear programming (Q1758029): Difference between revisions

@@ Property / cites work @@
+Linear Multiple Objective Problems with Interval Coefficients
+Normal rank
@@ Property / cites work @@
+A survey of recent developments in multiobjective optimization
+Normal rank
@@ Property / cites work @@
+Multicriteria Optimization
@@ Property / cites work: Multicriteria Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Optimization Problems with Inexact Data
@@ Property / cites work: Linear Optimization Problems with Inexact Data / rank @@
+Normal rank
@@ Property / cites work @@
+Encyclopedia of Optimization
@@ Property / cites work: Encyclopedia of Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the tolerances in multiobjective linear programming
+Normal rank
@@ Property / cites work @@
+Generalized linear fractional programming under interval uncertainty
+Normal rank
@@ Property / cites work @@
+Portfolio selection problem with interval coefficients
+Normal rank
@@ Property / cites work @@
+Solutions for the portfolio selection problem with interval and fuzzy coefficients
+Normal rank
@@ Property / cites work @@
+Possible and necessary optimality tests in possibilistic linear programming problems
+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 @@
+Linear optimization and extensions.
@@ Property / cites work: Linear optimization and extensions. / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation and complexity in numerical optimization. Continuous and discrete problems. Conference, Univ. of Florida, Orlando, FL, USA, February 28 - March 2, 1999
+Normal rank
@@ Property / cites work @@
+Linear Programming with Inexact Data is NP‐Hard
@@ Property / cites work: Linear Programming with Inexact Data is NP‐Hard / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the norm ∥<i>A</i>∥∞,1 is NP-hard<sup>∗</sup>
+Normal rank
@@ Property / cites work @@
+Q4221106
@@ Property / cites work: Q4221106 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4546409
@@ Property / cites work: Q4546409 / rank @@
+Normal rank