choose a rou te that is not the best, the on ly penalt y is to perfor m a d d itional iterations. 7) T he transportation algorithm can be used to sol ve both m ini mi z ation p roblems and m axi mi zation problems. 8) A ssign m ent problems i n v ol ve determin i ng th e most efficien t assig n ment of people to projects, salesmen to territories, contracts to bi d ders, an d so on. 9) T he objecti ve of an assign m ent proble m solution most often is to m in imi z e the total costs or ti m e of p erform…
Words 6162 - Pages 25