Pages that link to "Item:Q1579630"

The following pages link to Outcome space partition of the weight set in multiobjective linear programming (Q1579630):

Displaying 29 items.

• Adjacency based method for generating maximal efficient faces in multiobjective linear programming (Q345543) (← links)
• Criteria and dimension reduction of linear multiple criteria optimization problems (Q427372) (← links)
• A dual variant of Benson's ``outer approximation algorithm'' for multiple objective linear programming (Q427391) (← links)
• Lagrange multiplier rules for weak approximate Pareto solutions of constrained vector optimization problems in Hilbert spaces (Q467462) (← links)
• Constructing efficient solutions structure of multiobjective linear programming (Q557002) (← links)
• Algebra of efficient sets for multiobjective complex systems (Q635798) (← links)
• Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming (Q642767) (← links)
• Generating the weakly efficient set of nonconvex multiobjective problems (Q934803) (← links)
• The structure of weak Pareto solution sets in piecewise linear multiobjective optimization in normed spaces (Q946377) (← links)
• A primal-dual simplex algorithm for bi-objective network flow problems (Q1041407) (← links)
• Pareto solutions of polyhedral-valued vector optimization problems in Banach spaces (Q1044248) (← links)
• A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program (Q1600950) (← links)
• On nadir points of multiobjective integer programming problems (Q1683328) (← links)
• Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming (Q1737503) (← links)
• Optimising a nonlinear utility function in multi-objective integer programming (Q1955541) (← links)
• Fully piecewise linear vector optimization problems (Q2046692) (← links)
• New multi-objective optimization model for tourism systems with fuzzy data and new algorithm for solving this model (Q2085506) (← links)
• Multi-objective integer programming: an improved recursive algorithm (Q2251549) (← links)
• Structure of Pareto solutions of generalized polyhedral-valued vector optimization problems in Banach spaces (Q2318898) (← links)
• Global maximization of UTA functions in multi-objective optimization (Q2355087) (← links)
• Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions (Q2423818) (← links)
• A new duality approach to solving concave vector maximization problems (Q2433928) (← links)
• Primal-dual simplex method for multiobjective linear programming (Q2471113) (← links)
• PolySCIP (Q2819226) (← links)
• Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint (Q5139847) (← links)
• New multi-objective optimization model for tourism systems with fuzzy data and new approach developed epsilon constraint method (Q6059888) (← links)
• Ordinal optimization through multi-objective reformulation (Q6096566) (← links)
• Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems (Q6162512) (← links)
• Weight set decomposition for weighted rank and rating aggregation: an interpretable and visual decision support tool (Q6194474) (← links)