Abstract
Optimality problems in infinite horizon discrete time vector criterion Markov and semi-Markov decision processes can be expressed as standard problems of multiple objective linear programming. “VMDP” is a FORTRAN program for enumerating the objective function coefficients and constraint coefficients in these problems and finding all nondominated extreme points, i.e. all nondominated pure stationary strategies, and all nondominated edges. Using VMDP, computational experiments are presented. The characteristics of Markov and semi-Markov decision problems (the VMDP code) with those of general muitiple objective linear programming problems (the Steuer Adbase code) are compared.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
