Full-text resources of CEJSH and other databases are now available in the new Library of Science.
Visit https://bibliotekanauki.pl

Results found: 1

first rewind previous Page / 1 next fast forward last

Search results

Search:
in the keywords:  Dynamic Programming
help Sort By:

help Limit search:
first rewind previous Page / 1 next fast forward last
EN
Dynamic Goal Programming (DGP) represents an extension of Goal Programming (GP). It is characterized by the importance of time factor in relation to its variables. As a complex decision making problem, Menu Planning Problem (MPP) requires the development of methodologies which are able to combine different and conflicting goals incorporating the dynamic characteristics. The article reviews some of the studies and approaches used in MPP. It deals with the Standard GP model of MPP. It provides a DGP formulation for solving the MPP. An MPP for the hemodialysis (HD) patient is an application that best exemplifies the proposed dynamic formulation.
first rewind previous Page / 1 next fast forward last
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.