Skip to main content
Log in

New approach for nonseparable dynamic programming problems

  • Contributed Papers
  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

A general class of nonseparable dynamic problems is studied in a dynamic programming framework by introducingkth-order separability. The solution approach uses multiobjective dynamic programming as a separation strategy forkth-order separable dynamic problems. The theoretical grounding on which the optimal solution of the original nonseparable dynamic problem can be attained by a noninferior solution of the corresponding multiobjective dynamic programming problem is established. The relationship between the overall optimal Lagrangian multipliers and the stage-optimal Lagrangian multipliers and the relationship between the overall weighting vector and the stage weighting vector are explored, providing the basis for identifying the optimal solution of the original nonseparable problem from among the set of noninferior solutions generated by the envelope approach.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bellman, R.,Adaptive Control Process: A Guided Tour, Princeton University Press, Princeton, New Jersey, 1961.

    Google Scholar 

  2. Geoffrion, A. M.,Solving Bicriterion Mathematical Problems, Operations Research, Vol. 15, pp. 39–54, 1967.

    Google Scholar 

  3. Henig, M. I.,The Shortest Path Problem with Two Objective Functions, European Journal of Operational Research, Vol. 25, pp. 281–291, 1985.

    Google Scholar 

  4. Sniedovich, M.,A Class of Nonseparable Dynamic Programming Problems, Journal of Optimization Theory and Applications, Vol. 52, pp. 111–121, 1987.

    Google Scholar 

  5. Li, D., andHaimes, Y. Y.,The Envelope Approach for Multiobjective Optimization Problems, IEEE Transactions on Systems, Man, and Cybernetics, Vol. SMC-17, pp. 1026–1038, 1987.

    Google Scholar 

  6. Li, D., andHaimes, Y. Y.,Decomposition Technique in Multiobjective Discrete-Time Dynamic Problems, Control and Dynamic Systems, Edited by C. T. Leondes, Academic Press, San Diego, California, Vol. 28, pp. 109–180, 1988.

    Google Scholar 

  7. Chankong, V., andHaimes, Y. Y.,Multiobjective Decision Making: Theory and Methodology, Elsevier-North Holland, New York, New York, 1983.

    Google Scholar 

  8. Haimes, Y. Y., Lasdon, L. S., andWismer, D. A.,On the Bicriterion Formulation of the Integrated System Identification and Systems Optimization, IEEE Transactions on Systems, Man and Cybernetics, Vol. SMC-1, 296–297, 1971.

    Google Scholar 

  9. Luenberger, D. G.,Introduction to Linear and Nonlinear Programming, Addison-Wesley, Reading, Massachusetts, 1973.

    Google Scholar 

  10. Reid, R. W., andVemuri, V.,On the Noninferior Index Approach to Large-Scale Multicriteria Systems, Journal of the Franklin Institute, Vol. 291, pp. 241–254, 1971.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by C. T. Leondes

This work was supported in part by NSF Grant No. CES-86-17984. The authors appreciate the comments from Dr. V. Chankong and the editorial work by Mrs. V. Benade and Dr. S. Hitchcock.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, D., Haimes, Y.Y. New approach for nonseparable dynamic programming problems. J Optim Theory Appl 64, 311–330 (1990). https://doi.org/10.1007/BF00939451

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00939451

Key Words

Navigation