Skip to main content

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 177))

Abstract

In this paper the Haar condition which is well known in approximation theory is defined for vector optimization problems. Under suitable assumptions it can be proven that this condition is sufficient for the efficiency of a point satisfying the F. John conditions of the Chebyshev compromise program. If the Haar condition is not satisfied, the efficiency of such a point can only be proven under strong convexity and regularity assumptions.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Avriel, Nonlinear Programming: Analysis and Methods (PrenticeHall, 1976)

    Google Scholar 

  2. W. Dinkelbach, W. Dürr, “Effizienzaussagen bei Ersatzprogrammen zum Vektormaximumproblem”, Operations Research Verfahren XII (1972) 69–77

    Google Scholar 

  3. L. Collatz, W. Krabs, Approximationstheorie (Teubner Stuttgart, 1973)

    Google Scholar 

  4. L. Collatz, W. Wetterling, Optimierungsaufgaben (Springer Berlin-Heidelberg-New York, 1971)

    Book  Google Scholar 

  5. W.B. Gearhart, “Compromise Solutions and Estimation of the Noninferior Set”, JOTA 28 (1979) 29–47

    Article  Google Scholar 

  6. K. Madsen, H. Schjaer-Jacobsen, “Linearly constrained minimax optimization”, Mathematical Programming 14 (1978) 208–223

    Article  Google Scholar 

  7. O.L. Mangasarian, Nonlinear Programming (McGraw-Hill, 1969)

    Google Scholar 

  8. S. Rolewicz, On Norm Scalarization in Infinite Dimensional BANACH Spaces (Working Paper, Institute of Mathematics of Polish Academy of Sciences, 1975)

    Google Scholar 

  9. A.P. Wierzbicki, “Basic Properties of Scalarizing Functionals for Multiobjective Optimization”, Math. Operationsforsch. Statist. Ser. Optimization 8 (1977) 55–60

    Article  Google Scholar 

  10. P.L. Yu, G. Leitmann, “Compromise Solutions, Domination Structures, and Salukvadze’s Solution”, JOTA 13 (1974) 362–378

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jahn, J. (1980). The Haar Condition in Vector Optimization. In: Fandel, G., Gal, T. (eds) Multiple Criteria Decision Making Theory and Application. Lecture Notes in Economics and Mathematical Systems, vol 177. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-48782-8_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-48782-8_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09963-5

  • Online ISBN: 978-3-642-48782-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics