Skip to main content
Log in

Complex nonlinear programming: Duality with invexity and equivalent real programs

  • Contributed Papers
  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

Necessary conditions for optimality in polyhedral-cone constrained nonlinear complex programs are shown to be sufficient under the assumption of a particular form of invexity. Duality results are thus extended for a Wolfe-type dual. The formulation of real programs equivalent to complex programs via generating matrices is presented.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Levinson, N.,Linear Programming in Complex Space, Journal of Mathematical Analysis and Applications, Vol. 14, pp. 44–62, 1966.

    Google Scholar 

  2. Hanson, M. A., andMond, B.,Quadratic Programming in Complex Space, Journal of Mathematical Analysis and Applications, Vol. 20, pp. 507–514, 1967.

    Google Scholar 

  3. Ben-Israel, A.,Linear Equations and Inequalities on Finite-Dimensional, Real or Complex, Vector Spaces: A Unified Theory, Journal of Mathematical Analysis and Applications, Vol. 27, pp. 367–389, 1969.

    Google Scholar 

  4. Abrams, R. A., andBen-Israel, A.,Nonlinear Programming in Complex Space: Necessary Conditions, SIAM Journal on Control, Vol. 9, pp. 606–620, 1971.

    Google Scholar 

  5. Abrams, R. A.,Nonlinear Programming in Complex Space: Sufficient Conditions and Duality, Journal of Mathematical Analysis and Applications, Vol. 38, pp. 619–632, 1972.

    Google Scholar 

  6. Abrams, R. A., andBen-Israel, A.,Complex Mathematical Programming, Developments in Operations Research, Edited by B. Avi-Itzhak, Gordon and Breach, New York, New York, 1971.

    Google Scholar 

  7. Abrams, R. A., andBen-Israel, A.,A Duality Theorem for Complex Quadratic Programming, Journal of Optimization Theory and Applications, Vol. 4, pp. 244–252, 1969.

    Google Scholar 

  8. Craven, B. D., andMond, B.,On Duality in Complex Linear Programming, Journal of the Australian Mathematical Society, Vol. 16, pp. 172–175, 1973.

    Google Scholar 

  9. Hanson, M. A., andMond, B.,Duality for Nonlinear Programming in Complex Space, Journal of Mathematical Analysis and Applications, Vol. 28, pp. 52–58, 1969.

    Google Scholar 

  10. Weir, T., andMond, B.,Generalized Convexity and Duality for Complex Programming Problems, Cahiers du Centre d'Etudes de Recherche Operationelle, Vol. 26, pp. 137–142, 1984.

    Google Scholar 

  11. Bhatia, D., andKaul, R. N.,Nonlinear Programming in Complex Space, Journal of Mathematical Analysis and Applications, Vol. 28, pp. 144–152, 1969.

    Google Scholar 

  12. Datta, N.,Duality for a Class of Nondifferentiable Mathematical Programming Problems in Complex Space, Journal of Mathematical Analysis and Applications, Vol. 101, pp. 1–11, 1984.

    Google Scholar 

  13. Gulati, T. R.,On Nonlinear Nondifferentiable Complex Programming Problems, Zeitschrift fur Angewandte Mathematik und Mechanik, Vol. 62, pp. 418–420, 1982.

    Google Scholar 

  14. Jain, O. P., andSaxena, P. C.,A Duality Theorem for a Special Class of Programming Problems in Complex Space, Journal of Optimization Theory and Applications, Vol. 16, pp. 207–220, 1975.

    Google Scholar 

  15. Mond, B., andCraven, B. D.,A Class of Nondifferentiable Complex Programming Problems, Mathematische Operationsforschung und Statistik, Vol. 6, pp. 581–591, 1975.

    Google Scholar 

  16. Parkash, O., Saxena, P. C., andPatkar, V.,Nondifferentiable Fractional Programming in Complex Space, Zeitschrift fur Angewandte Mathematik und Mechanik, Vol. 64, pp. 59–62, 1984.

    Google Scholar 

  17. Rani, O., andKaul, R. N.,Nonlinear Programming in Complex Space, Journal of Mathematical Analysis and Applications, Vol. 43, pp. 1–14, 1973.

    Google Scholar 

  18. Gupta, B.,Second-Order Duality and Symmetric Duality for Nonlinear Programs in Complex Space, Journal of Mathematical Analysis and Applications, Vol. 97, pp. 56–64, 1983.

    Google Scholar 

  19. Hanson, M. A.,On Sufficiency of the Kuhn-Tucker Conditions, Journal of Mathematical Analysis and Applications, Vol. 80, pp. 545–550, 1981.

    Google Scholar 

  20. Mond, B., andMurray, G. J.,On Solving Complex Programs, Opsearch, Vol. 21, pp. 262–270, 1984.

    Google Scholar 

  21. Ben-Israel, A., andMond, B.,What is Invexity?, Journal of the Australian Mathematical Society, Series B, Vol. 28, pp. 1–9, 1986.

    Google Scholar 

  22. Craven, B. D.,Duality for Generalized Convex Fractional Programs, Generalized Concavity in Optimization and Economics, Edited by S. Schaible and W. T. Ziemba, Academic Press, New York, New York, 1981.

    Google Scholar 

  23. Martin, D. H.,The Essence of Invexity, Journal of Optimization Theory and Applications, Vol. 47, pp. 65–76, 1985.

    Google Scholar 

  24. Hanson, M. A.,A Duality Theorem in Nonlinear Programming with Nonlinear Constraints, Australian Journal of Statistics, Vol. 3, pp. 64–71, 1961.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by M. Avriel

Rights and permissions

Reprints and permissions

About this article

Cite this article

Smart, I., Mond, B. Complex nonlinear programming: Duality with invexity and equivalent real programs. J Optim Theory Appl 69, 469–488 (1991). https://doi.org/10.1007/BF00940685

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00940685

Key Words

Navigation