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

RAIRO Recherche Operationnelle

Volumn 31, Issue 3, 1997, Pages 295-310

  Bolintineanu S ^a   El Maghri, M ^a  

^a UNIVERSITÉ DE PERPIGNAN   (France)

Author keywords

Bilinear programming; Concave minimization over a polyhedron; Duality; Linear programming; Multicriteria optimization; Penalty methods

Indexed keywords

EID: 0040260804     PISSN: 03990559     EISSN: None     Source Type: Journal    
DOI: 10.1051/ro/1997310302951     Document Type: Article

References (32)

1. P. ARMAND and C. MALIVERT, Determination of the Efficient Set in Multiobjective Linear Programming, J. of Optimization Theory and Applications, 1991, 70, p.467-489.
2. H. P. BENSON, Optimisation over the Efficient Set, Discussion Paper No. 35, Center for Econometrics and Decision Sciences, University of Florida, Gainesville, Florida, 1981.
3. H. P. BENSON, Optimization over the Efficient Set, J. of Mathematical Analysis and Applications, 1984, 98, p.562-580.
4. H. P. BENSON, An algorithm for Optimizing over the Weakly-Efficient Set, European J. of Operational Research, 1986, 25, p. 192-199.
5. H. P. BENSON, An All-Linear Programming Relaxation Algorithm for Optimizing over the Efficient Set, J. Of Global Optimization, 1991, 1, p. 83-104.
6. H. P. BENSON, A Finite, Nonadjacent Extreme Point Search Algorithm for Optimization over the Efficient Set, J. of Optimization Theory and Applications, 1992, 73, p. 47-64.
7. H. P. BENSON, A Face Search Heuristic Algorithm for Optimizing over the Efficient Set, Naval Research Logistics, 1993, 40, p. 103-116.
8. H. P. BENSON, A Bisection-Extreme Point Search Algorithm for Optimizing over the Efficient Set in the Linear Dependence Case, J. of Global Optimization, 1993, 3, p. 95-111.
9. H. P. BENSON, Optimization over the Efficient Set: Four Special Cases, J. of Optimization Theory and Applications, 1994, 80, no 1.
10. H. P. BENSON, A Finite Algorithm for Concave Minimization over a Polyedron, Naval Research Logistics Quaterly, 1985, 32, p. 165-177.
11. S. BOLINTINÉANU, Minimization of Quasi-Concave Function over an Efficient Set, Math. Programming, 1993, 61, p. 89-110.
12. S. BOLINTINÉANU, Optimality Conditions for Minimization over the (Weakly or Properly) Efficient Set, J. of Mathematical Analysis and Applications, 1993 173, no 2, p. 523-541.
13. S. BOLINTINÉANU, Necessary Conditions for Nonlinear Suboptimization over the Weakly-Efficient Set. J. of Optimization Theory and Applications, 1993, 78, no 3.
14. A. V. CABOT, Variations on a Cutting Plane Method for Solving Concave Minimization Problems with Linear Constraints, Naval Research Logistics Quarterly, 1974, 21, p. 265-274.
15. J. P. DAUER, Optimization over the Efficient Set Using an Active Constraint Approach, Zeitschrift fur Operations Research, 1991, 35, p. 185-195.
16. M. I. DESSOUKY, M. GHIASSI and W. J. DAVIS, Determining the Worst Value of an Objective Function within the Nondommated Solutions in Multiple Objective Linear Programming, Department of Mechanical and Industrial Engineering, University of Illinois, Urbana, Ill., 1979.
17. J. E. FALK and K. R. HOFFMANN, A Successive Underestimation Method for Concave Minimization Problems, Math. of Operations Research, 1976, 1, p. 251-259.
18. G. GALLO and A. ÜLKUCCU, Bilinear Programming: An Exact Algorithm, Math. Programming, 1977, 12, p. 173-194.
19. R. HORST and H. TUY, Global Optimisation: Deterministic Approches, Springer-Verlag, Berlin, Germany, Second Edition, 1993.
20. H. ISERMANN and R. E. STEUER, Computational Experience Concerning Payoff Tables and Minimum Criterion Values over the Efficient Set, European J. of Operational Research, 1987, 33, p. 91-97.
21. H. KONNO, A Cutting Plane Algorithm for Solving Bilinear Programs, Math. Programming, 1976, 11, p. 14-27.
22. D. T. Luc, Theory of Vector Optimization: Lectures Notes in Economics and Mathematical Systems, Springer-Verlag, Berlin, 1989.
23. D. G. LUENBERGER, Linear and Nonlinear Programming, Addison Wesley Publishing Company, Reading, Massachusetts, Second Edition, 1984.
24. A. MAJTHAY and A. WHINSTON, Quasiconcave Minimization Subject a Linear Constraints, Discrete Math., 1974, 9, p. 35-59.
25. L. D. MUU, A Method for Optimization of a Linear over the Efficient Set, Institute of Mathematics, Hanoi, Preprint 15, 1991.
26. J. PHILIP, Algorithm for the Maximization Problem, Math. Programming, 1972, 2, p. 207-229.
27. R. T. ROCKAFELLAR, Convex Analysis, Princeton University Press, Princeton, New Jersey, 1970.
28. J. B. ROSEN, Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain, Math. of Operations Research, 1983, 8, p. 215-230.
29. Y. SAWARAGI, H. NAKAYAMA and T. TANINO, Theory of Multiobjective Optimization, Academic Press, Orlando, Florida, 1985.
30. H. A. TAHA, Concave Minimization over a Convex Polyedron, Naval Research Logistics Quarterly, 1973, 20, p. 533-548.
31. H. TUY, Concave Programming under Linear Constraints, Soviet. Math., 1964, 5, p. 1437-1460.
32. P. B. ZWART, Global Miminization of a Convex Function with Linear Inequality Constraints, Operations Research, 1974, 22, p. 602-609.