Solves a typical
Assignment Problem (AP), using the IBM ILOG CPLEX software.
The problem is solved as a Transportation Problem, i.e., with
supplies of 1 and demands of 1
(instead of the "Hungarian algorithm").
The typical problem is usually stated as
assigning jobs, J, to workers, W.
The result shows the pairs (W, J) corresponding
to minimum cost (or time, etc.). So,
in terms of an equivalent Transportation Problem,
each worker can be a source and
each job can be a destination.
(Here, the maximum cost is also computed.)
The cost data must be separated by standard characters:
space, tab (such as from Excel by copy-paste) or csv,
in coherent American or European style.
With the base data, the problem gives
zMIN = 61 (zMAX = 92).
A graph is done showing the costs for each
assignment, their sum being obviously the minimum cost computed.
Acknowledgements: See CPLEX problem. | 
