Pages that link to "Item:Q1177916"

The following pages link to An all-linear programming relaxation algorithm for optimizing over the efficient set (Q1177916):

Displayed 27 items.

• A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem (Q555995) ‎ (← links)
• Minimization of a quasi-concave function over an efficient set (Q689154) ‎ (← links)
• Maximizing a linear fractional function on a Pareto efficient frontier (Q700704) ‎ (← links)
• A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case (Q1207046) ‎ (← links)
• The maximization of a function over the efficient set via a penalty function approach (Q1278284) ‎ (← 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)
• 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)
• On optimization over the efficient set in linear multicriteria programming (Q2471110) ‎ (← 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)
• ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS (Q4548050) ‎ (← links)
• Optimization over the efficient set (Q5917733) ‎ (← links)