Hostname: page-component-586b7cd67f-gb8f7 Total loading time: 0 Render date: 2024-11-22T06:34:27.111Z Has data issue: false hasContentIssue false

Approximate dual and approximate vector variational inequality for multiobjective optimization

Published online by Cambridge University Press:  09 April 2009

G.–Y. Chen
Affiliation:
Academia Sinica, Institute of Systems ScienceBeijing 100080, China
B. D. Craven
Affiliation:
Mathematics Department, University of MelbourneParkville, Victoria 3052, Australia
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

An approximate dual is proposed for a multiobjective optimization problem. The approximate dual has a finite feasible set, and is constructed without using a perturbation. An approximate weak duality theorem and an approximate strong duality theorem are obtained, and also an approximate variational inequality condition for efficient multiobjective solutions.

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1989

References

[1]Sawaragi, Y., Nakayama, H. and Tanino, T., Theory of Multiobjective Optimization, (Math. Sci. Engrg., vol. 176, Academic Press, New York, 1985, 137138).Google Scholar
[2]Chen, G.-Y. and Craven, B. D., ‘A vector variational inequality and optimization over an efficient set’ Z. Oper. Res. (to appear).Google Scholar
[3]Loridan, P., ‘ε-solutions in vector minimization problems’, J. Optim. Theory Appl. 43 (1984), 265276.Google Scholar
[4]Vályi, J., ‘Approximate saddle-point theorems in vector optimization’, J. Optim. Theory Appl. 55 (1987), 436448.Google Scholar
[5]Yu, P. L., ‘Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives’, J. Optim. Theory Appl. 14 (1974), 318323.Google Scholar
[6]Berge, C., Topological Spaces, (Macmillan, New York, 1963).Google Scholar