Matching type only. complete answers please.

Hungarian Method Choose a match Maximum Flow Techniques Choose a match Improvement Index Choose a match Problem: Where to locate a new plant? Choose a match Dummy Column Choose a match Stepping-stone method Choose a match Branch and Bound Choose a match Critical path Choose a match PERT Choose a match Arcs Choose a match mixed Integer programming Choose a match unbounded Choose a match Stepping-stone method Choose a match Branch and Bound Choose a match Critical path Choose a match PERT Choose a match Arcs Choose a match mixed integer programming Choose a match unbounded Choose a match matrix reduction Choose a match feasible region Choose a match Isoprofit Choose a match optimizing Choose a match redundant Choose a match all constraints satisfied o achieving your objective o unneeded constraints O method used to find graphical solution violates constraints cost of sacrifice infinitely large profit both integer and non-integer variables Maximum number of unit that can get through a network of roads subproblems Method to solve assignment problem Total demand is not equal to total supply O Method to solve assignment problem Total demand is not equal to total supply O Method used in sensitivity analysis o production scheduling problem Net cost of shipping one unit on presently unused route O Longest time path through network reducing assignment costs to ppportunity costs transportation problem Zero-one (Binary) programming Lines on a network Technique for moving from an initial feasible solution to an optimal feasible solution Probabilistic approach to project management