Research Article

A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension

Pages:191–214

Published Online:May 1, 1990

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

Optimal Control of a Two-Station Brownian Network

Pages:215–242

Published Online:May 1, 1990

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

On Some Classes of Linear Complementarity Problems with Matrices of Order n and Rank (n − 1)

Pages:243–257

Published Online:May 1, 1990

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

Packing, Covering and Partitioning Problems with Strongly Unimodular Constraint Matrices

Pages:258–267

Published Online:May 1, 1990

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

A Class of Euclidean Routing Problems with General Route Cost Functions

Pages:268–285

Published Online:May 1, 1990

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

Sensitivity Analysis for Nonlinear Programs and Variational Inequalities with Nonunique Multipliers

Pages:286–298

Published Online:May 1, 1990

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

Higher-Order and Average Reward Myopic-Affine Dynamic Models

Pages:299–310

Published Online:May 1, 1990

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

Newton's Method for B-Differentiable Equations

Pages:311–341

Published Online:May 1, 1990

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

An Algorithm for Convex Quadratic Programming That Requires O(n3.5L) Arithmetic Operations

Pages:342–363

Published Online:May 1, 1990

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

The Shapes of Polyhedra

Pages:364–380

Published Online:May 1, 1990

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

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.