Pénalisation dans l'optimisation sur l'ensemble faiblement efficient

The paper deals with the problem of minimizing a scalar valued function over the weakly efficient (Pareto) set associated to a multicriteria minimization problem. This problem of post-Pareto analysis has several practical applications. Its main difficulty is due to the implicit form of the weakly efficient set and to the fact that, even in the linear case, the problem is not convex. Mathematically this problem is classified as a difficult global optimization problem. To solve it we use a penalty method. For the particular case of a linear vector problem and concave scalar objective, and also for the special case of linear functional, we propose an exact penalty algorithm which finds an optimal solution in a finite number of iterations.

[1]  Ralph E. Steuer,et al.  Computational experience concerning payoff tables and minimum criterion values over the efficient set , 1988 .

[2]  H. P. Benson,et al.  A face search heuristic algorithm for optimizing over the efficient set , 1993 .

[3]  Hiroshi Konno,et al.  A cutting plane algorithm for solving bilinear programs , 1976, Math. Program..

[4]  S. Bolintinéanu,et al.  Necessary conditions for nonlinear suboptimization over the weakly-efficient set , 1993 .

[5]  Hirotaka Nakayama,et al.  Theory of Multiobjective Optimization , 1985 .

[6]  Johan Philip,et al.  Algorithms for the vector maximization problem , 1972, Math. Program..

[7]  H. P. Benson,et al.  A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set , 1992 .

[8]  S. Bolintineanu,et al.  Optimality Conditions for Minimization over the (Weakly or Properly) Efficient Set , 1993 .

[9]  Antal Majthay,et al.  Quasi-concave minimization subject to linear constraints , 1974, Discret. Math..

[10]  Hamdy A. Taha.  Concave minimization over a convex polyhedron , 1973 .

[11]  H. P. Benson,et al.  An algorithm for optimizing over the weakly-efficient set , 1986 .

[12]  H. P. Benson,et al.  Optimization over the efficient set: Four special cases , 1994 .

[13]  Harold P. Benson,et al.  A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case , 1993, J. Glob. Optim..

[14]  Philip B. Zwart.  Global Maximization of a Convex Function with Linear Inequality Constraints , 1974, Oper. Res..

[15]  Jerald P. Dauer,et al.  Optimization over the efficient set using an active constraint approach , 1991, ZOR Methods Model. Oper. Res..

[16]  P. Armand,et al.  Determination of the efficient set in multiobjective linear programming , 1991 .

[17]  Giorgio Gallo,et al.  Bilinear programming: An exact algorithm , 1977, Math. Program..

[18]  H. P. Benson,et al.  Optimization over the efficient set , 1984 .

[19]  R. Tyrrell Rockafellar,et al.  Convex Analysis , 1970, Princeton Landmarks in Mathematics and Physics.

[20]  J. B. Rosen.  Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain , 1983, Math. Oper. Res..

[21]  S. Bolintineanu,et al.  Minimization of a quasi-concave function over an efficient set , 1993, Math. Program..

[22]  H. P. Benson,et al.  A finite algorithm for concave minimization over a polyhedron , 1985 .

[23]  James E. Falk,et al.  A Successive Underestimation Method for Concave Minimization Problems , 1976, Math. Oper. Res..

[24]  Harold P. Benson,et al.  An all-linear programming relaxation algorithm for optimizing over the efficient set , 1991, J. Glob. Optim..

[25]  A. Cabot.  Variations on a cutting plane method for solving concave minimization problems with linear constraints , 1974 .