Research Article

Self-Scaled Barriers and Interior-Point Methods for Convex Programming

Pages:1–42

Published Online:February 1, 1997

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

Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming

Pages:43–62

Published Online:February 1, 1997

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

On Vaidya's Volumetric Cutting Plane Method for Convex Programming

Pages:63–89

Published Online:February 1, 1997

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

Scaling Methods for Finding a Maximum Free Multiflow of Minimum Cost

Pages:90–109

Published Online:February 1, 1997

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

The Circuit Polytope: Facets

Pages:110–145

Published Online:February 1, 1997

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

Complexity of the Minimum Base Game on Matroids

Pages:146–164

Published Online:February 1, 1997

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

On the Existence of Subjective Upper and Lower Probabilities

Pages:165–185

Published Online:February 1, 1997

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

Corrected Diffusion Approximations for a Multistage Production-Inventory System

Pages:186–201

Published Online:February 1, 1997

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

A Robust Control Framework for Option Pricing

Pages:202–221

Published Online:February 1, 1997

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

Optimal Adaptive Policies for Markov Decision Processes

Pages:222–255

Published Online:February 1, 1997

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

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.