Skip to main content

Characterizing Relatively Minimal Elements via Linear Scalarization

  • Conference paper
  • First Online:

Part of the book series: Operations Research Proceedings ((ORP))

Abstract

In this note we investigate some properties of the relatively minimal elements of a set with respect to a convex cone that has a nonempty quasi-relative interior, in particular their characterization via linear scalarization.

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

Buying options

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 EPUB and 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

Learn about institutional subscriptions

References

  1. Aliprantis, C. D., Florenzano, M., Martins-da-Rocha, V. F., & Tourky, R. (2004). Equilibrium analysis in financial markets with countably many securities. Journal of Mathematical Economics, 40, 683–699.

    Article  Google Scholar 

  2. Bao, T. Q., & Mordukhovich, B. S. (2010). Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions. Mathematical Programming Series A, 122, 301–347.

    Article  Google Scholar 

  3. Borwein, J. M., & Lewis, A. S. (1992). Partially finite convex programming, Part I: Quasi relative interiors and duality theory. Mathematical Programming Series B, 57(1), 15–48.

    Article  Google Scholar 

  4. Boţ, R. I. (2010). Conjugate duality in convex optimization. Lecture Notes in Economics and Mathematical Systems (vol. 637). Berlin: Springer.

    Google Scholar 

  5. Boţ, R. I., Csetnek, E. R., & Wanka, G. (2008). Regularity conditions via quasi-relative interior in convex programming. SIAM Journal on Optimization, 19(1), 217–233.

    Article  Google Scholar 

  6. Boţ, R. I., Grad, S.-M., & Wanka, G. (2009). Duality in vector optimization. Berlin: Springer.

    Google Scholar 

  7. Grad, S.-M., & Pop, E.-L. (2014). Vector duality for convex vector optimization problems by means of the quasi interior of the ordering cone. Optimization, 63(1), 21–37.

    Article  Google Scholar 

  8. Ha, T. X. D. (2012). Optimality conditions for various efficient solutions involving coderivatives: From set-valued optimization problems to set-valued equilibrium problems. Nonlinear Analysis: Theory, Methods & Applications, 75, 1305–1323.

    Article  Google Scholar 

  9. Jahn, J. (2004). Vector optimization—Theory, applications, and extensions. Berlin: Springer.

    Book  Google Scholar 

  10. Zhou, Z. A., & Yang, X. M. (2011). Optimality conditions of generalized subconvexlike set-valued optimization problems based on the quasi-relative interior. Journal of Optimization Theory and Applications, 150(2), 327–340.

    Article  Google Scholar 

Download references

Acknowledgments

We are grateful to Dr. Ernö Robert Csetnek for some useful comments he made to us during the early stages of the research that resulted in this note. The work of the first author was done within the framework of the DFG-Project WA 922/8-1.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sorin-Mihai Grad .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Grad, SM., Pop, EL. (2014). Characterizing Relatively Minimal Elements via Linear Scalarization. In: Huisman, D., Louwerse, I., Wagelmans, A. (eds) Operations Research Proceedings 2013. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-07001-8_21

Download citation

Publish with us

Policies and ethics