Abstract
Recently, the linear programming with interval coefficients which expresses the fuzzyness of the state was formulated and analyzed in some papers. On the other hand, a parallel branch and bound algorithm for solving mixed integer programming problems was proposed, and the speed-up by it on transputer for relatively large scale problems was reported. This paper proposes a parallel branch and bound algorithm for solving mixed integer programming problems with interval coefficients and develops a C program which implements the parallel algorithm on a widely used UNIX network. To demonstrate the usefulness of this method, some computational experiments are made on the UNIX network.
