bluuebunny/crossref_metadata_2025 huggingface dataset:
Letter to the Editor—A Monte Carlo Method for the Approximate Solution of Certain Types of Constrained Optimization Problems
Authors: Pincus Martin
Published: November 2008

This paper considers the problem of minimizing a function F(x1, …, xn) over a closed, bounded region S in n-dimensional space under the assumption that there exists a unique minimizing point (z1, …, zn)ϵS. In a previous paper I represented the coordinates of the minimizing point as the limit of a ratio of integrals. The same type of ratio appears, in a different context, in statistical mechanics where a Monte Carlo method has been developed, by Metropolis et al., for its numerical evaluation. The purpose of this paper is to point out the connection of Metropolis's method with the above type of minimisation problem. The idea of the method is to associate with the minimization problem a Markov chain whose sample averages converge with probability one to (approximately) the minimizing point (z1, …, zn). The Markov chain should be easily realizable on a computer. An estimate of the error from sampling over a finite time period is given.
On the Objective Function for the Sequential P-Model of Chance-Constrained Programming
Authors: Kaplan Robert S. , Soden John V.
Published: November 2008

The P-model objective of chance-constrained programming reflects the desire of management to maximize the probability of achieving or exceeding a given level of performance. This paper explores the implications of being able to make a sequence of decisions with the P-model objective function, and introduces some new possibilities for the P-model objective function that arise from the sequential nature of the problem. However, it is shown that, except for a special form of the objective function, the maximization in the sequential problem is not of a quasiconcave function, so that local optimality conditions are not sufficient to guarantee that a proposed solution is a global optimum. An example is worked out in detail to illustrate the computations involved for the objectives considered.
Technical Note—“Linear” Programming with Absolute-Value Functionals
Authors: Shanno David F. , Weil Roman L.
Published: November 2008

Consider the problem Ax = b; max z = ∑cj|xj|. This problem cannot, in general, be solved with the simplex method. The problem has a simplex-method solution (with unrestricted basis entry) only if cj are nonpositive (nonnegative for minimizing problems).
Technical Note—An Integer Approach to Modular Design
Authors: Shaftel Tim
Published: November 2008

This paper discusses the modular-design problem, as set up by David Evans, in which the module is made of several components: there exist Ei of the ith component in each module, and for every application j, D, modules will be needed to satisfy all component requirements. The problem is to design a module (i.e., choose Ē) such that the requirements are satisfied at a minimum cost of surplus components. Mathematically, the problem is: minimizeEi,Dj ∑i=1i=m eiEi ∑j=1j=ndjDj subject to EiDj ≧ Rij; EiDj are positive integers and ei, dj, are constants. The conclusion of the paper is that the two procedures outlined by Evans and by A. Charnes and M. Kirby for the noninteger case cannot be used to find the integer solution. An integer branch-and-bound technique is proposed that has been shown to be useful in the solution of small problems and that has potential use in larger problems.
A Computer-Based System for Forming Efficient Election Districts
Authors: Savas E. S.
Published: November 2008

The Office of the Mayor of the City of New York, with the cooperation of the Board of Elections, has completed a pilot project that demonstrated that a computerized system for drawing election district lines would arrest the persistent decline in the efficiency with which voting machines are utilized, and could therefore be used to: (1) reduce voter delays at polling places; (2) equalize delays among election districts; (3) reduce the vulnerability of election districts to voting machine breakdowns; (4) reduce the cost of conducting elections by up to one million dollars annually; (5) permit convenient redistricting whenever required by changes in political boundaries, election laws, or population shifts; (6) facilitate analysis of voter registration. However, the value of this system is even broader than these points indicate. Its capability to manipulate geographic data is an important element of a generalized management information, mapping, and analysis system that the city is developing.
A Single-Shot Noisy Duel with Detection Uncertainty
Authors: Sweat Calvin W.
Published: November 2008

Duelists, Blue and Red, each with one noisy shot and with accuracies at distance −x of P1(x) and P2(x), x ϵ [X, 0], approach each other from an initial distance −X. Red can see Blue and knows the current value of x. Blue detects Red at distance −y, where y has distribution function F(y), F(X) = 0. Subsequent to detection Blue knows the current x. Red is not informed when he has been detected. If Blue fires first at x, he survives with probability P1(x). If Red fires first, or simultaneously with Blue, at x, Blue survives with probability 1 − P2(x). The payoff is the probability that Blue survives. This game is solved under the assumptions that the functions P1, P2, and F have continuous first derivatives, and that P1 and P2 are strictly increasing when not equal to zero or one.
Intersection Cuts—A New Type of Cutting Planes for Integer Programming
Authors: Balas Egon
Published: November 2008

This paper proposes a new class of cutting planes for integer programming. A typical member of the class is generated as follows. Let X be the feasible set, and x̄ the optimal (noninteger) solution to the linear program associated with an integer program in n-space. Consider a unit hypercube containing x̄, whose vertices are integer, and the hypersphere circumscribing the cube. This hypersphere is intersected in n independent points by the n halflines originating at x̄ and containing the n edges of X adjacent to x̄ (if x̄ is degenerate, X is replaced by X′ ⊃ X having exactly n edges adjacent to x̄). The hyperplane through these n points of intersection defines a valid cut, the (spherical) intersection cut. The paper gives a simple formula for finding the equation of the hyperplane, discusses some ways of strengthening the cut, proposes an algorithm, and gives a finiteness proof. A straightforward extension of these geometric ideas yields an analogous (cylindrical) intersection cut for the mixed-integer case. A discussion of relations to other work (Young, Gomory) is followed by the introduction of some additional intersection cuts obtained from hypersurfaces other than the sphere or the cylinder. The message of this paper lies, not so much in the particular cuts that it proposes, as in the basically new approach to integer programming that these cuts typify. This approach is geometrically motivated and uses the “local” properties (in the integer-programming sense) of the feasible set.
Technical Note—Bounds on the Gain of a Markov Decision Process
Authors: Hastings N. A. J.
Published: November 2008

An algorithm for the steady-state solution of Markov decision problems has been proposed by Howard and modified by Hastings. This note shows, for the case of single-chain Markov decision processes, how bounds on the optimal gain can be obtained at each cycle of the foregoing algorithms. The results extend to Markov renewal programming. Related results are the bounds proposed by Odoni for use with White's value-iteration method of optimization.
An Intersection Cut from the Dual of the Unit Hypercube
Authors: Balas Egon , Bowman V. Joseph , Glover Fred , Sommer David
Published: November 2008

This note extends the work of Balas (and the related work of Young) on intersection cuts for integer programming. Replacing the Euclidean hypersphere used by Balas with a convex polyhedron dual to the unit hypercube, we obtain a stronger intersection cut.
Chebyshev Optimal Waste Discharges
Authors: Sobel Matthew J.
Published: November 2008

Liquid wastes are often stored for some time before being discharged into a water resource. Storage capacity determines the set of feasible discharge schedules and, therefore, limits the levels of water quality that are attainable. Thus motivated, the paper considers the following discrete-time deterministic problems: (a) For a given storage capacity, what discharge schedule maximizes the minimum water quality during a finite horizon? (b) For a given minimum water quality during a finite horizon, what is the smallest storage capacity for which there exists a feasible discharge schedule? A characterization is provided for optimal solutions to (a) and (b). The characterization is exploited computationally to obtain exact solutions to (b) and approximate solutions to (a).
On a Single-Server Finite Queuing Model with State-Dependent Arrival and Service Processes
Authors: Courtois P. J. , Georges J.
Published: November 2008

This paper generalizes the M/G/1 queuing process by considering both the arrival and the service rates as being essentially arbitrary functions of the current number of customers in the system, and by assuming, moreover, that the amount of service demanded by a customer is conditioned by the queue length at the moment service is begun for that customer. Taking the imbedded Markov chain approach, the paper proposes a method for calculating (1) the limiting probability distribution of the congestion and (2) the expected value of the time needed to complete a service. An expression for the distribution of the waiting time is then given and its first moment deduced.
Search Detection and Subsequent Action: Some Problems on the Interfaces
Authors: Pollock Stephen M.
Published: November 2008

Surveillance operations in general involve detection devices, search (allocation-of-effort) procedures, and decisions leading to action of some kind. There has been a tendency to model the three phases of search, detection, and action separately, albeit the output parameters of one such model often are used as the inputs to others. This paper considers some of the interfaces between these phases and includes some simple examples of the relation between search, detection, and decision theories involving false alarms, continuous surveillance, localization, and selection of appropriate measures of effectiveness.
A Method for Evaluating the Combat Effectiveness of a Tactical Information System in a Field Army
Authors: Tiede Roland V. , Leake Lewis A.
Published: November 2008

This paper describes a method that was developed for modeling interactions in ground combat between information flows and tactical decision making. The purpose was to provide means for measuring the effectiveness of tactical information systems in a Field Army. Gaming was chosen for the basic method because the essence of the problem was the ground commander's ability to make effective use of better information as provided by an improved tactical information system. Near-real-time play of division-level combat was made possible by providing on-line computer assistance to the control group. Combat outcomes are related to mission requirements to obtain measures of effectiveness.
Optimal Allocation of Missiles Against Area and Point Defenses
Authors: Miercort Frederic A. , Soland Richard M.
Published: November 2008

This paper considers the problem of allocating a given number of reliable offensive missiles of one type against reliable subtractive area and point defenses of known size and the cities protected by these defenses so as to maximize the total damage done to the cities. An integer nonlinear programming formulation of the problem is developed and a branch-and-bound algorithm for its solution is offered. Computational considerations are discussed and numerical results are given.
Attrition Rates for Weapons with Markov-Dependent Fire
Authors: Kimbleton Stephen R.
Published: November 2008

A weapon is said to have a Markov-dependent firing policy if the result of the current round is conditioned on the outcome of the preceding round. For such a weapon we obtain the distribution of the number of rounds required to defeat a target. From this result we derive the distribution of the time required to destroy a target and the expected value of the Lanchester attrition-rate coefficient.
Stability in Noncooperative Games
Authors: Williams J. B.
Published: November 2008

This paper presents definitions for stability of equilibrium points in non-cooperative N-person games over compact metric spaces. It then derives conditions for stability, assuming certain properties of payoffs in games over Euclidean spaces. Finally, computational implications of the theory are noted.
Multiple Policy Improvements in Undiscounted Markov Renewal Programming
Authors: Schweitzer Paul J.
Published: November 2008

This paper examines, for undiscounted unichain Markov renewal programming, both the Hastings policy-value iteration algorithm and the case of multiple policy improvements between each policy evaluation. The modified policy improvement procedure proposed by Hastings either increases the gain rate or maintains it, and has a larger value improvement in some transient state than in all recurrent states. This prevents cycling and ensures convergence of the policy-value iteration algorithm. Multiple policy improvements, using either the unmodified or modified policy-improvement procedure, are shown to settle ultimately upon higher-gain policies, if any exist. The iterated policy improvements, each time using the improved values, also lead to upper and lower bounds on the maximal gain rate.
A Note on Extreme-Point Solutions and A Paper by Lemke, Salkin, and Spielberg
Authors: Glover Fred
Published: November 2008

This paper gives a framework for unifying and slightly generalizing certain properties of extreme-point solutions exploited by an approach of Lemke, Salkin, and Spielberg for solving set-covering problems.
Technical Note—A Note on Extended GLM
Authors: Evans J. P. , Gould F. J. , Howe S. M.
Published: November 2008

This note presents a modification of some earlier work of Gould on nonlinear multiplier functions in generalized Lagrangian (penalty) formulations. The purpose of the modification is to present a generalized Lagrangian that is invariant under right-hand-side translations and that yields the usual economic interpretation for unused resource quantities at optimality.
Technical Note—Undiscounted Markov Renewal Programming Via Modified Successive Approximations
Authors: Morton Thomas E.
Published: November 2008

This note describes an efficient class of procedures for finding a solution to the functional equations [Formula: see text] of undiscounted Markov renewal programming. First, for the special case of a single possible policy, the problem is proved equivalent to solving two related ordinary Markov chain problems, which leads to an algorithm for the general problem whose exact form depends on the specification of a decision rule for alternation of two types of iterations. At one extreme, the technique is exactly “policy iteration,” with iterative techniques replacing solution of N equations for each improved policy; at the other extreme, the algorithm becomes essentially “value iteration,” generalizing the method of successive approximations proposed by D. J. White for Markovian decision processes. The latter version of the technique is related to another generalization being currently proposed by Paul J. Schweitzer; the methods being proposed here, however, do not deteriorate when the minimum transition time between states becomes very small.
Technical Note—A Unified Nonlinear Duality Formulation
Authors: Bazaraa M. S. , Goode J. J. , Shetty C. M.
Published: November 2008

The purpose of this note is to unify various duality formulations in nonlinear programming. We show that this can be done by using a minmax formulation.
A Generalized Lagrange-Multiplier Method for Constrained Matrix Games
Authors: Penn Alan I.
Published: November 2008

This paper presents a general method for solving constrained matrix games of a type occurring frequently in military and industrial operations research. The usual context is the optimal allocation of constrained resources by two opposing sides among a series of independent cells such that the payoff overall is the sum of the payoffs at each cell. The cells themselves might represent separate invasion or supply routes, battlefields, individual targets, or marketing ventures. Generalized Lagrange multipliers (Everett multipliers) are used to effect the solution. It is shown that the basic properties of the games preclude the possibilities of nonconcavities or extraneous solutions.
An Efficient Algorithm for Multi-Item Scheduling
Authors: Lasdon L. S. , Terjung R. C.
Published: November 2008

A number of resource-allocation problems, including that of multi-item scheduling, may be solved approximately as large linear programs, as in Manne [Management Sci. 4, 115–135 (1958)]. Dzielinski and Gomory [Management Sci. 11, 874–890 (1965)] applied the Dantzig-Wolfe decomposition principle to this problem. Here, the problem is attacked directly, using a column generation technique and Dantzig and Van Slyke's generalized upper-bounding method [J. Comp. and Syst. Sci. 1, 213–226 (1967)]. For problems involving I items and T time periods, one need deal with a basis matrix of dimension only T by T. A lower bound on the optimal cost may be developed, and intermediate solutions all have Manne's integer property (loc. cit.). Computational experiments, including an option for pricing out subproblem solutions until none is useful, show a number of iterations to optimality of from one-half to one-ninth the number required by the decomposition principle with work per iteration remaining approximately the same. Extensions of the basic model are also described. These form the core of an automated production-scheduling and inventory-control system, currently being used by a major U. S. manufacturer. Computational experience with this extended model is presented.
Technical Note—The Allocation of Power that Minimizes Tension
Authors: Theil Henri
Published: November 2008

This note discusses a criterion function that justifies the rule according to which the representation of groups of persons is proportional to the square root of the size of the group. The note then generalizes this criterion function and analyzes the implications for the representation system.
Technical Note—On Hu's Decomposition Algorithm for Shortest Paths in a Network
Authors: Yen Jin Y.
Published: November 2008

Hu and Torres have proposed a decomposition algorithm for finding the shortest paths between all pairs of nodes in a sparse network in which subnetworks are linearly overlapped. The purpose of this note is to point out how the efficiency of this algorithm can be improved by making a modification.
Technical Note—Comments on a Paper by S. G. Allen and D. A. D'Esopo: “An Ordering Policy for Repairable Stock Items”
Authors: Simon Richard M. , D'Esopo D. A.
Published: November 2008

This note considers an inventory model for repairable stock items for which S. G. Allen and D. A. D'Esopo had previously derived an approximate expression for backorder rate, derives an exact expression for the stationary distribution of stock on hand and backordered under considerably more general assumptions, and shows that the backorder rate can be calculated exactly from this. The stationary expected number of backorders per unit time can also be calculated from this distribution.
The ABC's of OR
Authors: Wagner Harvey M.
Published: November 2008

This paper provided the background text for the Distinguished Lecture delivered on May 5, 1971, at the 39th National Meeting of the Operations Research Society of America at Dallas, Texas.
A Motivational Profile of Management Scientists
Authors: Lyon Herbert L. , Ivancevich John M. , Donnelly James H.
Published: November 2008

Maslow's need-hierarchy theory of motivation has had a major influence on the thinking and research of many writers studying managerial behavior in an organizational setting. A growing number of groups of managers have been used as subjects in studies concerned with motivation and perceived need satisfactions. One conspicously absent group in recent studies conducted by behavioral scientists has been management scientists, a randomly selected sample of 192 of whom participated in the present study. The objective of the study was to learn about (1) the relation between job level and perceived need satisfaction, (2) the relation between company size and perceived need satisfaction, and (3) the interaction effects of level and size on perceived need satisfaction. Since the management science profession is becoming a significant force in society and organizations, the preliminary findings of this study provide some much needed motivational data. It was generally found that the most predominant independent variable studied was the level of the management scientist in the organization. Hopefully, more controlled and sophisticated research studies will be stimulated by the present study.
The Location of Emergency Service Facilities
Authors: Toregas Constantine , Swain Ralph , ReVelle Charles , Bergman Lawrence
Published: November 2008

This paper views the location of emergency facilities as a set covering problem with equal costs in the objective. The sets are composed of the potential facility points within a specified time or distance of each demand point. One constraint is written for each demand point requiring “cover,” and linear programming is applied to solve the covering problem, a single-cut constraint being added as necessary to resolve fractional solutions.
An all Zero-One Algorithm for a Certain Class of Transportation Problems
Authors: De Maio Adriano , Roveda Claudio
Published: November 2008

This paper considers a special class of transportation problems. There is a set of sources producing the same material with a fixed maximum capacity, and a set of users whose demands for the material are known. A cost is associated with the transportation of the material from each source to each user. Each user is to be supplied by one source only. The problem consists of finding the flow of the material from the sources to the users that satisfies their demands and minimizes the total transportation cost. The formulation of the problem is the same as the well-known Hitchcock problem with the further constraint that all the variables are binary. The paper proposes a search method, roughly resembling Balas's filter method, for the solution of the problem, and discusses it from a computational point of view. Finally, it describes an application of the model to a real industrial problem.
Stochastic Prices in a Single-Item Inventory Purchasing Model
Authors: Kalymon Basil A.
Published: November 2008

This paper studies a single-item multi-period inventory model in which future prices of the purchased item are assumed to be determined by a Markovian stochastic process instead of being known with certainty. Convex holding and shortage costs and a set-up charge for ordering are assumed. Such a model applies to purchasing a commodity whose price fluctuates widely because of speculative activity and large variations in supply or demand. For both a finite and infinite planning horizon, the paper determines the form and bounds of optimal policies and discusses computational approaches exploiting structure.
An Algorithm to Solve Finite Separable Single-Constrained Optimization Problems
Authors: Loane Edward P.
Published: November 2008

This paper presents an iterative algorithm that allows the solution of the following problem to be obtained to any desired degree of accuracy: choose si ϵ Ai for i = 1, …, n to minimize ∑i=1i=n ci(si) subject to ∑i=1i=nei(si) ≧ ε for arbitrary given real ε, ci, ei, and finite Ai, i = 1, …, n. In particular, the sets {(Ci(γ), ei(γ)): γ ϵ Ai} need not be convex. The procedure offers considerable computational advantage over alternative means of obtaining the desired solution. The technique uses a pair of Lagrange multipliers for the single constraint. This pair of Lagrangians induces a partial ordering among the set of all (s1, …, sn). The desired solution is found among the maximal elements under this ordering for appropriate choices of the multipliers, and possible improvement in the solution is bounded in terms of other maximal elements. The set of all maximal elements, under the partial ordering, is generated by dynamic programming.
Technical Note—A Note on Gomory Fractional Cuts
Authors: Salkin Harvey M.
Published: November 2008

This note shows that the Gomory cut developed for the mixed integer program, when extracted from a source row in which the nonbasic variables are integer constrained, is stronger than the one derived for the integer program.
Errata
Authors: Rustagi J. S. , Doub T. W.
Published: November 2008

Errata to authors' paper “Optimum Distribution of Armor,” Opns. Res. 18, 559–562 (1970).
Nonlinear Assignment Problems Treated by Geometric Programming
Authors: Passy Ury
Published: November 2008

This paper analyzes two different classes of nonlinear assignment problems and shows that one type of problem can be reformulated as a geometric program, while the second can be transformed into a complementary geometric program. Also, an algorithm for weapon-assignment problems is developed and applied to an example.
Technical Note—A Comment on a Paper by Goodwin and Giese
Authors: Brown George F. , Corcoran Timothy M.
Published: November 2008

This note points out an error in a paper by James M. Goodwin and Erich W. Giese, “Reliability of Spare Parts Support for a Complex System with Repair,” Opns. Res. 13, 413–423 (1965).
Utilization of Negro Manpower in the Army
Authors: Hausrath Alfred H.
Published: November 2008

In connection with a basic policy decision by the Army in 1951 on the utilization of Negro manpower, a partly quantitative operations research study was made. Factors affecting the decision to integrate Negroes into previously all-white. Army units included statistics of scores on the Army's General Classification Test, Negro and white performance in combat, and interactions between Negro and white soldiers as determined from attitudes, opinions, critical incidents, and actual behavior. It is concluded that integrated (white and Negro) units can make more effective use of available manpower than segregated units, that resistance to integration is reduced as experience in integrated units is gained, and that levels of 20 per cent Negroes and more are acceptable. The time required to extend integration to the whole Army is discussed, and difficulties presented in such a manner that a sound program can be devised.

Operations Research, ISSN 0030-364X, was published as Journal of the Operations Research Society of America from 1952 to 1955 under ISSN 0096-3984.
The Experimental Determination of Guided Missile Reliability
Authors: Seldon M. R. , Pertschuk D. W.
Published: November 2008

If the number of different environmental stresses to which guided missile components and systems are exposed were limited to one or two, suitable experimental design would make laboratory determination of their reliability feasible. In view of the fact, however, that a missile is exposed to a complex of different stresses, there is no practical way in which reliability evaluation can be accomplished through test procedures. On the other hand, it is quite possible to obtain useful estimates of the reliability of the whole missile from the results of a flight-test program. Since this technique will come close to duplicating the environmental stress encountered in tactical flight, a simple ratio of successful flights to total flights will itself yield considerable information. This figure can be refined through the use of moving averages, and reliability estimates can be further validated by presenting the results in terms of confidence belts instead of point estimates.

Operations Research, ISSN 0030-364X, was published as Journal of the Operations Research Society of America from 1952 to 1955 under ISSN 0096-3984.
Letter to the Editor—Operations Research as Defined in this Journal
Authors: Page Thornton
Published: November 2008

When a man sits down to write a letter to himself he is seldom troubled by semantics, but this letter is an exception, since the topic, in my opinion, is entirely semantic and hinges on what we mean by the word ‘definition.’ At the last two Society meetings there have been lengthy discussions aimed at a formal definition of operations research, and a number of potential authors threaten to submit long articles on this subject for publication.

Operations Research, ISSN 0030-364X, was published as Journal of the Operations Research Society of America from 1952 to 1955 under ISSN 0096-3984.
Letter to the Editor—An Analytical Solution to a Problem in Balancing Opposing Loss Factors
Authors: Brigham G. , Stenoien J. O.
Published: November 2008

An interesting example of a simple operations-research problem in which the object is to find the best balance between two opposing factors has been given by Sir Charles Goodeve.* The example was first described by Passano† in an address to the American Iron and Steel Institute and deals with minimizing the waste in the production of steel bars.

Operations Research, ISSN 0030-364X, was published as Journal of the Operations Research Society of America from 1952 to 1955 under ISSN 0096-3984.
The Influence of Servicing Times in Queuing Processes
Authors: Gaver Donald P.
Published: November 2008

A relation between the distribution of customer-servicing times and that of customer-waiting times is derived for the case of a single-channel queue with random arrivals and the rule of “first come, first served” establishing the order of service. The queue is assumed to be in a state of statistical equilibrium. The relation holds for a large class of the servicing-time distributions that occur in practice, in particular the cases of constant, exponential, and Type III Pearson servicing times. The derivation takes into account changes in the magnitude of demand from customer to customer, changes that may exist in many of the situations in which the theory is likely to be applied. Using the theory, the characteristics of the waiting-time distributions associated with several specific types of servicing-time distributions are discussed. It is shown that if it is possible to make the right sort of alterations in servicing-time distributions considerable reduction in customer waiting times can be made. The analytical results are illustrated with graphs.

Operations Research, ISSN 0030-364X, was published as Journal of the Operations Research Society of America from 1952 to 1955 under ISSN 0096-3984.
Letter to the Editor—Combat Problems, Weapons Systems, and the Theory of Allocation
Authors: Danskin J. M.
Published: November 2008

I have read with considerable interest the paper by Karchere and Hoeber in the November 1953 issue of the Journal, and wish to make some comments.

Operations Research, ISSN 0030-364X, was published as Journal of the Operations Research Society of America from 1952 to 1955 under ISSN 0096-3984.
Letter to the Editor—Policies of the Society for Advancement of Management in its Operations Research Conferences
Authors: Rinehart R. F.
Published: November 2008

No abstract available.

Operations Research, ISSN 0030-364X, was published as Journal of the Operations Research Society of America from 1952 to 1955 under ISSN 0096-3984.
Letter to the Editor—Status of Operations Research in Industry
Authors: Malcolm D. G.
Published: November 2008

No abstract available.

Operations Research, ISSN 0030-364X, was published as Journal of the Operations Research Society of America from 1952 to 1955 under ISSN 0096-3984.
The Control of Inventories and Production Rates—A Survey
Authors: Simon Herbert A. , Holt Charles C.
Published: November 2008

The inventory and production control problem encompasses purchasing and ordering decisions, production-rate decisions, and scheduling decisions. Over the past twenty-five years there has been considerable study of ordering decisions, under “static” assumptions, and workable decision rules are available. Work on “dynamic” rules is still in an early stage, but a general framework of analysis, and several methods of approach have been developed. Production rate decisions have been investigated from the standpoint of servomechanism “feedback” theory, the calculus of variations, and several forecasting techniques. A combination of these approaches promises to yield simple, practical decision rules. The most urgent current research problem is to devise workable decision-making procedures for complex interrelated industrial situations by finding methods for “coupling” the decision rules that apply to the individual parts of the system. Industry has made some use of the “static” decision rules now available in the literature; there has yet been little application of the dynamic ordering and production rate rules.

Operations Research, ISSN 0030-364X, was published as Journal of the Operations Research Society of America from 1952 to 1955 under ISSN 0096-3984.
Feasibility Considerations in the Allocation of Resources to Military Programs
Authors: Hoeber Francis P. , Karchere Alvin
Published: November 2008

In an earlier article (Kaechere, Alvin, Francis P. Hoeber. 1953. J. Opns. Res. Soc. Am. 1, 286), the authors suggested an adaptation of some elementary economic theory to the development of criteria for answering three questions: Given a combat situation, what weapon systems should be used? In what proportions? How many? The suggested criteria provided for equating the marginal cost-effect ratios of two or more weapon systems. Suboptimization criteria for approaching this ideal were suggested. In this first approximation, it was assumed that the alternative weapons systems could be delivered within the period under consideration. The present paper treats the case in which it is not possible, in the time specified by the program, to obtain the quantity of a weapon system required by the optimum solution given by the static equilibrium analysis. This situation arises when some resource cannot be made available in the stated time, regardless of cost. Criteria for allocating resources under this constraint are suggested, using a model based on experience in past periods of mobilization, and one believed to be consistent with what may be expected to occur in a future mobilization.

Operations Research, ISSN 0030-364X, was published as Journal of the Operations Research Society of America from 1952 to 1955 under ISSN 0096-3984.
Letter to the Editor—The Application of Operations-Research Methods to Athletic Games
Authors: Mottley Charles M.
Published: November 2008

The possibility of applying scientific method to athletic games does not appear to have received much attention by the operations research community. Certain sports, such as football, baseball, and basketball, simulate warfare, and would seem to provide an excellent opportunity for teaching operations-research methods in “live” situations that are readily available to military schools and universities. The resemblance of football to ground combat is well known; baseball is analogous to a battle between two naval task forces; and basketball can be considered as a simulation of aerial warfare.

Operations Research, ISSN 0030-364X, was published as Journal of the Operations Research Society of America from 1952 to 1955 under ISSN 0096-3984.
Letter to the Editor—Waiting Line Subject to Priorities
Authors: Holley Julian L.
Published: November 2008

In his article, “Priority Assignment In Waiting Line Problems,” (Cobham, J. Opns. Res. Soc. Am. 2, 70 (1954).) Alan Cobham obtained very interesting and valuable waiting-time formulas both for single- and multiple-channel systems. His reasoning is similar in the two cases, but it is given in detail for the single-channel case, and for definiteness the ensuing remarks will be directed exclusively to that case.

Operations Research, ISSN 0030-364X, was published as Journal of the Operations Research Society of America from 1952 to 1955 under ISSN 0096-3984.
Training for Operations Research
Authors: McCloskey Joseph F.
Published: November 2008

Training for operations research may be considered under three general headings: on-the-job training in existing groups, formal academic training in universities; and training of users of operations research, both actual and potential.

Operations Research, ISSN 0030-364X, was published as Journal of the Operations Research Society of America from 1952 to 1955 under ISSN 0096-3984.
Industrial Economics and Operations Research at Stanford Research Institute
Authors: Platt William J.
Published: November 2008

The dynamic and profitable nature of American industry is dependent upon sound applied research in industrial economics in the same way that it is dependent upon the more frequently recognized applied research in technical fields. As a matter of fact, it is the combination of technical and economic research that accounts for much of the economy's profit, expansion, and productivity. Call it techno-economic research, or operations research if you wish. The purpose of this paper is not to propose definitions, but rather to give some examples of how companies are conducting research to arrive at decisions that affect their growth and health and that of the total economy. Then the reader may label this kind of research by whatever brand name appeals to him.

Operations Research, ISSN 0030-364X, was published as Journal of the Operations Research Society of America from 1952 to 1955 under ISSN 0096-3984.
Letter to the Editor—Reflections on Operational Research
Authors: Williams E. C.
Published: November 2008

No abstract available.

Operations Research, ISSN 0030-364X, was published as Journal of the Operations Research Society of America from 1952 to 1955 under ISSN 0096-3984.
Letter to the Editor—The Application of the Operations-Research Approach in Making a Decision of No Great Importance
Authors: Siegel Geoffrey J.
Published: November 2008

No abstract available.

Operations Research, ISSN 0030-364X, was published as Journal of the Operations Research Society of America from 1952 to 1955 under ISSN 0096-3984.
Basic Dual Feasible Solutions for a Class of Generalized Networks
Authors: Glover Fred , Klingman D. , Napier A.
Published: November 2008

The generalized network problem and the closely related restricted dyadic problem occur frequently in applications of linear programming. Although they are next in order of computational complexity after pure network or distribution problems, the jump in degree of difficulty is such that, in the most general problem, there exist no algorithms comparable in speed to those for pure networks. In this paper we characterize the properties of a special class of generalized network problems that permit a dual feasible basic solution to be determined in one “pass” through the network. In particular, this class includes the class of pure network problems for which no such procedure has previously existed. Our algorithm also makes it possible to apply Lemke's dual method and the poly-ω technique of Charnes and Cooper in an efficient manner to solve capacitated (pure) network problems.
An Algorithm for the Minimum-Risk Problem of Stochastic Programming
Authors: Dragomirescu Mihai
Published: November 2008

This paper presents a computational procedure for the solution—via reduction to a parametric quadratic program—of the “minimum-risk problem” associated with a stochastic linear program where costs are random variables with normal multidimensional joint distribution, i.e., for the nonlinear program maxxϵX(c′x − t)/(x′Vx)1/2 in where t is a given number, V a positive-definite matrix, and X a given convex polyhedron in n-dimensional Euclidean space Rn.
Technical Note—Direct Proof of the Existence Theorem for Quadratic Programming
Authors: Blum E. , Oettli W.
Published: November 2008

A direct analytical proof is given for the following theorem: If the infimum of a quadratic function on a nonempty (possibly unbounded) polyhedral set R ⊆ ℛn is finite, then the infimum is assumed somewhere on R, thus being a minimum.
Technical Note—Finite Algorithms for Solving Quasiconvex Quadratic Programs
Authors: Mylander W. Charles
Published: November 2008

This note considers the question of why some convex quadratic programming algorithms fail and others succeed when applied to nonconvex quasiconvex quadratic programs. Several algorithms are identified as being capable of solving quasiconvex quadratic programs using only a finite number of arithmetic and logical operations. These algorithms are all primal feasible, pivot algorithms.
Technical Note—A Branch-and-Bound Algorithm for Seeking the P-Median
Authors: Järvinen Pertti , Rajala Jaakko , Sinervo Heikki
Published: November 2008

We construct a branch-and-bound algorithm for seeking the p-median, and make comparisons with the vertex-substitution method of Teitz and Bart [Opns. Res. 16, 955–961 (1968)]. We show how the vertex-substitution method can lead to a local optimum, and give a heuristic method for finding a good initial solution for this method.
Single-Server, Two-Machine Sequencing with Switching Time
Authors: Sahney Vinod K.
Published: November 2008

In sequencing problems, one of the major assumptions made is that labor is available to operate each of the machines in the shop. In many real-life situations, this assumption is not realistic; labor usually acts as a limiting resource, together with the machines. In this paper we discuss the sequencing of jobs on two machines in parallel when only a single server is available and a finite switching time is incurred to move the server from one machine to the other, and describe an algorithm to solve this problem.
Technical Note—Asymptotic Properties of Mean Length Estimators for Finite Markov Queues
Authors: Reynolds John F.
Published: November 2008

The mean length of a queue is normally estimated by a suitable mean of observed values. In order to determine the minimum sample size consistent with some required precision, it is necessary to know the standard error of the sample mean used. Since the observations are dependent, this standard error is usually greater than the standard error for independent observations, so that a larger sample size is required. This paper derives expressions for the standard errors of some suitable estimators in the case of finite Markov queues, and examines the efficiencies of these estimators.
Management of Seasonal Style-Goods Inventories
Authors: Ravindran Arunachalam
Published: November 2008

This paper develops an inventory model in which season length is specifically included as a variable for seasonal style goods under the assumption that the demands exhibit a simple contagion pattern, namely, the influence of past demands on future occurrence of demands. The paper first derives an s − S optimal order policy as a function of the selling season, then determines the optimal duration and timing of the selling season, and, finally includes an algorithm for computing the optimal season length.
Generalization of White's Method of Successive Approximations to Periodic Markovian Decision Processes
Authors: Su Shiaw Y. , Deininger Rolf A.
Published: November 2008

The difficulty in solving a Markovian decision problem with a large number of states by Howard's policy-iteration method is that one has to solve a large system of simultaneous linear equations. Procedures developed by D. J. White and J. MacQueen, which avoid this difficulty, have been widely used to handle large-scale Markovian decision problems. This paper extends these algorithms to the case where the Markovian decision process is periodic. Proofs of the convergence of these new algorithms are sketched. Some computational experiences based on the modeling of the Great Lakes regulation systems are also given.
Queues with Service in Random Order
Authors: Carter Grace M. , Cooper Robert B.
Published: November 2008

We consider two models, the GI/M/s queue and the M/G/1 queue, in which waiting customers are served in random order. For each model we derive expressions for the calculation of the stationary waiting-time distribution function. Our methods differ from those of previous authors in that we do not use transforms, and consequently our results may be better suited for calculation. We illustrate our methods by deriving previously known results for the M/M/s and M/D/1 random-service queues, and by making sample calculations for the M/Ek/1 random-service queue for various values of the utilization factor and the index k.
The Queue M/G/1 with the Semipreemptive-Priority Queuing Discipline
Authors: O'Donovan Thomas M.
Published: November 2008

This paper studies a priority queuing model in which the processing times of jobs are known upon arrival and preemption without loss of time or processing already accomplished is possible. Jobs are classified into K types according to their lengths, priority is assigned to them according to type and the length of processing remaining, and the paper obtains the expected conditional response times for jobs of each type.
A Network-Flow Model for Racially Balancing Schools
Authors: Belford Peter C. , Ratliff H. Donald
Published: November 2008

This paper is concerned with developing a procedure for assigning students to public schools optimally, given that a specified racial balance must be attained in each school. The criterion for optimality is to minimize the total number of miles traveled. The problem is formulated as a minimum-cost flow problem in a single-commodity network. A summary of the results achieved by the model for the Gainesville, Florida, school system is discussed.
Solving Resource-Constrained Network Problems by Implicit Enumeration—Preemptive Case
Authors: Schrage Linus
Published: November 2008

This paper treats the scheduling problem that has both precedence constraints (of a general form as in PERT-CPM problems) and resource constraints (of the form in the general job-shop scheduling problem). Preemptive-resume without changeover times is allowed. An efficient procedure for enumerating all active schedules is given. For the objective of minimizing the project length, a branch-and-bound algorithm is developed by adding a bounding procedure to the enumerative scheme. Computational experience is given.
Technical Note—A Sample Survey of Operations-Research Activities at the Corporate Level
Authors: Turban Efraim
Published: November 2008

This paper describes and discusses the results of a national survey covering the activities of the operations-research department at the corporate level. The major points considered are: (1) the organizational structure of the department and its position in the corporation, (2) the internal structure of the department, (3) budgets and savings, (4) use of services, and (5) a study of the activities in the past, present, and future.
Technical Note—Approximations to the Renewal Function m(t)
Authors: Jaquette David L.
Published: November 2008

Models of queuing, inventory, and reliability processes often have a useful renewal process imbedded in the fundamental stochastic process. The number of renewals is sufficient to determine performance measures such as the total cost, shortages, etc. The limit theorems of renewal theory are unsatisfactory in obtaining the expected values of these performance measures over a finite time horizon. This paper compares an accurate numerical technique for calculating the expected number of renewals with an approximation that uses the asymptotic expansion of the dominating residues of the Laplace transform M(θ). Furthermore, when a parameter of the renewal process is uncertain except for its Bayesian prior distribution, an approximation that uses a modified exponential renewal process appears better.