Journal article
PARETO OPTIMAL SERIAL DYNAMIC PROGRAMMING
Engineering optimization, v 6(4), pp 177-183
01 Jan 1983
Abstract
A method for generating the Pareto optimal set, or an approximation to it for multi-criteria (multi-objective) problems capable of being formulated as serial stage-state discrete dynamic programs, is presented. It is shown that this set may be produced by using Pareto optimality as the optimization selection mechanism in dynamic programming, Worked examples are presented.
Metrics
1 Record Views
Details
- Title
- PARETO OPTIMAL SERIAL DYNAMIC PROGRAMMING
- Creators
- M. A. Rosenman - The University of SydneyJ. S. Gero - The University of Sydney
- Publication Details
- Engineering optimization, v 6(4), pp 177-183
- Publisher
- Taylor & Francis Group
- Number of pages
- 7
- Resource Type
- Journal article
- Language
- English
- Academic Unit
- Psychological and Brain Sciences (Psychology)
- Web of Science ID
- WOS:A1983RB46000001
- Scopus ID
- 2-s2.0-0020782241
- Other Identifier
- 991022203051304721