Match the following types of Linear Programming problems with their characteristics:
Problem Type Characteristic
1) Simplex Method A) An algorithm for solving linear programs by moving along the edges of the feasible region.
2) Duality Theorem B) Every linear programming problem has an associated dual problem.
3) Integer Linear Programming C) A method where the decision variables must take integer values.
4) Transportation Problem D) A special case of linear programming where the objective is to minimize the cost of transporting goods between sources and destinations.
1
1-A, 2-B, 3-C, 4-D
2
1-B, 2-C, 3-D, 4-A
3
1-D, 2-A, 3-B, 4-C
4
1-C, 2-A, 3-D, 4-B