a mixed integer mathematical programming model solution using branch and bound techniques (abstract only)  an optimal allocation of work release and labor assignments on a paced assembly line using the objective criterion of minimal standard hours has been formulated as a mixed integer mathematical programming model. the results of our research lead to the development of an algorithm which solves the mathematical model formulation and a computer implementation demonstrates its use in an actual operating environment. the algorithm developed for solving the problem uses a branch and bound approach as its basic solution technique.  basically, the ingredients of a branch and bound algorithm are a lower bounding strategy, a branching strategy (which partitions the set of feasible solutions into subsets), and a search strategy (which determines the order in which the subsets are investigated). the algorithm presented here uses the method of relaxing difficult constraints as a lower bounding strategy. the lower constraints are those which contain integer variables. this approach results in an ordinary linear programming problem model formulation which is used for computing lower bounds. the branching strategy is a binary partitioning in which a particular assembly mode is either in the solution subset, or not. the search strategy used is the backtracking procedure in which the branching variables are heuristically preordered.  the mixed integer mathematical model follows: the objective function is v(x) = cx where c is (l x n) vector and x is a (n x 1) vector subject to ax = d where a is a (m x n) vector d is a (m x 1) vector hx ≤ h where h is a (1 x n) vector h is a (1 x 1) vector bx-ds ≤ o where b is a (r x n) matrix d is a (r x n) matrix s is a (r x 1) vector bx-ps ≥ o where r is a (s x n) matrix os ≤ e where o is a (t x n) matrix e is a (t x 1) vector  all variable are non-negative, the elements of the vector x arise from a continuous function, and the elements of the vector s are (0,1) integer values.  the computer software used for solving the above model consists of two fortran iv modules under the command of a language processor. both software packages can be operated either interactively or under a batch processing mode. one of the computer software packages is labeled the "initialization program" which is used to generate the coefficient vectors and matrices, i.e., c, a, d, h, h, b, d, r, o, and e presented in the above model. the other is labeled the "action program" which is used to obtain an "optimal" solution for the problem. the computer software packages have been executed on a xerox-560 computer in a limited fashion.  in conclusion, there is an important by-product from our research so far; a way to find alternative optimal solutions. the branch and bound algorithm which we utilize is a partial enumeration technique in which subsets of feasible solutions are eliminated from consideration by comparing a lower bound on the objective function value (for a given subset) to the best solution obtained up to that point. theoretically, alternative optimal solutions may be among those subsets of feasible solutions.  lung chiang wu harry k. edwards