Abstract
A general separable class of stochastic multiobjective optimization problems with perfect state information is considered. A generating approach using a stochastic multiobjective dynamic programming method is developed to find the set of non-inferior solutions. The results reveal the variation of the optimal weighting coefficient vector along a non-inferior trajectory. Non-separability is not an inherent property of dynamic programming. A general class of non-separable dynamic problems can be transformed into corresponding separable multiobjective dynamic programming problems. Multiobjective dynamic programming is shown to be a separation strategy to solve non-separable dynamic programming.
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.
