Pages that link to "Item:Q1847166"

The following pages link to Maximizing a concave function over the efficient or weakly-efficient set (Q1847166):

Displaying 30 items.

• Biobjective robust optimization over the efficient set for Pareto set reduction (Q322934) (← links)
• An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem (Q427361) (← links)
• Criteria and dimension reduction of linear multiple criteria optimization problems (Q427372) (← links)
• Stochastic optimization over a Pareto set associated with a stochastic multi-objective optimization problem (Q467441) (← links)
• On optimization over the efficient set of a multiple objective linear programming problem (Q511973) (← links)
• Optimization over the efficient set of multi-objective convex optimal control problems (Q607889) (← links)
• Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets (Q613601) (← links)
• Convergence and application of a decomposition method using duality bounds for nonconvex global optimization (Q700712) (← links)
• Optimizing over the properly efficient set of convex multi-objective optimization problems (Q828826) (← links)
• Semivectorial bilevel optimization on Riemannian manifolds (Q896180) (← links)
• Decomposition branch and bound algorithm for optimization problems over efficient sets (Q1008773) (← links)
• The maximization of a function over the efficient set via a penalty function approach (Q1278284) (← links)
• Computation of ideal and Nadir values and implications for their use in MCDM methods. (Q1406960) (← links)
• Combination between global and local methods for solving an optimization problem over the efficient set (Q1848362) (← links)
• An algorithm for maximizing a convex function over a simple set (Q1918984) (← links)
• DC programming: overview. (Q1969457) (← links)
• A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem (Q1971990) (← links)
• Necessary optimality conditions for semi-vectorial bi-level optimization with convex lower level: theoretical results and applications to the quadratic case (Q2059178) (← links)
• Post-Pareto analysis and a new algorithm for the optimal parameter tuning of the elastic net (Q2278891) (← links)
• Optimization over the Pareto outcome set associated with a convex bi-objective optimization problem: theoretical results, deterministic algorithm and application to the stochastic case (Q2351525) (← links)
• Semivectorial bilevel optimization problem: penalty approach (Q2370057) (← links)
• A hybrid method for solving multi-objective global optimization problems (Q2460126) (← links)
• On optimization over the efficient set in linear multicriteria programming (Q2471110) (← links)
• Optimization over equilibrium sets^∗ (Q2710390) (← links)
• Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← links)
• Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint (Q5139847) (← links)
• Semivectorial bilevel programming versus scalar bilevel programming (Q5221265) (← links)
• Optimality Conditions for Semivectorial Bilevel Convex Optimal Control Problems (Q5746432) (← links)
• Optimization over the Pareto front of nonconvex multi-objective optimal control problems (Q6188054) (← links)
• Notes on the value function approach to multiobjective bilevel optimization (Q6618210) (← links)