SOLUTION OF TRANSPORTATION PROBLEMS WITH BOUNDED-VARIABLES USING PC-METHOD

Abstract

The research considers transportation problems of linear programming where restrictions (greater or less) are imposed on some variables. If the first restriction doesn’t create an additional complexity then an excessive restrictions on variables require a special approach. It has been shown that these tasks could be solved applying PC-method proposed by the author.

Keywords

• linear programming
• transportation problem
• lower and upper bounded variables
• pc-method
• task “clearing”
• main and basic row
• zero variables