Dynamic programming using the Fritz-John conditions

DOI10.1016/S0377-2217(99)00088-0zbMath0961.90124MaRDI QIDQ1577116

Erich Steiner, K. I. M. McKinnon

Publication date: 30 August 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

dynamic programmingKuhn-Tucker conditionsFritz-John conditionsaction elimination

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Dynamic programming (90C39)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
• Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
• The Theory and Computation of Knapsack Functions
• Searching for the Multiplier in One-Constraint Optimization Problems

This page was built for publication: Dynamic programming using the Fritz-John conditions