Epsilon approximate solutions for multiobjective programming problems

Journal of Mathematical Analysis and Applications

Volumn 203, Issue 1, 1996, Pages 142-149

  Yokoyama, Kazunori ^a  

^a Niigata University of Management   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030268232     PISSN: 0022247X     EISSN: None     Source Type: Journal    
DOI: 10.1006/jmaa.1996.0371     Document Type: Article

References (7)

1. 1. J.-B. Hiriart Urruty, ∈-Subdifferential calculus, in "Convex Analysis and Optimization" (J.-P. Aubin and R. B. Vinter, Eds.), pp. 43-92, Pitman Research Notes in Mathematics Series, Vol. 57, Longman, Harlow, 1982.
2. 2. J. C. Liu, ∈-Pareto optimality for nondifferentiable multiobjective programming via penalty functions, to appear.
3. 3. P. Loridan, ∈-Solutions in vector minimization problems, J. Optim. Theory Appl. 43 (1984), 265-276.
4. 4. J. J. Strodiot, V. H. Nguyen, and N. Heukemes, ∈-Optimal solutions in nondifferentiable convex programming and some related questions, Math. Programming 25 (1983), 307-328.
5. 5. T. Tanaka, A new approach to approximation of solutions in vector optimization problems, in "Proceedings of APORS, 1994" (M. Fushimi and K. Tone, Eds.), pp. 497-504, World Scientific, Singapore, 1995.
6. 6. D. J. White, Epsilon efficiency, J. Optim. Theory Appl. 49 (1986), 319-337.
7. 7. K. Yokoyama, ∈-Optimality criteria for vector minimization problems via exact penalty functions, J. Math. Anal. Appl. 187 (1994), 296-305.