IDEAS home Printed from https://ideas.repec.org/a/ovi/oviste/vxivy2014i1p726-731.html
   My bibliography  Save this article

Dimensioning and Allocation of the Financial Founds of the Company by Using Dynamic Programming

Author

Listed:
  • Sãlãgean Liana Ramona

    („George Bariþiu” University of Braºov, Faculty of Economic Studies)

  • Pantazi Paula Iulia

    („George Bariþiu” University of Braºov, Faculty of Economic Studies)

Abstract

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

Suggested Citation

  • Sãlãgean Liana Ramona & Pantazi Paula Iulia, 2014. "Dimensioning and Allocation of the Financial Founds of the Company by Using Dynamic Programming," Ovidius University Annals, Economic Sciences Series, Ovidius University of Constantza, Faculty of Economic Sciences, vol. 0(1), pages 726-731, May.
    • Handle: RePEc:ovi:oviste:v:xiv:y:2014:i:1:p:726-731
    as

    Download full text from publisher

    File URL: http://stec.univ-ovidius.ro/html/anale/RO/cuprins%20rezumate/volum2014p1.pdf
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    Dynamic Programming; Mathematical Models; Programming Model; Financial; Quantitative Methods.;
    All these keywords.

    JEL classification:

    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ovi:oviste:v:xiv:y:2014:i:1:p:726-731. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Gheorghiu Gabriela (email available below). General contact details of provider: https://edirc.repec.org/data/feoviro.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.