Abstract
Fundamental dynamic programming recursive equations are extended to the multicriteria framework. In particular, a more detailed procedure for a general recursive solution scheme for the multicriteria discrete mathematical programming problem is developed. Definitions of lower and upper bounds are offered for the multicriteria case and are incorporated into the recursive equations to aid problem solution by eliminating inefficient subpolicies. Computational results are reported for a set of 0-1 integer linear programming problems. © 1982 Plenum Publishing Corporation.
Original language | English |
---|---|
Pages (from-to) | 43-69 |
Number of pages | 27 |
Journal | Journal of Optimization Theory and Applications |
DOIs | |
Publication status | Published - 1 Sept 1982 |
Externally published | Yes |