Skip to main content

Symmetric Duality and Complementarity in Non-Convex Programming

  • Chapter
  • First Online:
Operations Research in Development Sector

Part of the book series: Asset Analytics ((ASAN))

  • 444 Accesses

Abstract

In this paper the duality results for a pair of symmetric duals in non-convex programming are obtained by using complementarity. The functions considered are strong pseudo-convex and strong pseudo concave.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and 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
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Bazaraa MS, Sherali HD, Shetty CM (2004) Nonlinear Programming Theory and, Algorithms2nd edn. Wiley, New York

    Google Scholar 

  2. Craven BD, Mond B (1973) Transpositions theorem for cone convex functions. SIAM Journal of Appl. Math. 24:603–612

    Article  Google Scholar 

  3. Craven BD, Mond B (1977) Complementarity for arbitrary cones. Zeitschrift fur Operations Research 21:143–150

    Google Scholar 

  4. Dantzig GB, Cottle RW (1967) Positive semi-definite Programming. In Abadie J (ed) Nonlinear programming (Chapter 4), Amsterdam

    Google Scholar 

  5. Ekeland I (2004) Non convex duality. Adv Mech Math 6:13–19

    Article  Google Scholar 

  6. Gao DY (2004) Canonical duality theory and solutions to constrained nonconvex quadratic programming. J Global Optim 29:377–399

    Article  Google Scholar 

  7. Mangasarian OL (1969) Nonlinear programming. Mc-Graw Hill, New York

    Google Scholar 

  8. Mangasarian OL (1965) Pseudo-convex Functions. SIAM Journal of Control 3:281–290

    Google Scholar 

  9. Mangasarian OL, Solodov MV (1993) Nonlinear complementarity as unconstrained an constrained minimization. Math Program 62:277–297

    Article  Google Scholar 

  10. Mishra MS, Nanda S, Acharya D (1985) Strong Pseudo convexity and symmetric duality in nonlinear programming. J. Aust. Math. Soc. Ser. B. 27:238–244

    Article  Google Scholar 

  11. Mishra SK (2011) Topics in nonconvex optimization and its applications. Springer, New York

    Book  Google Scholar 

  12. Nayak JR (2004) Some problems of nonconvex programming and the properties of some nonconvex functions. Ph. D. Thesis. Utkal University

    Google Scholar 

  13. Rockafellar RT (1970) Convex analysis. Princeton University Press, New Jersey

    Book  Google Scholar 

  14. Zalmai GJ (2004) Optimality conditions and duality models for minmax fractional optimal Control problems containing arbitrary norms. J Korea Math Soc 41(5):821–864

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jyotiranjan Nayak .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Nayak, J., Mishra, S. (2019). Symmetric Duality and Complementarity in Non-Convex Programming. In: Tripathy, A., Subudhi, R., Patnaik, S., Nayak, J. (eds) Operations Research in Development Sector. Asset Analytics. Springer, Singapore. https://doi.org/10.1007/978-981-13-1954-9_4

Download citation

Publish with us

Policies and ethics