Question

3. 1-10 are True/False questions, Please write True (T) or False (F) next to each question 11-20 are multiple choice questions, Please circle the correct answer for each question.(20) 1. The linear programming approach to media selection problems is typically to either maxim The use of LP in solving assignment problems yields solutions of either O or 1 for each An infeasible solution may sometimes be the optimal found by the corner point method the number of ads placed per week or to minimize advertising costs 2. variable in the formulation.T 3. 4. Any time that we have an isoprofit line that is paralel to a constraint, we have the posablity of multiple solutions. T 5. Sensitivity analysis looks only at the effects.of changing the coefficients in the objective function. 6. In a maximization LP problem/ if one or more of the variables and the profit can be made infinitely large without violating any constraints,then the solution is unbounded. 7. Transporting goods from several orißins to several destinations efficiently s called the 8. The transportation problem is a special case of the more general assignment problem.T 9. In the linear programming transportation model, the coefficients of the objective function 10. If a constraint has a positive shadow price in a minimization problem,the.resource for that transportation problem.T can represent either the cost or the profit from shipping goods along a particular route. constraint should be increased to improve the objective function value.T blem may result in_ trainttoau (maximization) prob ha obiective function