A quadratic model for production-inventory planning was made famous by Holt, Modigliani, Muth, and Simon in 1960 in (Holt, C. C., F. Modigliani, J. F. Muth, H. A. Simon. 1960. Planning Production, Inventories, and Work Force. Prentice-Hall, Englewood Cliffs, New Jersey.), especially for its...

A quadratic model for production-inventory planning was made famous by Holt, Modigliani, Muth, and Simon in 1960 in [3], especially for its application to a paint factory. A discrete control version of a related quadratic production-inventory model was studied by Kleindorfer, Kriebel, Thompson,...

Modelling planning problems that extend over many time periods as linear programs leads to a special structure called a "staircase" or "dynamic" linear program. In this special structure, the nonzero coefficients of the linear program appear in blocks along the "main diagonal" of the coefficient...

Business policy questions frequently involve competitive encounters among several different firms. Oligopoly theory in economics was devised to answer similar questions, but its results so far are largely confined to cases of monopoly (one firm), duopoly (two firms), and many firms (wheat...

The two types of mathematical manpower planning models that appear in the literature involve either longitudinal or cross-sectional formulations. Despite the high degree of realism achieved, the use of longitudinal models is limited because the implementation requires the knowledge of a large...

This note points out that three of the facilities layout problems solved by Picone and Wilhelm (Picone, C. J., W. E. Wilhelm. 1984. A perturbation scheme to improve Hillier's solution to the facilities layout problem. Management Sci. 30 1238--1249.) are different from the test problems given in...

In formulating linear programming problems, analysts tend to include constraints that are not binding at the optimal solution for fear of excluding necessary constraints. The inclusion of such constraints does not alter the optimum solutions, but may require many additional iterations to be...

A code for solving travelling salesman problem employing heuristic ideas is described. Acyclic permutations of the cities are constructed by first choosing two cities at random for a permutation of length two, putting the remaining cities in a random list and then inserting cities from the list...

A machine is to be bought, used for productive purposes for a length of time, and then sold. It is possible to do preventive maintenance while the machine is being used, if desired, in order to slow down the degradation of the machine's capability. The value of owning the machine is the sum of...

We derive a sharp upper bound on the minimal forecast horizon in the discounted dynamic lot size model with constant initial demand. This bound is given by m(m + 1), where m is the EOQ's worth, i.e., the number of periods for which the total demand equals Economic Order Quantity. Our results do...