Determining All Solutions to Certain Systems of Nonlinear Equations

Pages:1–14

Published Online:February 1, 1979

https://doi.org/10.1287/moor.4.1.1

Universally Measurable Policies in Dynamic Programming

Pages:15–30

Published Online:February 1, 1979

https://doi.org/10.1287/moor.4.1.15

Quotatone Apportionment Methods

Pages:31–38

Published Online:February 1, 1979

https://doi.org/10.1287/moor.4.1.31

A Strongly Convergent Primal Simplex Algorithm for Generalized Networks

Pages:39–59

Published Online:February 1, 1979

https://doi.org/10.1287/moor.4.1.39

On the Convergence of Policy Iteration in Stationary Dynamic Programming

Pages:60–69

Published Online:February 1, 1979

https://doi.org/10.1287/moor.4.1.60

Semi-Regenerative Processes with Unbounded Rewards

Pages:70–78

Published Online:February 1, 1979

https://doi.org/10.1287/moor.4.1.70

Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces

Pages:79–97

Published Online:February 1, 1979

https://doi.org/10.1287/moor.4.1.79

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.