Skip to main content
SpringerLink
Log in

Sufficient optimality criteria in non-linear programming in the presence of convex equality and inequality constraints

  • Published:
Zeitschrift für Operations Research Aims and scope Submit manuscript

Summary

Sufficient optimality criteria are derived for mathematical programs in which non-linear inequality and equality constraints are present. These are similar to those ofKuhn-Tucker andFritz John optimality criteria.

Zusammenfassung

Für mathematische Optimierungsprobleme mit nichtlinearen Nebenbedingungen in Ungleichungs- und Gleichungsform werden hinreichende Optimalitätskriterien entwickelt, die denen vonKuhn-Tucker undFritz John gleichen.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Mangasarian, O. L.: Pseudo-convex Functions, J. SIAM CONTROL3, 281–290, 1965.

    Google Scholar 

  • —: Non-linear Programming, McGraw-Hill Book Company, New York 1969.

    Google Scholar 

  • Mangasarian, O. L., andS. Fromovitz: The Fritz John Necessary optimality conditions in the presence of equality and inequality constraints, J. Math. Analysis and Applications17, 37–47, 1967.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research and Training School, Indian Statistical Institute, 203 Barrackpore Trunk Road, Calcutta-35, India

    S. K. Bhatt & S. K. Misra

Authors
  1. S. K. Bhatt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. K. Misra
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bhatt, S.K., Misra, S.K. Sufficient optimality criteria in non-linear programming in the presence of convex equality and inequality constraints. Zeitschrift für Operations Research 19, 101–105 (1975). https://doi.org/10.1007/BF01957169

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation