Dimensioning and Allocation of the Financial Founds of the Company by Using Dynamic Programming
Dynamic Programming is a general algorithm design technique for solving problems defined by or formulated as recurrences with overlapping sub-instances. Dynamic programming is regarded as a particular approach to optimization problems in which a considerable number of decision variables and the objective function and functions that define the restrictions of the problem may have various shapes and properties.[1] Dynamic programming is a very powerful algorithmic paradigm in which a problem is solved by identifying a collection of subproblems and tackling them one by one, smallest first, using the answers to small problems to help figure out larger ones, until the whole lot of them is solved. In dynamic programming we are not given a dag; the dag is implicit
Year of publication: |
2014
|
---|---|
Authors: | Ramona, Sãlãgean Liana ; Iulia, Pantazi Paula |
Published in: |
Ovidius University Annals, Economic Sciences Series. - Facultatea de Ştiinţe Economice, ISSN 1582-9383. - Vol. XIV.2014, 1, p. 726-731
|
Publisher: |
Facultatea de Ştiinţe Economice |
Subject: | Dynamic Programming | Mathematical Models | Programming Model | Financial | Quantitative Methods |
Saved in:
freely available
Saved in favorites
Similar items by subject
-
ACT Now or Later: The Economics of Malaria Resistance
Laxminarayan, Ramanan, (2003)
-
Long Range Interaction Generating Fat-Tails in Finance
Airoldi, Marco, (2004)
-
Uzawa's Transformation and Optimal Control Problems With Variable Rates of Time Preference.
Francis, J., (1998)
- More ...