IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v278y2019i1p36-48.html
   My bibliography  Save this article

A practicable contraction approach for the sum of the generalized polynomial ratios problem

Author

Listed:
  • Shen, Peiping
  • Zhu, Zeyi
  • Chen, Xiao

Abstract

In this paper, a practicable contraction approach is proposed for solving the sum of the generalized polynomial ratios problem (P) with generalized polynomial constraints. Due to the intrinsic difficulty of problem (P), less work has been devoted to solving this problem. The proposed approach is based on reducing the original nonconvex problem (P) as a standard geometric programming (GP) problem by utilizing simple transformation and contraction strategies. The resulting optimization problem can be solved effectively by utilizing the solutions of a series of GP problems. The tractability and effectiveness of the proposed successive contraction approach are demonstrated by several numerical examples, and the performance comparison of the proposed approach and other methods published is also presented in terms of solution quality.

Suggested Citation

  • Shen, Peiping & Zhu, Zeyi & Chen, Xiao, 2019. "A practicable contraction approach for the sum of the generalized polynomial ratios problem," European Journal of Operational Research, Elsevier, vol. 278(1), pages 36-48.
    • Handle: RePEc:eee:ejores:v:278:y:2019:i:1:p:36-48
    DOI: 10.1016/j.ejor.2019.03.014
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037722171930253X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2019.03.014?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Jiao, Hong-Wei & Liu, San-Yang, 2015. "A practicable branch and bound algorithm for sum of linear ratios problem," European Journal of Operational Research, Elsevier, vol. 243(3), pages 723-730.
    2. Du, Juan & Cook, Wade D. & Liang, Liang & Zhu, Joe, 2014. "Fixed cost and resource allocation based on DEA cross-efficiency," European Journal of Operational Research, Elsevier, vol. 235(1), pages 206-214.
    3. Mandal, Nirmal Kumar & Roy, Tapan Kumar & Maiti, Manoranjan, 2006. "Inventory model of deteriorated items with a constraint: A geometric programming approach," European Journal of Operational Research, Elsevier, vol. 173(1), pages 199-210, August.
    4. Xu, Gongxian, 2014. "Global optimization of signomial geometric programming problems," European Journal of Operational Research, Elsevier, vol. 233(3), pages 500-510.
    5. Tseng, Chung-Li & Zhan, Yiduo & Zheng, Qipeng P. & Kumar, Manish, 2015. "A MILP formulation for generalized geometric programming using piecewise-linear approximations," European Journal of Operational Research, Elsevier, vol. 245(2), pages 360-370.
    6. Takahito Kuno & Toshiyuki Masaki, 2013. "A practical but rigorous approach to sum-of-ratios optimization in geometric applications," Computational Optimization and Applications, Springer, vol. 54(1), pages 93-109, January.
    7. Benson, Harold P., 2007. "A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem," European Journal of Operational Research, Elsevier, vol. 182(2), pages 597-611, October.
    8. Gruzdeva, Tatiana V. & Strekalovsky, Alexander S., 2018. "On solving the sum-of-ratios problem," Applied Mathematics and Computation, Elsevier, vol. 318(C), pages 260-269.
    9. Qu, Shaojian & Zhang, Kecun & Wang, Fusheng, 2008. "A global optimization using linear relaxation for generalized geometric programming," European Journal of Operational Research, Elsevier, vol. 190(2), pages 345-356, October.
    10. Ashtiani, Alireza M. & Ferreira, Paulo A.V., 2015. "A branch-and-cut algorithm for a class of sum-of-ratios problems," Applied Mathematics and Computation, Elsevier, vol. 268(C), pages 596-608.
    11. Joe Zhu, 2014. "DEA Cross Efficiency," International Series in Operations Research & Management Science, in: Quantitative Models for Performance Evaluation and Benchmarking, edition 3, chapter 4, pages 61-92, Springer.
    12. Peiping Shen & Yuan Ma & Yongqiang Chen, 2011. "Global optimization for the generalized polynomial sum of ratios problem," Journal of Global Optimization, Springer, vol. 50(3), pages 439-455, July.
    13. Lin, Ming-Hua & Tsai, Jung-Fa, 2012. "Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems," European Journal of Operational Research, Elsevier, vol. 216(1), pages 17-25.
    14. Garg, Harish, 2016. "A hybrid PSO-GA algorithm for constrained optimization problems," Applied Mathematics and Computation, Elsevier, vol. 274(C), pages 292-305.
    15. Peiping Shen & Xiaoai Li, 2013. "Branch-reduction-bound algorithm for generalized geometric programming," Journal of Global Optimization, Springer, vol. 56(3), pages 1123-1142, July.
    16. Kim, DaeSoo & Lee, Won J., 1998. "Optimal joint pricing and lot sizing with fixed and variable capacity," European Journal of Operational Research, Elsevier, vol. 109(1), pages 212-227, August.
    17. Hoang Tuy, 2016. "Convex Analysis and Global Optimization," Springer Optimization and Its Applications, Springer, edition 2, number 978-3-319-31484-6, September.
    18. Yang, Min & Li, Yongjun & Chen, Ya & Liang, Liang, 2014. "An equilibrium efficiency frontier data envelopment analysis approach for evaluating decision-making units with fixed-sum outputs," European Journal of Operational Research, Elsevier, vol. 239(2), pages 479-489.
    19. Jung, Hoon & Klein, Cerry M., 2005. "Optimal inventory policies for an economic order quantity model with decreasing cost functions," European Journal of Operational Research, Elsevier, vol. 165(1), pages 108-126, August.
    20. Lim, Sungmook & Zhu, Joe, 2013. "Integrated data envelopment analysis: Global vs. local optimum," European Journal of Operational Research, Elsevier, vol. 229(1), pages 276-278.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jiao, Hongwei & Ma, Junqiao, 2022. "An efficient algorithm and complexity result for solving the sum of general affine ratios problem," Chaos, Solitons & Fractals, Elsevier, vol. 164(C).
    2. S. M. Mirhadi & S. A. MirHassani, 2022. "A solution approach for cardinality minimization problem based on fractional programming," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 583-602, August.
    3. Li, Yifu & Qi, Xiangtong, 2022. "A geometric branch-and-bound algorithm for the service bundle design problem," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1044-1056.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Tseng, Chung-Li & Zhan, Yiduo & Zheng, Qipeng P. & Kumar, Manish, 2015. "A MILP formulation for generalized geometric programming using piecewise-linear approximations," European Journal of Operational Research, Elsevier, vol. 245(2), pages 360-370.
    2. Jiao, Hongwei & Ma, Junqiao, 2022. "An efficient algorithm and complexity result for solving the sum of general affine ratios problem," Chaos, Solitons & Fractals, Elsevier, vol. 164(C).
    3. Yiduo Zhan & Qipeng P. Zheng & Chung-Li Tseng & Eduardo L. Pasiliao, 2018. "An accelerated extended cutting plane approach with piecewise linear approximations for signomial geometric programming," Journal of Global Optimization, Springer, vol. 70(3), pages 579-599, March.
    4. Jiao, Hong-Wei & Liu, San-Yang, 2015. "A practicable branch and bound algorithm for sum of linear ratios problem," European Journal of Operational Research, Elsevier, vol. 243(3), pages 723-730.
    5. Xu, Gongxian, 2014. "Global optimization of signomial geometric programming problems," European Journal of Operational Research, Elsevier, vol. 233(3), pages 500-510.
    6. Ata Allah Taleizadeh & Leila Aliabadi & Park Thaichon, 2022. "A sustainable inventory system with price-sensitive demand and carbon emissions under partial trade credit and partial backordering," Operational Research, Springer, vol. 22(4), pages 4471-4516, September.
    7. Armin Jabbarzadeh & Leyla Aliabadi & Reza Yazdanparast, 2021. "Optimal payment time and replenishment decisions for retailer’s inventory system under trade credit and carbon emission constraints," Operational Research, Springer, vol. 21(1), pages 589-620, March.
    8. Wu, Jie & Chu, Junfei & Sun, Jiasen & Zhu, Qingyuan, 2016. "DEA cross-efficiency evaluation based on Pareto improvement," European Journal of Operational Research, Elsevier, vol. 248(2), pages 571-579.
    9. Yang, Min & Li, Yong Jun & Liang, Liang, 2015. "A generalized equilibrium efficient frontier data envelopment analysis approach for evaluating DMUs with fixed-sum outputs," European Journal of Operational Research, Elsevier, vol. 246(1), pages 209-217.
    10. Mahdiloo, Mahdi & Toloo, Mehdi & Duong, Thach-Thao & Farzipoor Saen, Reza & Tatham, Peter, 2018. "Integrated data envelopment analysis: Linear vs. nonlinear model," European Journal of Operational Research, Elsevier, vol. 268(1), pages 255-267.
    11. Jiao, Hongwei & Liu, Sanyang & Lu, Nan, 2015. "A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming," Applied Mathematics and Computation, Elsevier, vol. 250(C), pages 973-985.
    12. Liu, Hui-hui & Song, Yao-yao & Liu, Xiao-xiao & Yang, Guo-liang, 2020. "Aggregating the DEA prospect cross-efficiency with an application to state key laboratories in China," Socio-Economic Planning Sciences, Elsevier, vol. 71(C).
    13. Li, Feng & Zhu, Qingyuan & Chen, Zhi, 2019. "Allocating a fixed cost across the decision making units with two-stage network structures," Omega, Elsevier, vol. 83(C), pages 139-154.
    14. Barnabé Walheer, 2019. "Disaggregation for efficiency analysis," Journal of Productivity Analysis, Springer, vol. 51(2), pages 137-151, June.
    15. Akram Dehnokhalaji & Mojtaba Ghiyasi & Pekka Korhonen, 2017. "Resource allocation based on cost efficiency," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(10), pages 1279-1289, October.
    16. Weiwei Zhu & Qian Zhang & Haiqing Wang, 2019. "Fixed costs and shared resources allocation in two-stage network DEA," Annals of Operations Research, Springer, vol. 278(1), pages 177-194, July.
    17. Chu, Junfei & Wu, Jie & Chu, Chengbin & Zhang, Tinglong, 2020. "DEA-based fixed cost allocation in two-stage systems: Leader-follower and satisfaction degree bargaining game approaches," Omega, Elsevier, vol. 94(C).
    18. Cherchye, Laurens & De Rock, Bram & Walheer, Barnabé, 2016. "Multi-output profit efficiency and directional distance functions," Omega, Elsevier, vol. 61(C), pages 100-109.
    19. Peiping Shen & Kaimin Wang & Ting Lu, 2020. "Outer space branch and bound algorithm for solving linear multiplicative programming problems," Journal of Global Optimization, Springer, vol. 78(3), pages 453-482, November.
    20. Bo Zhang & YueLin Gao & Xia Liu & XiaoLi Huang, 2022. "An Outcome-Space-Based Branch-and-Bound Algorithm for a Class of Sum-of-Fractions Problems," Journal of Optimization Theory and Applications, Springer, vol. 192(3), pages 830-855, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:278:y:2019:i:1:p:36-48. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.