A Variant of the Transportation Problem in Which the Constraints are of Mixed Type

Abstract

AbstractAn algorithm is presented for solving a variant of the transportation problem with a mixture of equality and inequality requirement and availability constraints. The method involves a simple transformation to the solution of a standard transportation problem. Proof is given of the optimality of the solution obtained.