A new method for determining all maximal efficient faces in multiple objective linear programming (Q514052): Difference between revisions

@@ Property / DOI @@
-.1007/s40306-015-0164-6
@@ Property / DOI: 10.1007/s40306-015-0164-6 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s40306-015-0164-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2318985579
@@ Property / OpenAlex ID: W2318985579 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding all maximal efficient faces in multiobjective linear programming
+Normal rank
@@ Property / cites work @@
+Determination of the efficient set in multiobjective linear programming
+Normal rank
@@ Property / cites work @@
+Finding an Initial Efficient Extreme Point for a Linear Multiple Objective Program
+Normal rank
@@ Property / cites work @@
+Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
+Normal rank
@@ Property / cites work @@
+Generating all maximal efficient faces for multiple objective linear programs
+Normal rank
@@ Property / cites work @@
+A general method for determining the set of all efficient solutions to a linear vectormaximum problem
+Normal rank
@@ Property / cites work @@
+Efficient solution generation for multiple objective linear programming based on extreme ray generation method
+Normal rank
@@ Property / cites work @@
+The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
+Normal rank
@@ Property / cites work @@
+Maximal descriptor set characterizations of efficient faces in multiple objective linear programming.
+Normal rank
@@ Property / cites work @@
+Normal cones to a polyhedral convex set and generating efficient faces in linear multiobjective programming
+Normal rank
@@ Property / cites work @@
+Generating all vertices of a polyhedron is hard
@@ Property / cites work: Generating all vertices of a polyhedron is hard / rank @@
+Normal rank
@@ Property / cites work @@
+Faces of a polyhedron
@@ Property / cites work: Faces of a polyhedron / rank @@
+Normal rank
@@ Property / cites work @@
+Q2867375
@@ Property / cites work: Q2867375 / rank @@
+Normal rank
@@ Property / cites work @@
+Determining maximal efficient faces in multiobjective linear programming problem
+Normal rank
@@ Property / cites work @@
+Degeneracy degrees of constraint collections
@@ Property / cites work: Degeneracy degrees of constraint collections / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization over the efficient set of a parametric multiple objective linear programming problem
+Normal rank
@@ Property / cites work @@
+A common formula to compute the efficient sets of a class of multiple objective linear programming problems
+Normal rank
@@ Property / cites work @@
+The maximal descriptor index set for a face of a convex polyhedral set and some applications
+Normal rank
@@ Property / DOI @@
+.1007/S40306-015-0164-6
@@ Property / DOI: 10.1007/S40306-015-0164-6 / rank @@
+Normal rank