Pages that link to "Item:Q1908646"
From MaRDI portal
The following pages link to Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem (Q1908646):
Displaying 25 items.
- Criteria and dimension reduction of linear multiple criteria optimization problems (Q427372) (← 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)
- Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets (Q613601) (← links)
- Optimal sequential inspection policies (Q646686) (← links)
- Maximizing a linear fractional function on a Pareto efficient frontier (Q700704) (← links)
- Optimizing over the properly efficient set of convex multi-objective optimization problems (Q828826) (← links)
- Generating the efficient outcome set in multiple objective linear programs: The bicriteria case (Q1384421) (← 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)
- Quantitative parametric connections between methods for generating noninferior solutions in multiobjective optimization (Q1847149) (← 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)
- DC programming: overview. (Q1969457) (← 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)
- 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)
- On optimization over the efficient set in linear multicriteria programming (Q2471110) (← links)
- Primal and dual algorithms for optimization over the efficient set (Q4646523) (← links)
- Quadratic optimization over a discrete pareto set of a multi-objective linear fractional program (Q5009153) (← links)
- Existence results and optimization over the set of efficient solutions in vector-valued approximation theory (Q6085815) (← links)
