Dynamic programming and the Lagrange multipliers

DOI10.1016/0022-247X(90)90122-VzbMath0712.90088MaRDI QIDQ749458

D. Kharzeev

Publication date: 1990

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

Lagrange multipliers

Mathematics Subject Classification ID

Dynamic programming (90C39) Numerical methods of relaxation type (49M20)

Related Items (1)

Dynamic programming and penalty functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamic programming and inequalities
• The art and theory of dynamic programming
• Functional equations in dynamic programming
• The principle and models of dynamic programming
• The principle and models of dynamic programming. IV
• The principle and models of dynamic programming. V
• The principle and models of dynamic programming. II
• The principle and models of dynamic programming. III
• Quasilinearization and invariant imbedding. With applications to chemical engineering and adaptive control
• An approach to nonlinear programming
• Composition Principles for Synthesis of Optimal Multistage Processes
• Contraction Mappings in the Theory Underlying Dynamic Programming
• Analytic Inequalities

This page was built for publication: Dynamic programming and the Lagrange multipliers