Research Article

On a Representation of the Matching Polytope Via Semidefinite Liftings

Pages:1–7

Published Online:February 1, 1999

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

State Dependent Expected Utility for Savage's State Space

Pages:8–34

Published Online:February 1, 1999

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

Small Min-Cut Polyhedra

Pages:35–49

Published Online:February 1, 1999

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

Convergence of a Class of Inexact Interior-Point Algorithms for Linear Programs

Pages:50–71

Published Online:February 1, 1999

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

Superlinear Convergence of an Algorithm for Monotone Linear Complementarity Problems, When No Strictly Complementary Solution Exists

Pages:72–94

Published Online:February 1, 1999

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

M-Convex Function on Generalized Polymatroid

Pages:95–105

Published Online:February 1, 1999

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

Minimum-Aggregate-Concave-Cost Multicommodity Flows in Strong-Series-Parallel Networks

Pages:106–129

Published Online:February 1, 1999

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

Separating Maximally Violated Comb Inequalities in Planar Graphs

Pages:130–148

Published Online:February 1, 1999

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

Primal-Dual Affine-Scaling Algorithms Fail for Semidefinite Programming

Pages:149–175

Published Online:February 1, 1999

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

Probabilistic Analysis of an Infeasible-Interior-Point Algorithm for Linear Programming

Pages:176–192

Published Online:February 1, 1999

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

Ellipsoidal Approximations of Convex Sets Based on the Volumetric Barrier

Pages:193–203

Published Online:February 1, 1999

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

Repeated Games with Incomplete Information on One Side: The Case of Different Discount Factors

Pages:204–218

Published Online:February 1, 1999

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

Solutions to Affine Generalized Equations Using Proximal Mappings

Pages:219–236

Published Online:February 1, 1999

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

The Efficiency of Ballstep Subgradient Level Methods for Convex Optimization

Pages:237–254

Published Online:February 1, 1999

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

Weak Univalence and Connectedness of Inverse Images of Continuous Functions

Pages:255–261

Published Online:February 1, 1999

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

Erratum

Free Access
Erratum: The Travelling Salesman and the PQ-Tree

Pages:262–272

Published Online:February 1, 1999

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

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.