×

Optimal resource allocation with minimum activation levels and fixed costs. (English) Zbl 1161.91423

Summary: We intend to analyze a problem of optimal resource allocation with both minimum and maximum activation levels and fixed costs. The problem is shown to be NP-hard. We study the consequent MILP problem and propose a dynamic programming algorithm which exploits an efficient pruning procedure. We present an application to a portfolio optimization problem in project financing. A project financing firm partially funds different projects, using external funding sources for the partial coverage of the financial requirements of each project.

MSC:

91B32 Resource and cost allocation (including fair division, apportionment, etc.)
90C11 Mixed integer programming
Full Text: DOI

References:

[1] Garey, M. R.; Johnson, D. S., Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman: Freeman San Francisco · Zbl 0411.68039
[2] Heidenberger, K., Dynamic project selection and funding under risk: A decision tree based MILP approach, European Journal of Operational Research, 95, 284-298 (1996) · Zbl 0943.90586
[3] Martello, S.; Toth, P., Knapsack Problems: Algorithms and Computer Implementations (1990), Wiley: Wiley Chichester · Zbl 0708.68002
[4] Myers S. C., Interactions of corporate financing and investment decisions – implications for capital budgeting, Journal of Finance, 29, 1-25 (1974)
[5] Papadimitriou, C. H.; Steiglitz, K., Combinatorial Optimization: Algorithms and Complexity (1982), Prentice-Hall: Prentice-Hall Englewood Cliffs, NJ · Zbl 0503.90060
[6] Peccati, L., 1989. Multiperiod analysis of a levered portfolio. Rivista di matematica per le scienze economiche e sociali 12 (1). In: Spronk, J., Matarazzo, B. (Eds.), Modelling for Financial Decisions, Springer, Berlin, 1991 (reprint); Peccati, L., 1989. Multiperiod analysis of a levered portfolio. Rivista di matematica per le scienze economiche e sociali 12 (1). In: Spronk, J., Matarazzo, B. (Eds.), Modelling for Financial Decisions, Springer, Berlin, 1991 (reprint)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.