The Bounding Hyperplane Method of Linear Programming

Pages:1–18

Published Online:February 1, 1971

https://doi.org/10.1287/opre.19.1.1

Intersection Cuts—A New Type of Cutting Planes for Integer Programming

Pages:19–39

Published Online:February 1, 1971

https://doi.org/10.1287/opre.19.1.19

An Intersection Cut from the Dual of the Unit Hypercube

Pages:40–44

Published Online:February 1, 1971

https://doi.org/10.1287/opre.19.1.40

Dynamic Linear Programs for Production Scheduling

Pages:45–56

Published Online:February 1, 1971

https://doi.org/10.1287/opre.19.1.45

A Class of Fractional Programming Problems

Pages:57–67

Published Online:February 1, 1971

https://doi.org/10.1287/opre.19.1.57

Generalized Lagrange Multipliers in Integer Programming

Pages:68–76

Published Online:February 1, 1971

https://doi.org/10.1287/opre.19.1.68

Optimality Criteria in Nonlinear Programming Without Differentiability

Pages:77–86

Published Online:February 1, 1971

https://doi.org/10.1287/opre.19.1.77

Quadratic Programming with a Quasiconvex Objective Function

Pages:87–97

Published Online:February 1, 1971

https://doi.org/10.1287/opre.19.1.87

Vector-Valued Criteria in Geometric Programming

Pages:98–104

Published Online:February 1, 1971

https://doi.org/10.1287/opre.19.1.98

On the Objective Function for the Sequential P-Model of Chance-Constrained Programming

Pages:105–114

Published Online:February 1, 1971

https://doi.org/10.1287/opre.19.1.105

Free Access
Technical Note—A Flexible Tree-Search Method for Integer Programming Problems

Pages:115–119

Published Online:February 1, 1971

https://doi.org/10.1287/opre.19.1.115

Free Access
Technical Note—“Linear” Programming with Absolute-Value Functionals

Pages:120–124

Published Online:February 1, 1971

https://doi.org/10.1287/opre.19.1.120

Free Access
Technical Note—The Optimal Location of New Facilities Using Rectangular Distances

Pages:124–130

Published Online:February 1, 1971

https://doi.org/10.1287/opre.19.1.124

Free Access
Technical Note—An Integer Approach to Modular Design

Pages:130–134

Published Online:February 1, 1971

https://doi.org/10.1287/opre.19.1.130

A Computer-Based System for Forming Efficient Election Districts

Pages:135–155

Published Online:February 1, 1971

https://doi.org/10.1287/opre.19.1.135

The One-Terminal TELPAK Problem

Pages:156–169

Published Online:February 1, 1971

https://doi.org/10.1287/opre.19.1.156

A Single-Shot Noisy Duel with Detection Uncertainty

Pages:170–181

Published Online:February 1, 1971

https://doi.org/10.1287/opre.19.1.170

A Model for Allocating Interceptors from Overlapping Batteries: A Method of Dynamic Programming

Pages:182–193

Published Online:February 1, 1971

https://doi.org/10.1287/opre.19.1.182

An Optimal Rejection Time for an M/G/1 Queuing System

Pages:194–207

Published Online:February 1, 1971

https://doi.org/10.1287/opre.19.1.194

Characterization and Computation of Optimal Policies for Operating an M/G/1 Queuing System with Removable Server

Pages:208–218

Published Online:February 1, 1971

https://doi.org/10.1287/opre.19.1.208

The Remaining Busy Period of a Finite Queue

Pages:219–223

Published Online:February 1, 1971

https://doi.org/10.1287/opre.19.1.219

Free Access
Technical Note—A Taxonomy for Operations Research

Pages:224–234

Published Online:February 1, 1971

https://doi.org/10.1287/opre.19.1.224

Free Access
Technical Note—An Algorithm to Find Elementary Negative-Cost Circuits with a Given Number of Arcs—The Traveling-Salesman Problem

Pages:234–237

Published Online:February 1, 1971

https://doi.org/10.1287/opre.19.1.234

Free Access
Technical Note—Minimizing a Function of Permutations of n Integers

Pages:237–240

Published Online:February 1, 1971

https://doi.org/10.1287/opre.19.1.237

Free Access
Technical Note—Bounds on the Gain of a Markov Decision Process

Pages:240–244

Published Online:February 1, 1971

https://doi.org/10.1287/opre.19.1.240

Free Access
Technical Note—On the Asymptotic Convergence Rate of Cost Differences for Markovian Decision Processes

Pages:244–248

Published Online:February 1, 1971

https://doi.org/10.1287/opre.19.1.244

Free Access
The Analyst's Bookshelf

Pages:250–252

Published Online:February 1, 1971

https://doi.org/10.1287/opre.19.1.250

Free Access
Books Received

Pages:253–254

Published Online:February 1, 1971

https://doi.org/10.1287/opre.19.1.253

Free Access
Notes

Pages:254–254

Published Online:February 1, 1971

https://doi.org/10.1287/opre.19.1.254

Free Access
Announcement

Pages:256–256

Published Online:February 1, 1971

https://doi.org/10.1287/opre.19.1.256

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.