### Inner search methods for linear programming

Skip to main content (access key 's'),
Skip to navigation (access key 'n'),
Accessibility information (access key '0')

Back to Simple Search
# Advanced Search

The definition of the optimality of an algorithm is modified so that the optimal algorithm satisfies Bellman's principle. The search for a minimum using this technique is compared with J. Kiefer's algorithm

**Page 1**