Pages that link to "Item:Q598604"
From MaRDI portal
The following pages link to Optimization over the efficient set: overview (Q598604):
Displaying 50 items.
- An exact minimax penalty function method and saddle point criteria for nonsmooth convex vector optimization problems (Q289076) (← links)
- An inexact restoration approach to optimization problems with multiobjective constraints under weighted-sum scalarization (Q315505) (← links)
- Bi-objective robust optimisation (Q322907) (← 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)
- Connections between single-level and bilevel multiobjective optimization (Q415423) (← 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)
- Optimization through dense sets (Q511318) (← 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)
- Optimizing over the properly efficient set of convex multi-objective optimization problems (Q828826) (← links)
- Semivectorial bilevel optimization on Riemannian manifolds (Q896180) (← links)
- Variable preference modeling with ideal-symmetric convex cones (Q960117) (← links)
- Decomposition branch and bound algorithm for optimization problems over efficient sets (Q1008773) (← 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)
- An all-linear programming relaxation algorithm for optimizing over the efficient set (Q1177916) (← links)
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set (Q1321160) (← links)
- Optimizing a linear fractional function over the integer efficient set (Q1615942) (← links)
- Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming (Q1737503) (← 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)
- An improved algorithm to compute the \(\omega\)-primality (Q1996743) (← links)
- The price of multiobjective robustness: analyzing solution sets to uncertain multiobjective problems (Q2030735) (← links)
- Biobjective optimization over the efficient set of multiobjective integer programming problem (Q2031318) (← links)
- Necessary optimality conditions for semi-vectorial bi-level optimization with convex lower level: theoretical results and applications to the quadratic case (Q2059178) (← links)
- Optimizing over Pareto set of semistrictly quasiconcave vector maximization and application to stochastic portfolio selection (Q2097485) (← 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)
- Outcome space algorithm for generalized multiplicative problems and optimization over the efficient set (Q2358305) (← links)
- Semivectorial bilevel optimization problem: penalty approach (Q2370057) (← links)
- An algorithm for optimizing a linear function over an integer efficient set (Q2378378) (← links)
- On optimization over the efficient set in linear multicriteria programming (Q2471110) (← links)
- Cone characterizations of approximate solutions in real vector optimization (Q2471114) (← links)
- Optimizing a linear function over an integer efficient set (Q2503083) (← links)
- A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks (Q2664012) (← links)
- Set Optimization—A Rather Short Introduction (Q2805754) (← links)
- The augmented weighted Tchebychev norm for optimizing a linear function over an integer efficient set of a multicriteria linear program (Q2865174) (← links)
- An indefinite quadratic optimization over an integer efficient set (Q3177625) (← links)
- Optimization over the efficient set using an active constraint approach (Q3363070) (← links)
- Primal and dual algorithms for optimization over the efficient set (Q4646523) (← links)
- Multiobjective nonlinear system identification: a case study with thyristor controlled series capacitor (TCSC) (Q4678221) (← links)
- Solving Optimization Problems over the Weakly Efficient Set (Q4985181) (← links)
- Quadratic optimization over a discrete pareto set of a multi-objective linear fractional program (Q5009153) (← links)