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

Decision model and analysis for investment interest expense deduction and allocation

Author

Listed:
  • Lee, Zu-Hsu
  • Deng, Shiming
  • Lin, Beixin
  • Yang, James G.S.

Abstract

Investment income tax planning requires informed, strategic choices. One must determine the amount of qualified dividends and net long-term capital gain to be included in investment income (against which investment interest expense can be deducted). This choice also determines the residual qualified dividends and net long-term capital gain which enjoy a reduced tax rate. Another important decision is whether all or some of this interest expense should be deducted in the current year or carried forward. This paper puts forward a new approach to formulate these questions as a generalized resource allocation problem which permits analysis of the interdependence between, and the tax consequences of, the above decisions. The commonly used approach - deducting investment interest expense sooner rather than later - we consider myopic since the benefit of deferring some of the deduction is not leveraged. Presented here is a tax planning guideline (a necessary and sufficient condition for optimality) to realize a more forward-looking strategy. We also show that, for certain income structures, the tax savings by deducting a one-dollar investment interest expense may be more than the tax rate on the dollar of investment income that is offset.

Suggested Citation

  • Lee, Zu-Hsu & Deng, Shiming & Lin, Beixin & Yang, James G.S., 2010. "Decision model and analysis for investment interest expense deduction and allocation," European Journal of Operational Research, Elsevier, vol. 200(1), pages 268-280, January.
    • Handle: RePEc:eee:ejores:v:200:y:2010:i:1:p:268-280
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(08)01053-9
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Dorit S. Hochbaum, 1994. "Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems," Mathematics of Operations Research, INFORMS, vol. 19(2), pages 390-409, May.
    2. Florian Herzog & Gabriel Dondi & Simon Keel & Lorenz M. Schumani & Hans P. Geering, 2007. "Solving ALM problems via sequential stochastic programming," Quantitative Finance, Taylor & Francis Journals, vol. 7(2), pages 231-244.
    3. Paul H. Zipkin, 1980. "Simple Ranking Methods for Allocation of One Resource," Management Science, INFORMS, vol. 26(1), pages 34-43, January.
    4. Kurt M. Bretthauer & Bala Shetty & Siddhartha Syam, 1995. "A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems," INFORMS Journal on Computing, INFORMS, vol. 7(1), pages 109-116, February.
    5. Zhiping Chen & K. C. Yuen, 2005. "Optimal consumption and investment problems under GARCH with transaction costs," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 61(2), pages 219-237, June.
    6. Harvey M. Wagner & Thomson M. Whitin, 1958. "Dynamic Version of the Economic Lot Size Model," Management Science, INFORMS, vol. 5(1), pages 89-96, October.
    7. Dammon, Robert M & Spatt, Chester S & Zhang, Harold H, 2001. "Optimal Consumption and Investment with Capital Gains Taxes," The Review of Financial Studies, Society for Financial Studies, vol. 14(3), pages 583-616.
    8. Ross, Stephen A, 1985. "Debt and Taxes and Uncertainty," Journal of Finance, American Finance Association, vol. 40(3), pages 637-657, July.
    9. Patriksson, Michael, 2008. "A survey on the continuous nonlinear resource allocation problem," European Journal of Operational Research, Elsevier, vol. 185(1), pages 1-46, February.
    10. J Hu & C L Munson & E A Silver, 2004. "A modified Silver–Meal heuristic for dynamic lot sizing under incremental quantity discounts," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(6), pages 671-673, June.
    11. Fleten, Stein-Erik & Hoyland, Kjetil & Wallace, Stein W., 2002. "The performance of stochastic dynamic and fixed mix portfolio models," European Journal of Operational Research, Elsevier, vol. 140(1), pages 37-49, July.
    12. Gupta, Aparna & Li, Zhisheng, 2007. "Integrating optimal annuity planning with consumption-investment selections in retirement planning," Insurance: Mathematics and Economics, Elsevier, vol. 41(1), pages 96-110, July.
    13. DeAngelo, Harry & Masulis, Ronald W., 1980. "Optimal capital structure under corporate and personal taxation," Journal of Financial Economics, Elsevier, vol. 8(1), pages 3-29, March.
    14. Satoru Fujishige & Naoki Katoh & Tetsuo Ichimori, 1988. "The Fair Resource Allocation Problem with Submodular Constraints," Mathematics of Operations Research, INFORMS, vol. 13(1), pages 164-173, February.
    15. ManMohan S. Sodhi, 2005. "LP Modeling for Asset-Liability Management: A Survey of Choices and Simplifications," Operations Research, INFORMS, vol. 53(2), pages 181-196, April.
    16. Kurt M. Bretthauer & Bala Shetty, 1995. "The Nonlinear Resource Allocation Problem," Operations Research, INFORMS, vol. 43(4), pages 670-683, August.
    17. Soren S. Nielsen & Stavros A. Zenios, 1992. "Massively Parallel Algorithms for Singly Constrained Convex Programs," INFORMS Journal on Computing, INFORMS, vol. 4(2), pages 166-181, May.
    18. David P. Brown, 1987. "Multiperiod Financial Planning," Management Science, INFORMS, vol. 33(7), pages 848-875, July.
    19. Vigna, Elena & Haberman, Steven, 2001. "Optimal investment strategy for defined contribution pension schemes," Insurance: Mathematics and Economics, Elsevier, vol. 28(2), pages 233-262, April.
    20. Gabriel R. Bitran & Arnoldo C. Hax, 1981. "Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables," Management Science, INFORMS, vol. 27(4), pages 431-441, April.
    21. Steven T. Hackman & Loren K. Platzman, 1990. "Near-Optimal Solution of Generalized Resource Allocation Problems with Large Capacities," Operations Research, INFORMS, vol. 38(5), pages 902-910, October.
    22. Lewis, Craig M., 1990. "A Multiperiod Theory of Corporate Financial Policy under Taxation," Journal of Financial and Quantitative Analysis, Cambridge University Press, vol. 25(1), pages 25-43, March.
    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. Javiera Barrera & Eduardo Moreno & Sebastián Varas K., 2020. "A decomposition algorithm for computing income taxes with pass-through entities and its application to the Chilean case," Annals of Operations Research, Springer, vol. 286(1), pages 545-557, March.
    2. Kulp, Alison & Hartman, Joseph C., 2011. "Optimal tax depreciation with loss carry-forward and backward options," European Journal of Operational Research, Elsevier, vol. 208(2), pages 161-169, January.

    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. Patriksson, Michael, 2008. "A survey on the continuous nonlinear resource allocation problem," European Journal of Operational Research, Elsevier, vol. 185(1), pages 1-46, February.
    2. Patriksson, Michael & Strömberg, Christoffer, 2015. "Algorithms for the continuous nonlinear resource allocation problem—New implementations and numerical studies," European Journal of Operational Research, Elsevier, vol. 243(3), pages 703-722.
    3. Bretthauer, Kurt M. & Shetty, Bala, 2002. "The nonlinear knapsack problem - algorithms and applications," European Journal of Operational Research, Elsevier, vol. 138(3), pages 459-472, May.
    4. Zhang, Bin & Hua, Zhongsheng, 2008. "A unified method for a class of convex separable nonlinear knapsack problems," European Journal of Operational Research, Elsevier, vol. 191(1), pages 1-6, November.
    5. Kurt M. Bretthauer & Bala Shetty & Siddhartha Syam, 2003. "A specially structured nonlinear integer resource allocation problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(7), pages 770-792, October.
    6. De Waegenaere, A.M.B. & Wielhouwer, J.L., 2001. "A Partial Ranking Algorithm for Resource Allocation Problems," Other publications TiSEM 8b2e0185-36f9-43df-8a3d-d, Tilburg University, School of Economics and Management.
    7. Renato de Matta & Vernon Ning Hsu & Timothy J. Lowe, 1999. "The selection allocation problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(6), pages 707-725, September.
    8. Walter, Rico & Boysen, Nils & Scholl, Armin, 2013. "The discrete forward–reserve problem – Allocating space, selecting products, and area sizing in forward order picking," European Journal of Operational Research, Elsevier, vol. 229(3), pages 585-594.
    9. Bretthauer, Kurt M. & Ross, Anthony & Shetty, Bala, 1999. "Nonlinear integer programming for optimal allocation in stratified sampling," European Journal of Operational Research, Elsevier, vol. 116(3), pages 667-680, August.
    10. DePaolo, Concetta A. & Rader, David Jr., 2007. "A heuristic algorithm for a chance constrained stochastic program," European Journal of Operational Research, Elsevier, vol. 176(1), pages 27-45, January.
    11. De Waegenaere, A.M.B. & Wielhouwer, J.L., 2001. "A Partial Ranking Algorithm for Resource Allocation Problems," Discussion Paper 2001-40, Tilburg University, Center for Economic Research.
    12. Kameshwaran, S. & Narahari, Y., 2009. "Nonconvex piecewise linear knapsack problems," European Journal of Operational Research, Elsevier, vol. 192(1), pages 56-68, January.
    13. Hoto, R.S.V. & Matioli, L.C. & Santos, P.S.M., 2020. "A penalty algorithm for solving convex separable knapsack problems," Applied Mathematics and Computation, Elsevier, vol. 387(C).
    14. AgralI, Semra & Geunes, Joseph, 2009. "Solving knapsack problems with S-curve return functions," European Journal of Operational Research, Elsevier, vol. 193(2), pages 605-615, March.
    15. K. C. Kiwiel, 2008. "Variable Fixing Algorithms for the Continuous Quadratic Knapsack Problem," Journal of Optimization Theory and Applications, Springer, vol. 136(3), pages 445-458, March.
    16. Bajwa, Naeem & Sox, Charles R. & Ishfaq, Rafay, 2016. "Coordinating pricing and production decisions for multiple products," Omega, Elsevier, vol. 64(C), pages 86-101.
    17. Sanjiva Prasad & Christopher J. Green & Victor Murinde, 2005. "Company Financial Structure: A Survey and Implications for Developing Economies," Chapters, in: Christopher J. Green & Colin Kirkpatrick & Victor Murinde (ed.), Finance and Development, chapter 12, Edward Elgar Publishing.
    18. Dreyfuss, Michael & Giat, Yahel, 2017. "Optimal spares allocation to an exchangeable-item repair system with tolerable wait," European Journal of Operational Research, Elsevier, vol. 261(2), pages 584-594.
    19. repec:rim:rimwps:29-07 is not listed on IDEAS
    20. Syam, Siddhartha S., 1998. "A dual ascent method for the portfolio selection problem with multiple constraints and linked proposals," European Journal of Operational Research, Elsevier, vol. 108(1), pages 196-207, July.
    21. Sathaye, Nakul & Madanat, Samer, 2011. "A bottom-up solution for the multi-facility optimal pavement resurfacing problem," Transportation Research Part B: Methodological, Elsevier, vol. 45(7), pages 1004-1017, August.

    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:200:y:2010:i:1:p:268-280. 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.