Knowledge that Transforms

To make high-quality research more accessible and easier to explore.

Fields:
150 results ✕ Clear filters

Errata

Operations Research 1971
Corrections to the authors' paper “The Bounding Hyperplane Method of Linear Programming,” Operations Research 19, 1–18 (1971).

The Analyst's Bookshelf

Operations Research 1971 open access
Book Reviews —Karl Hinderer, Foundations of Non-Stationary Dynamic Programming with Discrete Time Parameter, Springer-Verlag, New York, N.Y., 1970, 160 pages, $4.40 (paper)—reviewed by P. H. Randolph; —B. W. Lindgren, Elements of Decision Theory, Macmillan, New York, N.Y., 1971, 292 pages, $8.95—reviewed by Abraham Engelberg.

The Analyst's Bookshelf

Operations Research 1971 open access
Book Reviews —Robin Farquharson, The Theory of Voting, Yale University Press, New Haven, Connecticut, 1969, 90 pages, $5.00—reviewed by Max A. Woodbury; —D. R. Cox, Analysis of Binary Data, Methuen and Company, London, England, 1970, 142 pages, $6.50—reviewed by George H. Weiss; —Karl Seiler, III, Introduction to Systems Cost-Effectiveness, Wiley-Interscience (Publications in O.R. Series, No. 17), New York, N.Y., 1969, 108 pages, $9.95—reviewed by A. J. Goldman; —M. M. Botvinnik, Computers, Chess, and Long Range Planning, Springer-Verlag, New York, N. Y., 1970, 89 pages, $3.50 (paper)—reviewed by Hans Berliner.

The Analyst's Bookshelf

Operations Research 1971
Book Reviews —Peter Haggett and Richard J. Chorley, Network Analysis in Geography, St. Martin's Press, New York, N.Y., 1969, 360 pages, $9.00—reviewed by Linus Schrage; —Salah E. Elmaghraby, Some Network Models in Management Science, Springer-Verlag, New York, N.Y., 1970, 176 pages, $4.40 (paper)—reviewed by Bernard Yaged; —G. Cullman, Recherche Opérationelle—Théorie et Pratique, Masson & Cie, Paris, France, 1970, 244 pages, 80 French francs (paper)—reviewed by Marcel F. Neuts; —George E. P. Box and Gwilyn M. Jenkins, Time Series Analysis: Forecasting and Control, Holden-Day Company, San Francisco, California, 1970, 553 pages, $24.00—reviewed by Stuart Jay Deutsch; —Joseph F. Kelly, Computerized Management Information System, The Macmillan Co., New York, N.Y., 1970, 533 pages, $10.95—reviewed by Alfred L. Kahl, Jr.

The Analyst's Bookshelf

Operations Research 1971 open access
Book Reviews —A. Battersby, Network Analysis for Planning and Scheduling, Third Edition, John Wiley & Sons, Inc., New York, N.Y., 1970, $10.50—reviewed by Thomas L. Saaty; —Ambar G. Rao, Quantitative Theories in Advertising, John Wiley & Sons, New York, N.Y., 1970, 103 pages, $10.95—reviewed by Marshall Freimer; —Jati K. Sengupta and Karl A. Fox, Economic Analysis and Operations Research: Optimization Techniques in Quantitative Economic Models, North-Holland Publishing Company, Amsterdam, 1969, 478 pages, $22.50—reviewed by Nancy Schwartz; —Leon S. Lasdon, Optimization Theory for Large Systems, Macmillan Co., New York, N.Y., 1970, 523 pages, $14.95—reviewed by A. M. Geoffrion.

The Analyst's Bookshelf

Operations Research 1971 open access
Book Reviews —Arthur I. Siegel and J. Jay Wolf, Man-Machine Simulation Models—Psychosocial and Performance Interaction, John Wiley & Sons, New York, N.Y., 1969, 175 pages, $9.95—reviewed by Richard E. Nance; —Leon Cooper and David Steinberg, Introduction to Methods of Optimization, W. B. Saunder Co., Philadelphia, Pa., 1970, 381 pages, $12.50—reviewed by Arunachalam Ravindran; —A. O. Converse, Optimization, Holt, Rinehart, and Winston, New York, N.Y., 1970, 295 pages, $13.25—reviewed by Harvey J. Greenberg; —John G. Rau, Optimization and Probability in Systems Engineering, Van Nostrand Reinhold Company, New York, N.Y., 1970, 414 pages, $15.00—reviewed by U. Narayan Bhat.

A Generalized Approach to the Method of Steepest Ascent

Operations Research 1971
This paper derives a general steepest-ascent expression to show that any “direction” in the function space can be considered to be a steepest ascent direction by selecting a proper distance metric index and/or variable scaling. Several search procedures can be thus considered to be special cases of the method of steepest ascent. An illustrative investigation shows that, in a qualitative sense, most metric indices perform comparably.