25. In solving a linear program, no feasible solution exists. To resolve this problem we might a. add another variable b. add another constraint c. remove or relax a constraint d. try a different computer program 25. If the feasible region gets larger due to a change in one of the constraints, the optimal value of the objective function a. must increase or remain the same for a maximization problem b. must decrease or remain the same for a maximization problem c. must increase or remain the same for a minimization problem d. cannot change 2?. When alternate optimal solutions exist in an LP problem, then a. the objective function will be parallel to one of the constraints b. one of the constraints will be redundant c. two constraints will be parallel d. the problem will also be unbounded 28. If a linear program is unbounded, the problem probably has not been formulated correctly. Which of the following would most likely cause this? a. A constraint was inadvertently omitted b. An unnecessary constraint was added to the problem c. The objective function coefficients are too large d. The objective function coefficients are too small 29. A feasible solution to an LP problem a. must satisfy all of the problem's constraints simultaneously b. need not satisfy all of the constraints, only some of them c. must be a comer point of the feasible region d. must give the maximum possible profit 30. Linear programming can be used to select effective media mixes, allocate fixed or limited budgets across media, and maximize audience exposure. a. True b. False study source was downloaded by Im 7532'? from CoursoHcrct.com on 1 1-03-2022 22:33:03 GMT {15:01]