Skip to main content
SpringerLink
Log in

Saddle-Point Type Optimality Criteria and Duality Relations for Generalized Fractional Programming

  • Published:
OPSEARCH Aims and scope Submit manuscript

Abstract

For generalized fractional programming problem involving preinvex, semi-preinvex or arc-connected convex functions, saddle-point type optimality criteria is given in terms of generalized Lagrangian function. A dual is also formulated and certain duality theorems are established.

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

5. References

  1. Avriel M “Non Linear Programming: Theory and Method”, Prentice Hall, Englewood Cliffs, NJ (1976).

    Google Scholar 

  2. Barros A I, Frenk, J. B.G., Schaible S., Zhang, S. “A new algorithm for generalized fractional programs”, Math. Prog., 72 (1996), 147–175.

    Google Scholar 

  3. Bector C R Chandra. S, Bector. M. K. “Generalized fractional programming Duality: A parametric approach”, J. Optim. Theory Appl., 60 (1989), 243–260.

    Article  Google Scholar 

  4. Chandra S, Craven B D and Mond. B, “Generalized fractional programming duality: A ratio game approach”, J. Aust. Math. Soc, Series B, 28 (1986), 170–180.

    Article  Google Scholar 

  5. Chandra S and Kumar V “Equivalent Lagrangians for generalized fractional programming”, Opsearch, 30 (1993), 193–203.

    Google Scholar 

  6. Crouzeix J P Ferland J A and Schaible. S, “Duality in generalized fractional programming”, Math. Prog., 27 (1983), 342–354.

    Article  Google Scholar 

  7. Crouzeix J P Ferland J A and Schaible S “An algorithm for generalized fractional programs”, J. Optim. Theory Appl., 47 (1985), 35–49.

    Article  Google Scholar 

  8. Hayashi M and Komiya H “Perfect duality for convexike programs”, J. Optim. Theory Appl., 38 (1982), 179–189.

    Article  Google Scholar 

  9. Israel A Ben and Mond. B., “What is invexity?” J. Aust. Math. Soc, 28 (1986), 1–9.

    Article  Google Scholar 

  10. Jagannathan. R. and Schaible S “Duality in generalized fractional programming via Farkas’ lemma”, J. Optim. Theory Appl., 41 (1983), 417–424.

    Article  Google Scholar 

  11. Kim D S JO C L and LEE G M “Duality relations for generalized fractional programming involving n-set functions”, Indian J. Pure Appl. Math., 27 (12), (1996), 1167–1173.

    Google Scholar 

  12. Xu Z K “Saddle-point type optimality criteria for generalized fractional programming”, J. Optim. Theory Appl., (1988), 189–196.

    Google Scholar 

  13. Xu Z K “Duality in generalized non linear fractional programming”, J. Math. Anal. Appl., 169 (1992), 1–9.

    Article  Google Scholar 

  14. Yang X Q and Chen G Y “A class of non convex functions and pre-variational inequalities”, J. Math. Anal. Appl., 169 (1992), 359–373.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Miranda House University of Delhi, Delhi, 110 007, India

    S. K. Suneja

  2. Department of Mathematics, Rajdhani College University of Delhi, Raja Garden, New Delhi, 110 015, India

    C. S. Lalitha

  3. Department of Mathematics, Daulat Ram College University of Delhi, Delhi, 110 007, India

    Seema Khurana

Authors
  1. S. K. Suneja
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. S. Lalitha
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Seema Khurana
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Suneja, S.K., Lalitha, C.S. & Khurana, S. Saddle-Point Type Optimality Criteria and Duality Relations for Generalized Fractional Programming. OPSEARCH 38, 183–196 (2001). https://doi.org/10.1007/BF03399224

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

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

Key words

Search

Navigation