Premium
Multiobjective dynamic programing: A classic problem redressed
Author(s) -
Tauxe George W.,
Inman Robert R.,
Mades Dean M.
Publication year - 1979
Publication title -
water resources research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.863
H-Index - 217
eISSN - 1944-7973
pISSN - 0043-1397
DOI - 10.1029/wr015i006p01398
Subject(s) - mathematical optimization , set (abstract data type) , task (project management) , multi objective optimization , dynamic programming , decision maker , mathematics , solution set , product (mathematics) , computer science , operations research , geometry , management , economics , programming language
The problem of noncommensurable multiple‐objective functions in water resources and potential methods for solving such multiobjective problems are discussed. A new method, namely, multiobjective dynamic programing (MODP), that borrows from conventional dynamic programing is developed. It generates the entire noninferior solution set of the multiobjective problem, and it can be used to generate the trade‐off ratios between objectives. The trade‐off ratios are actually a by‐product of the MODP method and are available explicitly between all objectives. The noninferior solution set is obtained solely in terms of the objectives rather than in terms of the individual decisions that influence each objective, thus facilitating the decision maker's task in choosing the preferred solution. The Reid‐Vemuri multi‐objective problem in water resources was chosen as an example and was successfully solved using MODP.