Affordable Access

Parametrization in nonserial dynamic programming

Authors
Publication Date
Disciplines
  • Computer Science
  • Mathematics

Abstract

Parametrization in nonserial dynamic programming REVUE FRANÇAISE D’AUTOMATIQUE, D’INFORMATIQUE ET DE RECHERCHE OPÉRATIONNELLE. RECHERCHE OPÉRATIONNELLE UMBERTOBERTELÈ FRANCESCOBRIOSCHI Parametrization in nonserial dynamic programming Revue française d’automatique, d’informatique et de recherche opérationnelle. Recherche opérationnelle, tome 5, noV2 (1971), p. 87-102. <http://www.numdam.org/item?id=RO_1971__5_2_87_0> © AFCET, 1971, tous droits réservés. L’accès aux archives de la revue « Revue française d’automatique, d’infor- matique et de recherche opérationnelle. Recherche opérationnelle » implique l’accord avec les conditions générales d’utilisation (http://www.numdam.org/ legal.php). Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impression de ce fi- chier doit contenir la présente mention de copyright. Article numérisé dans le cadre du programme Numérisation de documents anciens mathématiques http://www.numdam.org/ R.I.R.O. année, V-2, 1971, p. 87-102) PARAMETRIZATION IN NONSERIAL DYNAMIC PROGRAMMING (i) by Umberto BERTELÈ(2) and Francesco BRIOSCHI(2) Abstract. — New developments in the theory of nonserial dynamic programming art described in this paper, The new, more gênerai, décomposition technique which uses para- metrization allows, in gênerai, solving the given optimization problem with less computationi effort. Also interesting connections with graph theory are pointed out. 1. INTRODUCTION Nonserial dynamic programming is a new branch of mathematical pro- gramming. Essentially it exploits décomposition, as expressed by Bellman's principle of optimality, for breaking the optimization problem into many smaller subproblems and is concerned with finding a décomposition which is optimal from the point of view of the computing time and the memory requirements (secondary optimization problem). The solution of the secon- dary optimization problem nécessitâtes graph theoretical considérations.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

Contribution to nonserial dynamic programming

on Journal of Mathematical Analys... Jan 01, 1969

A theorem in nonserial dynamic programming

on Journal of Mathematical Analys... Jan 01, 1970

Nonserial dynamic programming formulations of sati...

on Information Processing Letters Jan 01, 1988
More articles like this..