Pages that link to "Item:Q5317533"

The following pages link to Scalarizing Functions for Generating the Weakly Efficient Solution Set in Convex Multiobjective Problems (Q5317533):

Displaying 16 items.

• A numerical method for constructing the Pareto front of multi-objective optimization problems (Q390465) (← 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)
• A new scalarization method for finding the efficient frontier in non-convex multi-objective problems (Q2285911) (← links)
• Outcome space algorithm for generalized multiplicative problems and optimization over the efficient set (Q2358305) (← links)
• A new duality approach to solving concave vector maximization problems (Q2433928) (← links)
• A general approach for studying duality in multiobjective optimization (Q2460035) (← links)
• A combined scalarization method for multi-objective optimization problems (Q2666683) (← links)
• A jointly constrained bilinear programming method for solving generalized Cournot–Pareto models (Q2798106) (← links)
• Set Optimization—A Rather Short Introduction (Q2805754) (← links)
• Solving generalized convex multiobjective programming problems by a normal direction method (Q2836102) (← links)
• A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems (Q3112505) (← links)
• A modified Quasi-Newton method for vector optimization problem (Q3453403) (← links)
• Methods for optimizing over the efficient and weakly efficient sets of an affine fractional vector optimization program (Q3553752) (← links)
• A Trust-Region Algorithm for Heterogeneous Multiobjective Optimization (Q4634096) (← links)
• A trust-region approach for computing Pareto fronts in multiobjective optimization (Q6179876) (← links)