Regularity conditions and optimality in vector optimization

Numerical Functional Analysis and Optimization

Volumn 25, Issue 5-6, 2004, Pages 479-501

  Chandra, S ^a   Dutta, J ^b   Lalitha, C S ^c  

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

^b INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

^c UNIVERSITY OF DELHI   (India)

Author keywords

Convex optimization; Nonsmooth optimization; Regularity conditions; Vector optimization

Indexed keywords

CALCULATIONS; CONSTRAINT THEORY; FUNCTIONS; OPTIMIZATION; PROBLEM SOLVING; THEOREM PROVING;

CONVEX OPTIMIZATION; NONSMOOTH OPTIMIZATION; REGULARITY CONDITIONS; VECTOR OPTIMIZATION;

VECTORS;

EID: 11144282698     PISSN: 01630563     EISSN: None     Source Type: Journal    
DOI: 10.1081/NFA-200042637     Document Type: Article

References (20)

1. Chankong, V., Haimes, Y. Y. (1983). Multiobjective Decision Making: Theory and Methodology. Amsterdam: North-Holland.
2. Clarke, F. H. (1983). Optimization and Nonsmooth Analysis. Wiley Interscience.
3. Craven, B. D. (1978). Mathematical Programming and Control Theory. Chapman and Hall.
4. Dolezal, J. (1984). Necessary condition for Pareto optimality in non-differentiable problems. Problems Control Inf. Theory 14:131-141.
5. Ehrgott, M. (2000). Multicriteria Optimization. Lecture Notes in Economics and Mathematical Systems, No. 491. Springer Verlag.
6. Ellaia, R., Hassouni, A. (1991). Characterization of nonsmooth functions through their generalized gradients. Optimization 22:401-416.
7. Giorgi, G., Guerraggio, A. (2001). Proper efficiency and generalized convexity in nonsmooth vector optimization problems. In: Proceedings of the Sixth International Symposium on Generalized Convexity/Monotonicity, Samos 1999. Lecture Notes in Economics and Mathematical Systems, No. 50. Springer Verlag, pp. 208-217.
8. Guignard, M. (1969). Generalized Kuhn-Tucker conditions for mathematical programming problem in a Banach space. SIAM J. Control 7:232-241.
9. Jeyakumar, V. (1985). Convexlike alternative theorems and mathematical programming. Optimization 16:643-652.
10. Kanniappan, P. (1983). Necessary conditions for optimality of nondifferentiable convex multiobjective programming. J. Optimization Theory Appl. 40:167-174.
11. Li, X. F. (2000). Constraint qualification in nonsmooth multiobjective optimization. J. Optimization Theory Appl. 106:373-398.
12. Luc, D. T. (1989). Theory of Vector Optimization. Lecture Notes in Economics and Mathematical Systems, 319. Springer-Verlag.
13. Maeda, T. (1994). Constraint qualification in multiobjective optimization problems: Differentiable case. J. Optimization Theory Appl. 80:483-500.
14. Mangasarian, O. L. (1969). Nonlinear Programming. Mc Graw Hill. Republished by SIAM 1994.
15. Michel, P., Penot, J. P. (1992). A generalized derivative for calm and stable functions. Differential and Integral Equations 5:433-454.
16. Miettinen, K. (1999). Nonlinear Multiobjective Optimization. International Series in Operations Research and Management Science, 12. Kluwer Academic Publishers.
17. Rockafellar, R. T. (1970). Convex Analysis. Princeton University Press.
18. Sach, P. H., Kim, D. S., Lee, G. M. (2000). Invexity as necessary optimality conditions in nonsmooth programs. Research Report 2000/30. Institute of Mathematics, Hanoi, Vietnam.
19. Studniarski, M. (1997). Characterization of strict local minima for some nonlinear programming problems. Nonlinear Analysis, Theory, Methods and Appl. 30: 5363-5367.
20. Yu, P. L. (1985). Multiple-Criteria Decision Making, Concepts, Techniques and Extensions. Mathematical Concepts and Methods in Science and Engineering, 30. New York: Plenum Press. With assistance of Yoon Ro Lee, and Antonie Stam.