Pages that link to "Item:Q5896268"

The following pages link to Optimization over the efficient set (Q5896268):

Displaying 50 items.

• An exact minimax penalty function method and saddle point criteria for nonsmooth convex vector optimization problems (Q289076) (← links)
• Biobjective robust optimization over the efficient set for Pareto set reduction (Q322934) (← links)
• On DC optimization algorithms for solving minmax flow problems (Q406644) (← links)
• A mathematical programming approach to the computation of the omega invariant of a numerical semigroup (Q420862) (← 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)
• A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets (Q467443) (← links)
• Optimization through dense sets (Q511318) (← 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: overview (Q598604) (← 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)
• Minimization of a quasi-concave function over an efficient set (Q689154) (← links)
• Convergence and application of a decomposition method using duality bounds for nonconvex global optimization (Q700712) (← links)
• Characterizations of efficient sets by constrained objectives (Q795746) (← links)
• Optimizing over the properly efficient set of convex multi-objective optimization problems (Q828826) (← links)
• Applying set optimization to weak efficiency (Q828871) (← links)
• Semivectorial bilevel optimization on Riemannian manifolds (Q896180) (← links)
• An exact penalty on bilevel programs with linear vector optimization lower level (Q1011256) (← links)
• An exact method for computing the nadir values in multiple objective linear programming (Q1027447) (← links)
• An algorithm for optimizing over the weakly-efficient set (Q1077330) (← links)
• Computational experience concerning payoff tables and minimum criterion values over the efficient set (Q1095808) (← links)
• An all-linear programming relaxation algorithm for optimizing over the efficient set (Q1177916) (← links)
• Using efficient feasible directions in interactive multiple objective linear programming (Q1178731) (← links)
• A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case (Q1207046) (← links)
• Second-order efficiency conditions and sensitivity of efficient points (Q1273908) (← links)
• The maximization of a function over the efficient set via a penalty function approach (Q1278284) (← links)
• The utility efficient set and its interactive reduction (Q1291780) (← links)
• New closedness results for efficient sets in multiple objective mathematical programming (Q1307268) (← links)
• On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program (Q1312767) (← links)
• A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set (Q1321160) (← 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)
• 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)
• Bisection search algorithm for optimizing over the efficient set (Q1592677) (← links)
• An algorithm for systems welfare interactive goal programming modelling (Q1610175) (← links)
• Optimizing a linear fractional function over the integer efficient set (Q1615942) (← links)
• A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach (Q1628068) (← links)
• On gap functions for nonsmooth multiobjective optimization problems (Q1744623) (← links)
• A new method for optimizing a linear function over the efficient set of a multiobjective integer program (Q1753509) (← links)
• Technical efficiency and distance to a reverse convex set (Q1809835) (← links)
• The hierarchical and social decision making procedure for bi-objective optimization problems by using the simple majority decision rule (Q1815070) (← links)
• Quantitative parametric connections between methods for generating noninferior solutions in multiobjective optimization (Q1847149) (← links)