Pages that link to "Item:Q1321160"

The following pages link to A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set (Q1321160):

Displaying 50 items.

• Connections between single-level and bilevel multiobjective optimization (Q415423) (← links)
• An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem (Q427361) (← links)
• Generating equidistant representations in biobjective programming (Q429518) (← 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)
• A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem (Q555995) (← links)
• Optimization over the efficient set of multi-objective convex optimal control problems (Q607889) (← links)
• Minimization of a quasi-concave function over an efficient set (Q689154) (← links)
• Optimizing over the properly efficient set of convex multi-objective optimization problems (Q828826) (← links)
• Semivectorial bilevel optimization on Riemannian manifolds (Q896180) (← links)
• Solving bilevel linear programs using multiple objective linear programming (Q1016404) (← links)
• A modification of the Geoffrion/Dyer/Feinberg algorithm for finite multi- objective systems (Q1059556) (← links)
• An all-linear programming relaxation algorithm for optimizing over the efficient set (Q1177916) (← links)
• A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case (Q1207046) (← links)
• Necessary conditions for nonlinear suboptimization over the weakly- efficient set (Q1321391) (← links)
• Optimization over the efficient set: Four special cases (Q1321439) (← links)
• Branch-and-bound decomposition approach for solving quasiconvex-concave programs (Q1333350) (← links)
• Optimizing a linear function over an efficient set (Q1342462) (← links)
• Utility function programs and optimization over the efficient set in multiple-objective decision making (Q1356096) (← links)
• The interactive analysis of the multicriteria shortest path problem by the reference point method. (Q1406958) (← links)
• Computation of ideal and Nadir values and implications for their use in MCDM methods. (Q1406960) (← links)
• Simplicially-constrained DC optimization over efficient and weakly efficient sets (Q1411519) (← links)
• Optimization over the efficient set of a parametric multiple objective linear programming problem (Q1577111) (← links)
• Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem (Q1579631) (← links)
• A new method for optimizing a linear function over the efficient set of a multiobjective integer program (Q1753509) (← links)
• Maximizing a concave function over the efficient or weakly-efficient set (Q1847166) (← links)
• Combination between global and local methods for solving an optimization problem over the efficient set (Q1848362) (← links)
• Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem (Q1908646) (← links)
• Dual approach to minimization on the set of Pareto-optimal solutions (Q1918295) (← links)
• Necessary optimality conditions for semi-vectorial bi-level optimization with convex lower level: theoretical results and applications to the quadratic case (Q2059178) (← links)
• A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem (Q2228402) (← links)
• Post-Pareto analysis and a new algorithm for the optimal parameter tuning of the elastic net (Q2278891) (← links)
• Computing the nadir point for multiobjective discrete optimization problems (Q2350075) (← 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)
• Use of \(P_ \tau\)-nets for the approximation of the Edgeworth-Pareto set in multicriteria optimization (Q2564162) (← links)
• Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint (Q2564166) (← links)
• Numerical solution for optimization over the efficient set by d.c. optimization algorithms (Q2564625) (← links)
• Optimization over equilibrium sets^∗ (Q2710390) (← links)
• The augmented weighted Tchebychev norm for optimizing a linear function over an integer efficient set of a multicriteria linear program (Q2865174) (← links)
• Methods for optimizing over the efficient and weakly efficient sets of an affine fractional vector optimization program (Q3553752) (← links)
• A face search heuristic algorithm for optimizing over the efficient set (Q4695784) (← links)
• Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← links)
• A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs (Q5139635) (← links)
• A linear fractional optimization over an integer efficient set (Q5247690) (← links)
• Optimality Conditions for Semivectorial Bilevel Convex Optimal Control Problems (Q5746432) (← links)
• Optimization over the efficient set (Q5896268) (← links)
• Optimization over the efficient set (Q5917733) (← links)
• Parallel optimization over the integer efficient set (Q6187313) (← links)
• Optimization over the Pareto front of nonconvex multi-objective optimal control problems (Q6188054) (← links)