1. In converting a less - than - or - equal constraint for use in a simplex table, we must add A- bsurplus variable B- slack variable C- an artificial variable. both a surplus and a slack variable D- none of the above 2. The slack value is the amount of the resource, as represented by the less - than - or equal constraint, that is not being used. When a greater - than - or - equal constraint is not binding, then the surplus is the extra amount over the constraint that is being produced or utilized. This statement is: A-Ture BFalse 3. The Transportation Method of linear programming is applied to the problems related to the study of the efficient transportation routes i.e. how efficiently the product from different sources of production is transported to the different destinations such as the total transportation cost is minimum. This statement is: A-Ture B-False C-It can be add to the above the statement maximizing 4. In a transportation problem, we must make the number of and equal . A- destinations sources B-units supplied units demanded C-columns rows D-positive cost coefficients negative cost coefficients E-warehouses suppliers 5. In the simplex method every variable of the LP is