scientific article; zbMATH DE number 1431652

MaRDI QIDQ4948612zbMATH OpenFDO

Authors F. L. Chernous'ko

Publication date 13 April 2000

Mathematics Subject Classification ID

Mathematics for nonmathematicians (engineering, social sciences, etc.) (00A06) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Dynamic programming (90C39)

Review text

The article presents an elementary introduction to dynamic programming. The author describes a control process with discrete time, formulates the control problem for it, presents an elementary approach to this problem, discusses the Bellman optimal principle and basic ideas of dynamic programming. An example is considered and numerical complexity of the method of dynamic programming is discussed. The paper is based on a lecture given by the author for secondary school teachers in the framework of the ``International Soros Science Educational Program and is aimed at presenting contemporary developments in mathematics on an elementary level understandable for secondary school teachers and pupils.

Recommendations

• scientific article; zbMATH DE number 1260458
• scientific article; zbMATH DE number 53073
• Dynamic programming
• scientific article; zbMATH DE number 5866260
• scientific article; zbMATH DE number 3174053
• Computational aspects of dynamic programming
• Dynamic programming and inequalities
• scientific article; zbMATH DE number 3871062
• scientific article; zbMATH DE number 3207728
• scientific article; zbMATH DE number 1448986

Cited in

(36)

• Dynamic programming on linear pipelines
• From dynamic programming to bynamic programming
• The complexity of dynamic programming
• Dynamic programming on the word RAM
• Associative dynamic programs
• Two dynamic programming algorithms for which interpreted pebbling helps
• Dynamic programming on a directed graph
• Primitive dynamic programming
• Dynamic programming
• scientific article; zbMATH DE number 3871062 (Why is no real title available?)
• scientific article; zbMATH DE number 5152598 (Why is no real title available?)
• scientific article; zbMATH DE number 5520408 (Why is no real title available?)
• scientific article; zbMATH DE number 3923537 (Why is no real title available?)
• scientific article; zbMATH DE number 3945826 (Why is no real title available?)
• scientific article; zbMATH DE number 4010246 (Why is no real title available?)
• Aggregation in Dynamic Programming
• scientific article; zbMATH DE number 49715 (Why is no real title available?)
• scientific article; zbMATH DE number 1285381 (Why is no real title available?)
• scientific article; zbMATH DE number 1328951 (Why is no real title available?)
• scientific article; zbMATH DE number 617942 (Why is no real title available?)
• Secondary log breakdown optimization with dynamic programming
• scientific article; zbMATH DE number 6931762 (Why is no real title available?)
• scientific article; zbMATH DE number 2162204 (Why is no real title available?)
• scientific article; zbMATH DE number 792786 (Why is no real title available?)
• Dynamic Programming
• scientific article; zbMATH DE number 3207728 (Why is no real title available?)
• Discounted Dynamic Programming
• A stronger model of dynamic programming algorithms
• Dynamic programming in control
• scientific article; zbMATH DE number 3314888 (Why is no real title available?)
• Dynamic Programming and Decision Theory
• Dynamic programming with ordered structures: Theory, examples and applications
• Dynamic programming and inequalities
• Dynamic programming and the Lagrange multipliers
• Ratio dynamic programs
• Dynamic programming and the secretary problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4948612)