1. Different from general linear programming problems, linear programming problems may have infinite optimal solutions, while transportation problems only have finite optimal solutions.

2. The elements of the constraint coefficient matrix of transportation problem are equal to 0 or1; Each column has two non-zero elements.

3. The number of solutions of transportation problem cannot be greater than (m+n- 1).

Extended data:

Three elements of mathematical model of linear programming;

(1) decision variables;

(2) Target condition: the linear function of multiple decision variables is usually a problem of finding the maximum or minimum; ?

(3) Constraint: a set of linear equality or inequality of multiple decision variables;

Simplex method is the basic method to solve linear programming problems. The standard software with simplex method can solve the linear programming problem with constraints and decision variables exceeding 10000 on the computer.

In order to improve the speed of solving problems, there are modified simplex method, dual simplex method, original dual method, decomposition algorithm and various polynomial time algorithms. Simple linear programming problems with only two variables can also be solved graphically.