Skip to main content

Capital Budgeting Problems: A Parameterized Point of View

  • Conference paper
  • First Online:
Operations Research Proceedings 2014

Part of the book series: Operations Research Proceedings ((ORP))

Abstract

A fundamental financial problem is budgeting. A firm is given a set of financial instruments \(X=\{x_1,\ldots ,x_n\}\) over a number of time periods T. Every instrument \(x_i\) has a return of \(r_i\) and for time period \(t=1,\ldots ,T\) a price of \(p_{t,i}\). Further for every time period t there is budget \(b_t\). The task is to choose a portfolio \(X'\) from X such that for every time period \(t=1,\ldots ,T\) the prices of the portfolio do not exceed the budget \(b_t\) and the return of the portfolio is maximized. We study the fixed-parameter tractability of the problem. For a lot of small parameter values we obtain efficient solutions for the capital budgeting problem. We also consider the connection to pseudo-polynomial algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Berlin (1999)

    Book  Google Scholar 

  2. Cai, L., Chen, J.: On fixed-parameter tractability and approximability of np optimization problems. J. Comput. Syst. Sci. 54, 465–474 (1997)

    Article  Google Scholar 

  3. Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Springer, New York (2013)

    Book  Google Scholar 

  4. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Berlin (2006)

    Google Scholar 

  5. Hromkovic, J.: Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics. Springer, Berlin (2004)

    Book  Google Scholar 

  6. Kannan, R.: Minkowski’s convex body theorem and integer programming. Math. Oper. Res. 12, 415–440 (1987)

    Article  Google Scholar 

  7. Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin (2010)

    Google Scholar 

  8. Šedová, J., Šeda, M.: A comparison of exact and heuristic approaches to capital budgeting. In: Proceedings of World Congress on Science, Engineering and Technology WCSET 2008, vol. 35, pp. 187–191 (2008)

    Google Scholar 

  9. Weingartner, H.M.: Capital budgeting of interrelated projects: survey and synthesis. Manage. Sci. 12(7), 485–516 (1966)

    Article  Google Scholar 

  10. Weingartner, H.M., Ness, D.N.: Methods for the solution of the multidimensional 0/1 knapsack problem. Oper. Res. 15(1), 83–103 (1967)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Frank Gurski .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Gurski, F., Rethmann, J., Yilmaz, E. (2016). Capital Budgeting Problems: A Parameterized Point of View. In: Lübbecke, M., Koster, A., Letmathe, P., Madlener, R., Peis, B., Walther, G. (eds) Operations Research Proceedings 2014. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-28697-6_29

Download citation

Publish with us

Policies and ethics