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

Competitive analysis of the online financial lease problem

Author

Listed:
  • Dai, Wenqiang
  • Dong, Yucheng
  • Zhang, Xiaotian

Abstract

The financial lease is an important financing tool by which the lessee can acquire ownership of equipment upon the expiration of the lease after making a series of rent payments for the use of the equipment. In this paper, we consider an online version of this financial lease decision problem in which the decision maker (the lessee) does not know how long he/she will use the equipment. By assuming, the lessee can use the equipment through two options: financial lease or lease; we define and solve this online financial lease decision problem using the competitive analysis method. The optimal online strategies are discussed in each financial lease case with or without down payment. Finally, the optimal strategies are summarized as simple decision rules.

Suggested Citation

  • Dai, Wenqiang & Dong, Yucheng & Zhang, Xiaotian, 2016. "Competitive analysis of the online financial lease problem," European Journal of Operational Research, Elsevier, vol. 250(3), pages 865-873.
    • Handle: RePEc:eee:ejores:v:250:y:2016:i:3:p:865-873
    DOI: 10.1016/j.ejor.2015.10.020
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221715009467
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2015.10.020?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

    for a different version of it.

    References listed on IDEAS

    as
    1. Liu, Ming & Chu, Chengbin & Xu, Yinfeng & Zheng, Feifeng, 2010. "An optimal online algorithm for single machine scheduling with bounded delivery times," European Journal of Operational Research, Elsevier, vol. 201(3), pages 693-700, March.
    2. Zheng, Feifeng & Cheng, Yongxi & Xu, Yinfeng & Liu, Ming, 2013. "Competitive strategies for an online generalized assignment problem with a service consecution constraint," European Journal of Operational Research, Elsevier, vol. 229(1), pages 59-66.
    3. Ran El-Yaniv & Richard M. Karp, 1997. "Nearly Optimal Competitive Online Replacement Policies," Mathematics of Operations Research, INFORMS, vol. 22(4), pages 814-839, November.
    4. Larsen, Kim S. & Wøhlk, Sanne, 2010. "Competitive analysis of the online inventory problem," European Journal of Operational Research, Elsevier, vol. 207(2), pages 685-696, December.
    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. Yong Zhang & Jiahao Li & Xingyu Yang & Xiaohui Wang, 2022. "Lease or financial lease? Deterministic strategies for on-line financial lease problem with the second-hand transaction," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 1248-1264, September.
    2. Jiamin Lu & Nishan Chen & Xin Feng, 2023. "Competitive Analysis of the Online Leasing Problem for Scarce Resources," IJERPH, MDPI, vol. 20(1), pages 1-11, January.
    3. Yinfeng Xu & Rongteng Zhi & Feifeng Zheng & Ming Liu, 2022. "Competitive algorithm for scheduling of sharing machines with rental discount," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 414-434, August.
    4. Schroeder, Pascal & Kacem, Imed, 2020. "Competitive difference analysis of the cash management problem with uncertain demands," European Journal of Operational Research, Elsevier, vol. 283(3), pages 1183-1192.
    5. Xin Feng & Chengbin Chu, 2022. "Online leasing problem with price fluctuations and the second-hand transaction," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 1280-1297, July.
    6. Yong Zhang & Jingting Wu & Wenxiong Lin & Muyu Hou, 2022. "Competitive analysis for two-option online leasing problem under sharing economy," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 670-689, August.

    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. Wenqiang Dai & Meng Zheng & Xu Chen & Zhuolin Yang, 0. "Online economic ordering problem for deteriorating items with limited price information," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-23.
    2. Wenqiang Dai & Meng Zheng & Xu Chen & Zhuolin Yang, 2022. "Online economic ordering problem for deteriorating items with limited price information," Journal of Combinatorial Optimization, Springer, vol. 44(4), pages 2246-2268, November.
    3. Guo R. & Ascher H. & Love E., 2001. "Towards Practical and Synthetical Modelling of Repairable Systems," Stochastics and Quality Control, De Gruyter, vol. 16(1), pages 147-182, January.
    4. Wang, Wei & Lan, Yingjie, 2022. "Robust one-way trading with limited number of transactions and heuristics for fixed transaction costs," International Journal of Production Economics, Elsevier, vol. 247(C).
    5. Ji Tian & Yan Zhou & Ruyan Fu, 2020. "An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown," Journal of Combinatorial Optimization, Springer, vol. 40(1), pages 170-180, July.
    6. Guanqun Ni, 2023. "An improved online replenishment policy and its competitive ratio analysis for a purchase-to-order seller," Journal of Combinatorial Optimization, Springer, vol. 46(2), pages 1-14, September.
    7. Na Li & Ran Ma & Yuzhong Zhang, 2025. "Single-machine scheduling with the learning effect of processing time and the deterioration effect of delivery time for prefabricated components," Journal of Combinatorial Optimization, Springer, vol. 49(3), pages 1-26, April.
    8. Peihai Liu & Xiwen Lu, 2015. "Online scheduling on two parallel machines with release dates and delivery times," Journal of Combinatorial Optimization, Springer, vol. 30(2), pages 347-359, August.
    9. Dai, Wenqiang & Jiang, Qingzhu & Feng, Yi, 2016. "A note: An improved upper bound for the online inventory problem with bounded storage and order costs," European Journal of Operational Research, Elsevier, vol. 249(2), pages 628-630.
    10. Wang, Liying & Lan, Yingjie & Zhang, Jean X., 2016. "Competitive difference analysis of the one-way trading problem with limited informationAuthor-Name: Wang, Wei," European Journal of Operational Research, Elsevier, vol. 252(3), pages 879-887.
    11. Jiamin Lu & Nishan Chen & Xin Feng, 2023. "Competitive Analysis of the Online Leasing Problem for Scarce Resources," IJERPH, MDPI, vol. 20(1), pages 1-11, January.
    12. Lixin Tang & Feng Li & Zhi-Long Chen, 2019. "Integrated Scheduling of Production and Two-Stage Delivery of Make-to-Order Products: Offline and Online Algorithms," INFORMS Journal on Computing, INFORMS, vol. 31(3), pages 493-514, July.
    13. Mohr, Esther, 2017. "Optimal replenishment under price uncertainty," European Journal of Operational Research, Elsevier, vol. 258(1), pages 136-143.
    14. Wenjie Li & Jinjiang Yuan, 2021. "Single-machine online scheduling of jobs with non-delayed processing constraint," Journal of Combinatorial Optimization, Springer, vol. 41(4), pages 830-843, May.
    15. Xin Feng & Yinfeng Xu & Guanqun Ni & Yongwu Dai, 2018. "Online leasing problem with price fluctuations under the consumer price index," Journal of Combinatorial Optimization, Springer, vol. 36(2), pages 493-507, August.
    16. Zhang, Jun & Liu, Feng & Tang, Jiafu & Li, Yanhui, 2019. "The online integrated order picking and delivery considering Pickers’ learning effects for an O2O community supermarket," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 123(C), pages 180-199.
    17. Xin Feng & Chengbin Chu, 2022. "Online leasing problem with price fluctuations and the second-hand transaction," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 1280-1297, July.
    18. Ahmadian, Mohammad Mahdi & Khatami, Mostafa & Salehipour, Amir & Cheng, T.C.E., 2021. "Four decades of research on the open-shop scheduling problem to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 295(2), pages 399-426.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:250:y:2016:i:3:p:865-873. 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.