Advertisement

Approximate necessary conditions for locally weak Pareto optimality

  • L. Gajek
  • D. Zagrodny
Contributed Papers

Abstract

Necessary conditions for a given pointx0 to be a locally weak solution to the Pareto minimization problem of a vector-valued functionF=(f1,...,f m ),F:XRm,XRm, are presented. As noted in Ref. 1, the classical necessary condition-conv {Df1(x0)|i=1,...,m}∩T*(X, x0)≠⊘ need not hold when the contingent coneT is used. We have proven, however, that a properly adjusted approximate version of this classical condition always holds. Strangely enough, the approximation form>2 must be weaker than form=2.

Key Words

Multiobjective optimization Pareto optimality necessary conditions contingen cones 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Wang, S. Y., andYang, F. M.,A Gap Between Multiobjective Optimization and Scalar Optimizaiton, Journal of Optimization Theory and Applications, Vol. 68, No. 2, pp. 389–391, 1991.Google Scholar
  2. 2.
    Clarke, F. H.,Optimization and Nonsmooth Analysis, Wiley-Interscience, New York, New York, 1983.Google Scholar
  3. 3.
    Aubin, J. P., andFrankowska, H.,Set-Valued Analysis, Birkhäuser, Boston, Massachusetts, 1990.Google Scholar
  4. 4.
    Hestenes, M. R.,Optimization Theory: The Finite-Dimensional Case, Wiley-Interscience, New York, New York, 1975.Google Scholar
  5. 5.
    Lin, J. G.,Maximal Vectors and Multiobjective Optimization, Journal of Optimization Theory and Applications, Vol. 18, No. 1, pp. 41–64, 1976.Google Scholar
  6. 6.
    Singh, C.,Optimality Conditions in Multiobjective Differentiable Programming, Journal of Optimization Theory and Applications, Vol. 53, No. 1, pp. 115–123, 1987.Google Scholar
  7. 7.
    Wang, S. Y.,A Note on Optimality Conditions in Multiobjective Programming, Systems Science and Mathematical Sciences, Vol. 1, No. 2, pp. 184–190, 1988.Google Scholar
  8. 8.
    Yu, P. L.,Multiple-Criteria Decision Making: Concepts, Techniques, and Extensions, Plenum Press, New York, New York, 1985.Google Scholar
  9. 9.
    Gajek, L., andZagrodny, D.,Existence of Maximal Points with Respect to Ordered Bipreference Relations, Journal of Optimization Theory and Applications, Vol. 70, No. 2, pp. 353–363, 1991.Google Scholar
  10. 10.
    Brown, L. D.,A Necessary Condition for Admissibility, Annals of Statistics, Vol. 8, No. 3, pp. 540–544, 1980.Google Scholar

Copyright information

© Penum Publishing Corporation 1994

Authors and Affiliations

  • L. Gajek
    • 1
    • 2
  • D. Zagrodny
    • 3
  1. 1.Mathematical InstitutePANWarsawPoland
  2. 2.Technical University of ŁódźŁódźPoland
  3. 3.Institute of MathematicsTechnical University of ŁódźŁódźPoland

Personalised recommendations