A Graphical Approach to Solve an Investment Optimization Problem

  • Evgeny R. Gafarov
  • Alexandre DolguiEmail author
  • Alexander A. Lazarev
  • Frank Werner


We consider a project investment problem, where a set of projects and an overall budget are given. For each project, a piecewise linear profit function is known which describes the profit obtained if a specific amount is invested into this project. The objective is to determine the amount invested into each project such that the overall budget is not exceeded and the total profit is maximized. For this problem, a graphical algorithm (GrA) is presented which is based on the same Bellman equations as the best known dynamic programming algorithm (DPA) but the GrA has several advantages in comparison with the DPA. Based on this GrA, a fully-polynomial time approximation scheme is proposed having the best known running time. The idea of the GrA presented can also be used to solve some similar scheduling or lot-sizing problems in a more effective way, e.g., the related problem of finding lot-sizes and sequencing several products on a single imperfect machine.


Project investment Graphical algorithm Pseudo-polynomial time complexity FPTAS 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Lazarev, A.A., Werner, F.: A graphical realization of the dynamic programming method for solving NP-hard problems. Comput. Math. Appl. 58(4), 619–631 (2009)CrossRefMathSciNetzbMATHGoogle Scholar
  2. 2.
    Gafarov, E.R., Dolgui, A., Werner, F.: Dynamic programming approach to design FPTAS for single machine scheduling problems. Research Report LIMOS UMR CNRS 6158 (2012)Google Scholar
  3. 3.
    Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer-Verlag, Berlin (2004)CrossRefzbMATHGoogle Scholar
  4. 4.
    Shaw, D.X., Wagelmans, A.P.M.: An algorithm for single-item capacitated economic lot sizing with piecewise linear production costs and general holding costs. Manag. Sci. 44(6), 831–838 (1998)CrossRefzbMATHGoogle Scholar
  5. 5.
    Kameshwaran, S., Narahari, Y.: Nonconvex piecewise linear knapsack problems. Eur. J. Oper. Res. 192, 56–68 (2009)CrossRefMathSciNetzbMATHGoogle Scholar
  6. 6.
    Chubanov, S., Kovalyov, M.Y., Pesch, E.: An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure. Math. Program. Ser. A 106, 453–466 (2006)CrossRefMathSciNetzbMATHGoogle Scholar
  7. 7.
    Dolgui, A., Kovalyov, M.Y., Shchamialiova, K.: Multi-product lot-sizing and sequencing on a single imperfect machine. Comput. Optim. Appl. 50, 465–482 (2011)CrossRefMathSciNetzbMATHGoogle Scholar
  8. 8.
    Schmeleva, K., Delorme, X., Dolgui, A., Grimaud, F., Kovalyov, M.Y.: Lot-sizing on a single machine, ILP models. Comput. Ind. Eng. 65, 561–569 (2013)CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2014

Authors and Affiliations

  • Evgeny R. Gafarov
    • 1
    • 2
  • Alexandre Dolgui
    • 1
    Email author
  • Alexander A. Lazarev
    • 2
    • 3
    • 4
    • 5
  • Frank Werner
    • 6
  1. 1.Ecole Nationale Superieure des Mines, FAYOL-EMSE, CNRS:UMR6158, LIMOSSaint-EtienneFrance
  2. 2.Institute of Control Sciences of the Russian Academy of SciencesMoscowRussia
  3. 3.Higher School of Economics (National Research University)MoscowRussia
  4. 4.Lomonosov Moscow State UniversityMoscowRussia
  5. 5.Moscow Institute of Physics and Technology (State University)MoscowRussia
  6. 6.Fakultät fu̇r MathematikOtto-von-Guericke-Universität MagdeburgMagdeburgGermany

Personalised recommendations