Harvey J. Greenberg and William P. Pierskalla

A Review of Quasi-Convex Functions
OPERATIONS RESEARCH 1971 19: 1553-1570. [Abstract] [PDF]  

K. O. Kortanek and W. O. Rom

Classification Schemes for the Strong Duality of Linear Programming Over Cones
OPERATIONS RESEARCH 1971 19: 1571-1585. [Abstract] [PDF]  

George B. Kleindorfer

Bounding Distributions for a Stochastic Acyclic Network
OPERATIONS RESEARCH 1971 19: 1586-1601. [Abstract] [PDF]  

W. L. Wilkinson

An Algorithm for Universal Maximal Dynamic Flows in a Network
OPERATIONS RESEARCH 1971 19: 1602-1612. [Abstract] [PDF]  

H. Eldor and L. B. Koppel

A Generalized Approach to the Method of Steepest Ascent
OPERATIONS RESEARCH 1971 19: 1613-1618. [Abstract] [PDF]  

Timothy W. Ruefli

Decentralized Transshipment Networks
OPERATIONS RESEARCH 1971 19: 1619-1631. [Abstract] [PDF]  

Chaiho Kim

Parameterizing an Activity Vector in Linear Programming
OPERATIONS RESEARCH 1971 19: 1632-1646. [Abstract] [PDF]  

Lalitha Sanathanan

On an Allocation Problem with Multistage Constraints
OPERATIONS RESEARCH 1971 19: 1647-1663. [Abstract] [PDF]  

Hirohide Hinomoto

Sequential Control of Homogeneous Activities—Linear Programming of Semi-Markovian Decisions
OPERATIONS RESEARCH 1971 19: 1664-1674. [Abstract] [PDF]  

Ury Passy

Nonlinear Assignment Problems Treated by Geometric Programming
OPERATIONS RESEARCH 1971 19: 1675-1690. [Abstract] [PDF]  

Laurence A. Wolsey

Group-Theoretic Results in Mixed Integer Programming
OPERATIONS RESEARCH 1971 19: 1691-1697. [Abstract] [PDF]  

Tung Liang, Wen-yuan Huang, and Jaw-Kai Wang

Scheduling Bioproduction Harvest
OPERATIONS RESEARCH 1971 19: 1698-1707. [Abstract] [PDF]  

Thomas E. Morton

The Near-Myopic Nature of the Lagged-Proportional-Cost Inventory Problem with Lost Sales
OPERATIONS RESEARCH 1971 19: 1708-1716. [Abstract] [PDF]  

Howard Kunreuther

Production-Planning Algorithms for the Inventory-Overtime Tradeoff
OPERATIONS RESEARCH 1971 19: 1717-1729. [Abstract] [PDF]  

Campbell B. Read

Two Casualty-Estimation Problems Associated with Area Targets and the Circular Coverage Function
OPERATIONS RESEARCH 1971 19: 1730-1741. [Abstract] [PDF]  

R. R. Hocking and R. L. Shepard

Technical Note—Parametric Solution of a Class of Nonconvex Programs
OPERATIONS RESEARCH 1971 19: 1742-1747. [Abstract] [PDF]  

Robert S. Garfinkel

Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
OPERATIONS RESEARCH 1971 19: 1747-1751. [Abstract] [PDF]  

Maynard M. W. Chan

Technical Note—System Simulation and Maximum Entropy
OPERATIONS RESEARCH 1971 19: 1751-1753. [Abstract] [PDF]  

Jatinder N. D. Gupta

Technical Note—An Improved Combinatorial Algorithm for the Flowshop-Scheduling Problem
OPERATIONS RESEARCH 1971 19: 1753-1758. [Abstract] [PDF]  

J. W. Cohen

Technical Note—On a Formula Dual to Erlang's Loss Formula
OPERATIONS RESEARCH 1971 19: 1759-1760. [Abstract] [PDF]  

Alan Washburn

Technical Note—A Particular Two-Priority Queue
OPERATIONS RESEARCH 1971 19: 1760-1764. [Abstract] [PDF]  

George F. Brown, Jr. and Timothy M. Corcoran

Technical Note—A Comment on a Paper by Goodwin and Giese
OPERATIONS RESEARCH 1971 19: 1764-1765. [Abstract] [PDF]  

Mandell Bellmore and John C. Malone

Erratum
OPERATIONS RESEARCH 1971 19: 1766. [Abstract] [PDF]  

The Analyst's Bookshelf
OPERATIONS RESEARCH 1971 19: 1767-1769. [Abstract] [PDF]  

To see an article, click its [Full Text] or [PDF] link. To review many abstracts, check the boxes to the left of the titles you want, and click the 'Get All Checked Abstract(s)' button. To see one abstract at a time, click its [Abstract] link.