Name
Abstract | ||
|---|---|---|
We present a new approach to a multicriteria optimization problem, where the objective and the constraints are linear functions. From an equivalent equilibrium problem, first suggested in [5,6,8], we show new characterizations of weakly efficient points based on the partial order induced by a nonempty closed convex cone in a finite-dimensional linear space, as in [7]. Thus, we are able to apply the analytic center cutting plane algorithm that finds equilibrium points approximately, by Raupp and Sosa [10], in order to find approximate weakly efficient solutions of MOP. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1023/B:NUMA.0000021770.77789.b7 | Numerical Algorithms |
Keywords | Field | DocType |
multicriteria optimization,convex feasibility problem,analytic center cutting plane algorithm | Mathematical optimization,Linear space,Equilibrium problem,Equilibrium point,Cutting plane algorithm,Multi-objective optimization,Linear function,Conic optimization,Mathematics,Convex cone | Journal |
Volume | Issue | ISSN |
35 | 2 | 1572-9265 |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wilfredo Sosa | 1 | 43 | 6.22 |
| Fernanda M. P. Raupp | 2 | 29 | 5.35 |