Class TransportEx2
Solves a random transportation problem using both the simplex and the interior-point method.
This is a larger problem that satisfies the saturation condition
$$\sum_{i=1}^{nw}w_i = \sum_{i=1}^{ns}s_i.$$ The problem consists
of integer values only and is solved by the revised simplex and the
interior-point method. As the results indicate, the solution of the
transportation problem is not unique. In accordance with the theory of the
two solution methods, the optimal routing computed by the revised simplex
method contains integer values only while the interior-point solution can
contain non-integer values as well - even if all the source capacities and
destination requirements are integer-valued.
In this example, the revised simplex method might be slightly faster than the
interior-point method. For larger problems, due to its polynomial complexity,
the interior-point method will usually be much faster.
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
TransportEx2
public TransportEx2()
-
-
Method Details
-
main
- Throws:
Exception
-