Saturday, June 25, 2011

METHOD IN THE CASE OF HUNGARY minimization and its application

Thesis Trio Sungkowo Andi
Problem determination (assignment) is one of the transportation problem is a special caseof linear programming problems. To solve the problem of determination usually usecommon methods is by means of permutations of n facilities to n pieces of work.
So that would be obtained n! or an alternative way of setting. This method is easy to do if nis small, but when it comes to large n these methods are less effective, because they have to find an alternative of n! fruit likely to be selected. Therefore we need another method tosolve the problem determination.
The purpose of this study is to explain how to solve the problem determination on the case of the same row with chopped chopped column (m = n) and in special cases by using themethod of Hungary.
more details download here.

0 comments:

Post a Comment

Twitter Delicious Facebook Digg Stumbleupon Favorites More

 
Design by Free WordPress Themes | Bloggerized by Lasantha - Premium Blogger Themes | Facebook Themes