Use the graphical solution procedure to find the optimal solution. b. Assume that the objective function coefficient for X changes from 8 to 6. Does the optimal solution change? Use the graphical solution procedure to find the new optimal solution. Assume that the objective function coefficient for X remains 8, but the objective func- tion coefficient for Y changes from 12 to 6. Does the optimal solution change? Use the graphical solution procedure to find the new optimal solution. a. с.

(d) A company has three factories. Each factory produces three different products (A, B and C). Factory 1 has a daily production capacity production of 8 units of A, 4 units of B and 8 units of C. Factory 2 has a daily production capacity of 6 units of A, 6 units of B and 3 units of C. Factory 3 has a production capacity of 12 units of A, 4 units of B and 8 units of C. The total demand for product A is 300 units, for product B is 172 units and for product C is 250 units. The daily operating cost for Factory 1 is $55 for Factory 2 is $60 and for Factory 3 How many days should each factory be operated in order to fill the total demand and the keep the operating cost at a minimum? (i) (ii) (iii) $50. Show a model that represents the company's problem. Write down the dual maximization problem. Write down the initial simplex tableau.

do fast

9.5 Capital Healthplans Inc. is evaluating two different methods for providing home health services to its members. Both methods involve contracting out for services, and the health outcomes and revenues are not affected by the method chosen. Therefore, the net cash flows for the decision are all outflows. Here are the projected flows:   Year Method A ($) Method B ($) 0 (300,000) (120,000) 1 (66,000) (96,000) 2 (66,000) (96,000) 3 (66,000) (96,000) 4 (66,000) (96,000) 5 (66,000) (96,000)   What is each alternative’s IRR? If the opportunity cost of capital for both methods is 9 percent, which method should be chosen? Why?

Fopic 4- Linear Programming: Appli eBook Problem 9-05 (Algorithmic) Kilgore's Deli is a small delicatessen located near a major university. Kilgore's does a large walk-in carry-out lunch business. The deli offers two luncheon chili specials, Wimpy and Dial 911. At the beginning of the day, Kilgore needs to decide how much of each special to make (he always sells out of whatever he makes). The profit on one serving of Wimpy is $0.46, on one serving of Dial 911, $0.59. Each serving of Wimpy requires 0.26 pound of beef, 0.26 cup of onions, and 6 ounces of Kilgore's special sauce. Each serving of Dial 911 requires 0.26 pound of beef, 0.41 cup of onions, 3 ounces of Kilgore's special sauce, and 6 ounces of hot sauce. Today, Kilgore has 21 pounds of beef, 16 cups of onions, 89 ounces of Kilgore's special sauce, and 61 ounces of hot sauce on hand. a. Develop a linear programming model that will tell Kilgore how many servings of Wimpy and Dial 911 to make in order to maximize his profit today.…

Consider the following LP problem: Min 6X+ 27Y Subject to : 2 X + 9Y => 25, and X + Y <= 75. Pick a suitable statement for this problem: a. X=37.5, Y=37.5 is the only optimal solution. b. Optimal Obj. function value is 75 c. X = 0, Y = 0 is the only optimal solution. d. Optimal Obj. function value is 0

do fast

Suppose my utility function for asset position x is givenby u(x) ln x.a Am I risk-averse, risk-neutral, or risk-seeking? b I now have $20,000 and am considering the follow-ing two lotteries: L1: With probability 1, I lose $1,000.L2: With probability .9, I gain $0.L2: With probability .1, I lose $10,000.Determine which lottery I prefer and the risk premium of L2.

Let’s consider the following LP problem:   min            Subject to:                                                                                                      Solve the problem with the graphic method.

1. To find the optimal solution to a linear programming problem using the graphical method a. find the feasible point that is the farthest away from the origin. b. find the feasible point that is at the highest location. c. find the feasible point that is closest to the origin. d. None of the alternatives is correct. Let xij = the production of product i in period j. To specify that production of product 1 in period 3 and in period 4 differs by no more than 100 units, which of the following constraints are correct? P13 - P14 <  100;   P14 - P13  <  100 (a) P13 - P14 <  100;   P13 - P14  >  100 (b) P13 - P14 <  100;   P14 - P13  >  100 (c) P13 - P14 >  100;   P14 - P13  >  100 (d) 3. Whenever all the constraints in a linear program are expressed as equalities, the linear program is said to be written in a. standard form. b. bounded form. c. feasible form. d. alternative form.