THE SOLUTION OF THE ALLOCATION PROBLEM USING DYNAMIC PROGRAMMING
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27360%2F14%3A86093331" target="_blank" >RIV/61989100:27360/14:86093331 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
THE SOLUTION OF THE ALLOCATION PROBLEM USING DYNAMIC PROGRAMMING
Original language description
One of the main problems companies have to solve is the distribution of resources among the potential beneficiaries. In many cases, this problem can be presented as a linear programming task with a linear objective function and constraining conditions. However, in some cases, the formulation of the problem as a mathematical programming task leads to integral or non-linear models requiring difficult or costly solution procedures. Dynamic programming offers a better way of dealing with these complex examples.The aim of the article is to show a suitable utilization of dynamic programming using an example of an allocation task.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
AE - Management, administration and clerical work
OECD FORD branch
—
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
METAL 2014: 23rd International Conference on Metallurgy and Materials: conference proceedings : May 21st-23rd 2014, hotel Voroněž I, Brno, Czech Republic, EU
ISBN
978-80-87294-54-3
ISSN
—
e-ISSN
—
Number of pages
5
Pages from-to
1790-1794
Publisher name
Tanger
Place of publication
Ostrava
Event location
Brno
Event date
May 21, 2014
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—