Search

Several letters to the editor are presented in response to articles published in previous issues including "An Unequal-Period Model for Cash Management Decisions," published in the October 1969 issue, "Datamation," published in the September 1968 issue, and "What Is A Decision?"

Summary ** This report contains a description of an input system for linear programming. In this system the mathematical formulation of a LP problem serves as input for a computer. The coefficients of the problem are generated from the formulas. Some examples are presented. [ABSTRACT FROM AUTHOR]

Summary A branch and bound algorithm is given to solve the following problem: To each pair of elements (i,j) from a set X={l,..., n} a number rij with rij≥ 0, rij= rij and rij= 0 has been assigned. Find a prescribed number of disjoint subsets P1..., Pm from X, such that Experiments indicate that an optimal solution is usually found in a small number of iterations, but the verification may be rather time consuming. The algorithm may be used to find the minimum value of m for which a partitioning of X with z= 0 exists. The algorithm appears to be efficient for finding this 'chromatic number of a graph'. [ABSTRACT FROM AUTHOR]