A Graphical Approach to Solve an Investment Optimization Problem

Abstract : We consider a Project Investment problem, where a set of projects and an overall budget are given. For each project, a profit function is known which describes the profit obtained if a specific amount is invested in this project. The objective is to determine the amount invested in each project such that the overall budget is not exceeded and the total profit is maximized. For this problem, we suggest an effective graphical algorithm which improves the pseudo-polynomial time complexity of dynamic programming algorithms. Based on this graphical algorithm, we also derive a fully polynomial time approximation scheme. In addition, we also consider the related problem of finding lot-sizes and sequencing several products on a single imperfect machine.
Type de document :
Rapport
2012
Liste complète des métadonnées

https://hal-emse.ccsd.cnrs.fr/emse-00904098
Contributeur : Florent Breuil <>
Soumis le : mercredi 13 novembre 2013 - 16:57:58
Dernière modification le : mardi 23 octobre 2018 - 14:36:10

Identifiants

  • HAL Id : emse-00904098, version 1

Citation

Evgeny R. Gafarov, Alexander Lazarev, Alexandre Dolgui, Frank Werner. A Graphical Approach to Solve an Investment Optimization Problem. 2012. 〈emse-00904098〉

Partager

Métriques

Consultations de la notice

163