Skip to main content
Log in

Sequential Optimality Conditions for Fractional Optimization with Applications to Vector Optimization

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

Abstract

In this paper, in the absence of any constraint qualifications, a sequential Lagrange multiplier rule condition characterizing optimality for a fractional optimization problem is obtained in terms of the \(\varepsilon \)-subdifferentials of the functions involved at the minimizer. The significance of this result is that it yields the standard Lagrange multiplier rule condition for the fractional optimization problem under a simple closedness condition that is much weaker than the well-known constraint qualifications. A sequential condition characterizing optimality involving only subdifferentials at nearby points to the minimizer is also investigated. As applications, the proposed approach is applied to investigate sequential optimality conditions for vector fractional optimization problems.

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. Giannessi, F., Mastroeni, G., Pellegrini, L.: On the theory of vector optimization and variational inequalities: image space analysis and separation. In: Giannessi, F. (ed.) Vector Variational Inequalities and Vector Equilibria, pp. 141–215. Kluwer, Dordrech (2000)

    Chapter  Google Scholar 

  2. Chen, G.Y., Huang, X.X., Yang, X.Q.: Vector Optimization: Set-Valued and Variational Analysis, Lecture Notes in Economics and Mathematical Systems, vol. 541. Springer, Berlin (2005)

    Google Scholar 

  3. Mordukhovich, B.S.: Variational Analysis and Generalized Differentiation, I: Basic Theory. Springer, Berlin (2006)

    Google Scholar 

  4. Boţ, R.I., Grad, A., Wanka, G.: Sequential characterization of solutions in convex composite programming and applications to vector optimization. J. Ind. Manag. Optim. 4, 767–782 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  5. Li, S.J., Teo, K.L., Yang, X.Q.: High-order optimality conditions for set-valued optimization. J. Optim. Theory Appl. 137, 533–553 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  6. Lee, G.M., Kim, G.S., Dinh, N.: Optimality conditions for approximate solutions of convex semi-infinite vector optimization problems. In: Ansar, Q.H., Yao, J.-C. (eds.) Recent Developments in Vector Optimization, Vector Optimization, vol. 1, pp. 275–295. Springer, Berlin (2012)

    Chapter  Google Scholar 

  7. Jeyakumar, V., Dinh, N., Lee, G.M.: A new closed cone constraint qualification for convex optimization. Applied Mathematics Report AMR 04/8, University of New South Wales (2004)

  8. Burachik, R.S., Jeyakumar, V.: A new geometric condition for Fenchel’s duality in infinite dimensional spaces. Math. Program. 104, 229–233 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  9. Fang, D.H., Li, C., Ng, K.F.: Constraint qualifications for extended Farkas’s lemmas and Lagrangian dualities in convex infinite programming. SIAM J. Optim. 20, 1311–1332 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  10. Boţ, R.I.: Conjugate Duality in Convex Optimization. Springer, Berlin (2010)

    MATH  Google Scholar 

  11. Jeyakumar, V., Lee, G.M., Dinh, N.: New sequential Lagrange multiplier conditions characterizing optimality without constraint qualifications for convex programs. SIAM J. Optim. 14, 534–547 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  12. Jeyakumar, V., Wu, Z.Y., Lee, G.M., Dinh, N.: Liberating the subgradient optimality conditions from constraint qualifications. J. Glob. Optim. 36, 127–137 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  13. Bai, F.S., Wu, Z.Y., Zhu, D.L.: Sequential Lagrange multiplier condition for \(\varepsilon \)-optimal solution in convex programming. Optimization 57, 669–680 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  14. Boţ, R.I., Csetnek, E.R., Wanka, G.: Sequential optimality conditions in convex programming via perturbation approach. J. Convex Anal. 15, 149–164 (2008)

    MATH  MathSciNet  Google Scholar 

  15. Boţ, R.I., Csetnek, E.R., Wanka, G.: Sequential optimality conditions for composed convex optimization problems. J. Math. Anal. Appl. 342, 1015–1025 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  16. Kim, G.S., Lee, G.M.: On \(\varepsilon \)-optimality theorems for convex vector optimization problems. J. Nonlinear Convex Anal. 12, 473–482 (2011)

    MATH  MathSciNet  Google Scholar 

  17. Dinkelbach, W.: On nonlinear fractional programming. Manag. Sci. 13, 492–498 (1967)

    Article  MATH  MathSciNet  Google Scholar 

  18. Schaible, S.: Fractional programming, II. On Dinkelbach’s algorithm. Manag. Sci. 22, 868–873 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  19. Mishra, S.K.: Generalized fractional programming problems containing locally subdifferentiable \(\rho \)-univex functions. Optimization 41, 135–158 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  20. Yang, X.M., Teo, K.L., Yang, X.Q.: Symmetric duality for a class of nonlinear fractional programming problems. J. Math. Anal. Appl. 271, 7–15 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  21. Boţ, R.I., Hodrea, I.B., Wanka, G.: Farkas-type results for fractional programming problems. Nonlinear Anal. 67, 1690–1703 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  22. Sun, X.K., Chai, Y.: On robust duality for fractional programming with uncertainty data. Positivity 18, 9–28 (2014)

    Article  MATH  MathSciNet  Google Scholar 

  23. Brondsted, A., Rockafellar, R.T.: On the subdifferential of convex functions. Proc. Am. Math. Soc. 16, 605–611 (1965)

    Article  MathSciNet  Google Scholar 

  24. Thibault, L.: Sequential convex subdifferential calculus and sequential Lagrange multipliers. SIAM J. Optim. 35, 1434–1444 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  25. Boţ, R.I., Grad, S.M., Wanka, G.: On strong and total Lagrange duality for convex optimization problems. J. Math. Anal. Appl. 337, 1315–1325 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  26. Li, C., Fang, D.H., López, G., López, M.A.: Stable and total Fenchel duality for convex optimization problems in locally convex spaces. SIAM J. Optim. 20, 1032–1051 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  27. Fang, D.H., Li, C., Yang, X.Q.: Stable and total Fenchel duality for DC optimization problems in locally convex spaces. SIAM J. Optim. 21, 730–760 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  28. Sun, X.K., Li, S.J., Zhao, D.: Duality and Farkas-type results for DC infinite programming with inequality constraints Taiwan. J. Math. 17, 1227–1244 (2013)

    MATH  MathSciNet  Google Scholar 

Download references

Acknowledgments

We would like to express our sincere thanks to the anonymous referees for many helpful comments and constructive suggestions which have contributed to the final preparation of this paper. This research was partially supported by the National Natural Science Foundation of China (Grant Nos: 11301570 and 11001287), the Basic and Advanced Research Project of CQ CSTC (Grant No: cstc20 13jcyjA00003), the China Postdoctoral Science Foundation funded project (Grant No: 2013M540697) and the Natural Science Foundation Project of CQ CSTC (Grant No: cstc2012jjA00038).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xiang-Kai Sun.

Additional information

Communicated by Harold P. Benson.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sun, XK., Long, XJ. & Chai, Y. Sequential Optimality Conditions for Fractional Optimization with Applications to Vector Optimization. J Optim Theory Appl 164, 479–499 (2015). https://doi.org/10.1007/s10957-014-0578-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-014-0578-7

Keywords

Mathematics Subject Classification

Navigation