2. Read each of the following statements carefully and check whether it is true or false. a. In a primal-dual pair, if the dual objective function is unbounded in the dual problem, the primal problem must be infeasible. b. If the primal problem in a primal-dual pair of LPs is infeasible, the dual problem must be infeasible too. c. The typical number of simplex iterations is proportional to the number of rows in a simplex tableau and relatively insensitive to the number of variables.
Permutations and Combinations
If there are 5 dishes, they can be relished in any order at a time. In permutation, it should be in a particular order. In combination, the order does not matter. Take 3 letters a, b, and c. The possible ways of pairing any two letters are ab, bc, ac, ba, cb and ca. It is in a particular order. So, this can be called the permutation of a, b, and c. But if the order does not matter then ab is the same as ba. Similarly, bc is the same as cb and ac is the same as ca. Here the list has ab, bc, and ac alone. This can be called the combination of a, b, and c.
Counting Theory
The fundamental counting principle is a rule that is used to count the total number of possible outcomes in a given situation.
CAN U DO PART A AND B AND C
Step by step
Solved in 2 steps