Skip to main content
SpringerLink
Log in

Solving Fractional Multicriteria Optimization Problems with Sum of Squares Convex Polynomial Data

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

Abstract

This paper focuses on the study of finding efficient solutions in fractional multicriteria optimization problems with sum of squares convex polynomial data. We first relax the fractional multicriteria optimization problems to fractional scalar ones. Then, using the parametric approach, we transform the fractional scalar problems into non-fractional problems. Consequently, we prove that, under a suitable regularity condition, the optimal solution of each non-fractional scalar problem can be found by solving its associated single semidefinite programming problem. Finally, we show that finding efficient solutions in the fractional multicriteria optimization problems is tractable by employing the epsilon constraint method. In particular, if the denominators of each component of the objective functions are same, then we observe that efficient solutions in such a problem can be effectively found by using the hybrid method. Some numerical examples are given to illustrate our results.

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

Fig. 1
Fig. 2

Similar content being viewed by others

References

  1. Chen, H.J., Schaible, S., Sheu, R.L.: Generic algorithm for generalized fractional programming. J. Optim. Theory Appl. 141, 93–105 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  2. Schaible, S.: Fractional programming. Z. Oper. Res. 27, 39–54 (1983)

    MathSciNet  MATH  Google Scholar 

  3. Schaible, S.: Fractional programming: a recent survey. Generalized convexity, generalized monotonicity, optimality conditions and duality in scaler and vector optimization. J. Stat. Manag. Syst. 5, 63–86 (2002)

    Article  MathSciNet  Google Scholar 

  4. Ahmadi, A.A., Parrilo, P.A.: A convex polynomial that is not SOS-convex. Math. Program. 135, 275–292 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  5. Ahmadi, A.A., Parrilo, P.A.: A complete characterization of the gap between convexity and SOS-convexity. SIAM J. Optim. 23, 811–833 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  6. Helton, J.W., Nie, J.W.: Semidefinite representation of convex sets. Math. Program. 122, 21–64 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  7. Jeyakumar, V., Li, G.: A new class of alternative theorems for SOS-convex inequalities and robust optimization. Appl. Anal. 94, 56–74 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  8. Jiao, L.G., Lee, J.H.: Finding efficient solutions and decision makers for multicriteria SOS-convex polynomial optimization problems, submitted (2017)

  9. Lasserre, J.B.: Convexity in semialgebraic geometry and polynomial optimization. SIAM J. Optim. 19, 1995–2014 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  10. Chankong, V., Haimes, Y.Y.: Multiobjective Decision Making: Theory and Methodology. North-Holland, Amsterdam (1983)

    MATH  Google Scholar 

  11. Ehrgott, M.: Multicriteria Optimization, 2nd edn. Springer, Berlin (2005)

    MATH  Google Scholar 

  12. Ehrgott, M., Ruzika, S.: Improved \(\epsilon \)-constraint method for multiobjective progamming. J. Optim. Theory Appl. 138, 375–396 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  13. Guddat, J., Guerra Vasquez, F., Tammer, K., Wendler, K.: Multiobjective and Stochastic Optimization Based on Parametric Optimization. Akademie-Verlag, Berlin (1985)

    MATH  Google Scholar 

  14. 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: Mathematical Theories. Nonconvex Optimization and its Applications, vol. 38, pp. 141–215. Kluwer, Dordrecht (2000)

    Chapter  Google Scholar 

  15. Belousov, E.G., Klatte, D.: A Frank–Wolfe type theorem for convex polynomial programs. Comp. Optim. Appl. 22, 37–48 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  16. Lasserre, J.B.: Moments, Positive Polynomials and Their Applications. Imperial College Press, London (2010)

    MATH  Google Scholar 

  17. Jibetean, D., de Klerk, E.: Global optimization of rational functions: a semidefinite programming approach. Math. Program. 106, 93–109 (2006)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  19. Jeyakumar, V., Vicente-Pérez, J.: Dual semidefinite programs without duality gaps for a class of convex minimax programs. J. Optim. Theory Appl. 162, 735–753 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  20. Geoffrion, A.M.: Duality in nonlinear programming: a simplified applications-oriented development. SIAM Rev. 13, 1–37 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  21. Laurent, M.: Sums of squares, moment matrices and optimization over polynomials. In: Putinar, M., Sullivant, S. (eds.) Emerging Applications of Algebraic Geometry, IMA Vol. Math. Appl., pp. 157–270. Springer, Berlin (2009)

    Chapter  Google Scholar 

  22. Marshall, M.: Positive polynomials and sums of squares. Math. Surveys Monogr. vol. 146. AMS (2008)

  23. Grant, M.C., Boyd, S.P.: The CVX user’s guide, release 2.0. User manual (2013). http://cvxr.com/cvx/doc/CVX. Accessed 10 Jan 2018

  24. Reznick, B.: Extremal PSD forms with few terms. Duke Math. J. 45, 363–374 (1978)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The authors would like to express their sincere thanks to the associate editor and anonymous referees for their valuable suggestions and constructive comments, which helped to improve the quality of the paper. Besides, the authors thank Professor Franco Giannessi for his very important comments.

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, Pukyong National University, Busan, 48513, Republic of Korea

    Jae Hyoung Lee

  2. Department of Mathematics, College of Science, Yanbian University, Yanji City, 133002, Jilin Province, China

    Liguo Jiao

Authors
  1. Jae Hyoung Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Liguo Jiao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Liguo Jiao.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lee, J.H., Jiao, L. Solving Fractional Multicriteria Optimization Problems with Sum of Squares Convex Polynomial Data. J Optim Theory Appl 176, 428–455 (2018). https://doi.org/10.1007/s10957-018-1222-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-018-1222-8

Keywords

Mathematics Subject Classification

Search

Navigation