Necessary Conditions in Nonsmooth Optimization

Pages:159–189

Published Online:May 1, 1984

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

Minimum Convex Cost Dynamic Network Flows

Pages:190–207

Published Online:May 1, 1984

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

On The Marginal Function in Nonlinear Programming

Pages:208–221

Published Online:May 1, 1984

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

Duality and an Algorithm for a Class of Continuous Transportation Problems

Pages:222–231

Published Online:May 1, 1984

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

A Finite Method for the Solution of a Multi-Resource Allocation Problem with Concave Return Functions

Pages:232–243

Published Online:May 1, 1984

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

A Note on Approximation Schemes for Multidimensional Knapsack Problems

Pages:244–247

Published Online:May 1, 1984

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

Single Machine Scheduling with Precedence Constraints of Dimension 2

Pages:248–259

Published Online:May 1, 1984

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

A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors

Pages:260–266

Published Online:May 1, 1984

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

A Unifying Note on Fatou's Lemma in Several Dimensions

Pages:267–275

Published Online:May 1, 1984

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

Constrained Undiscounted Stochastic Dynamic Programming

Pages:276–289

Published Online:May 1, 1984

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

On Stationary Strategies in Countable State Total Reward Markov Decision Processes

Pages:290–300

Published Online:May 1, 1984

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

Dichotomous Search for Random Objects on an Interval

Pages:301–308

Published Online:May 1, 1984

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

On the Core and Dual Set of Linear Programming Games

Pages:309–316

Published Online:May 1, 1984

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

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.