Pages that link to "Item:Q1077330"
From MaRDI portal
The following pages link to An algorithm for optimizing over the weakly-efficient set (Q1077330):
Displaying 27 items.
- 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)
- On optimization over the efficient set of a multiple objective linear programming problem (Q511973) (← 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)
- Applying set optimization to weak efficiency (Q828871) (← 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)
- 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)
- Necessary conditions for nonlinear suboptimization over the weakly- efficient set (Q1321391) (← links)
- Optimization over the efficient set: Four special cases (Q1321439) (← links)
- Utility function programs and optimization over the efficient set in multiple-objective decision making (Q1356096) (← 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)
- Bisection search algorithm for optimizing over the efficient set (Q1592677) (← links)
- An algorithm for systems welfare interactive goal programming modelling (Q1610175) (← links)
- Technical efficiency and distance to a reverse convex set (Q1809835) (← links)
- Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem (Q1908646) (← links)
- A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem (Q2228402) (← links)
- Optimization of a linear function on the set of efficient solutions of a multicriterion convex quadratic problem (Q2566581) (← links)
- A vector variational inequality and optimization over an efficient set (Q3468901) (← links)
- Solving Optimization Problems over the Weakly Efficient Set (Q4985181) (← links)
- An interior point algorithm for convex quadratic programming with strict equilibrium constraints (Q5710540) (← links)
- On minimization over weakly efficient sets (Q5758215) (← links)
- Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem (Q5940038) (← links)
- An inner approximation method incorporating a branch and bound procedure for optimization over the weakly efficient set (Q5946143) (← links)
