Skip to main content

On the Relations Between Different Dual Problems in Convex Mathematical Programming

  • Conference paper
Book cover Operations Research Proceedings 2001

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

Abstract

Using the Fenchel-Rockafellar approach for the convex mathematical programming problem with inequality constraints different dual optimization problems by means of distinct perturbations of the primal problem are derived and studied. The classical Lagrange dual problem is one of those dual problems obtained by the perturbation of the right hand side of the inequality constraints. For the various dual problems equality/inequality relations between the optimum values are verified under appropriate assumptions. Moreover, the duality relations to the primal problem are considered, in particular strong duality. Using the dual problems some optimality conditions are established.

The results are illustrated by some examples.

The application and usefulness for the construction of general multiobjective dual problems to the general multiobjective convex optimization problem is mentioned.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Ekeland I., Temam R. (1976) Convex analysis and variational problems. North-Holland Publishing Company, Amsterdam

    Google Scholar 

  2. Elster K.-H., Reinhardt R., Schäuble M., Donath G. (1977) Einführung in die nichtlineare Optimierung. Teubner, Leipzig

    Google Scholar 

  3. Rockafellar R.T. (1970) Convex Analysis. Princeton University Press, Princeton, NJ

    Google Scholar 

  4. Wanka G., Boţ R.-I. (2001) A new duality approach for multiobjective convex optimization problems. Fakultät für Mathematik, TU Chemnitz, Preprint 2001–6

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wanka, G., Boţ, RI. (2002). On the Relations Between Different Dual Problems in Convex Mathematical Programming. In: Chamoni, P., Leisten, R., Martin, A., Minnemann, J., Stadtler, H. (eds) Operations Research Proceedings 2001. Operations Research Proceedings 2001, vol 2001. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-50282-8_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-50282-8_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43344-6

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics