thể transportation problem having the following parameter table: Destination 1 2 3. 4. Supply 1. 6. 7. 20 Source 5. 8 30 6. 4(D) 30 20 0. Demand 25 20 10 20 After several iterations of the transportation simplex method, a BF solution is obtained that has the following basic variables: x3 X2 = 25, x4-5. x 25, x34 = 5, X42 = 0, x13 = 0, XIS Continue the transportation simplex method for two more iterations by hand. After two iterations, state whether the solution is optimal and, if so, why. 20, 0, X43 0. X15 20. 5700 1460 25 8649000 -234

thể transportation problem having the following parameter table: Destination 1 2 3. 4. Supply 1. 6. 7. 20 Source 5. 8 30 6. 4(D) 30 20 0. Demand 25 20 10 20 After several iterations of the transportation simplex method, a BF solution is obtained that has the following basic variables: x3 X2 = 25, x4-5. x 25, x34 = 5, X42 = 0, x13 = 0, XIS Continue the transportation simplex method for two more iterations by hand. After two iterations, state whether the solution is optimal and, if so, why. 20, 0, X43 0. X15 20. 5700 1460 25 8649000 -234

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter7: Nonlinear Optimization Models

Section7.7: Portfolio Optimization Models

Problem 41P

See similar textbooks

Similar questions

If a monopolist produces q units, she can charge 400 4q dollars per unit. The variable cost is 60 per unit. a. How can the monopolist maximize her profit? b. If the monopolist must pay a sales tax of 5% of the selling price per unit, will she increase or decrease production (relative to the situation with no sales tax)? c. Continuing part b, use SolverTable to see how a change in the sales tax affects the optimal solution. Let the sales tax vary from 0% to 8% in increments of 0.5%.
Another way to derive a demand function is to break the market into segments and identify a low price, a medium price, and a high price. For each of these prices and market segments, we ask company experts to estimate product demand. Then we use Excels trend curve fitting capabilities to fit a quadratic function that represents that segments demand function. Finally, we add the segment demand curves to derive an aggregate demand curve. Try this procedure for pricing a candy bar. Assume the candy bar costs 0.55 to produce. The company plans to charge between 1.10 and 1.50 for this candy bar. Its marketing department estimates the demands shown in the file P07_47.xlsx (in thousands) in the three regions of the country where the candy bar will be sold. What is the profit-maximizing price, assuming that the same price will be charged in all three regions?
Set up the simplex matrix used to solve the linear programming problem. Assume all variables are nonnegative. Maximize f = 8x + 9y + 3z subject to 2x + 7y + 8z ≤ 100 6x + 3y + z ≤ 160 3x + 4y + 9z ≤ 10 .
Consider the following LP problem developed at Zafar Malik's Carbondale, Illinois, optical scanning firm: Maximize Z= 1X1+1X2 Subject to: 2X1+1X2≤100 (C1) 1X1+2X2≤100 (C2) X1,X2≥0 Part 2 The optimum solution is: Part 3 X1= ______ (round your response to two decimal places).
Analyze algebraically what special case in simplex application is present in each of the LP model below. Give an explanation to support your answer. a) Maximize z = 4x1 + 2x2 Subject to: 2x1 - x2 ≤ 2 3x1 - 4x2 ≤ 8 x1, x2 ≥ 0b) Maximize z = 3x1 + 2x2 Subject to: 4x1 - x2 ≤ 8 4x1 + 3x2 ≤ 12 4x1 + x2 ≤ 8 x1, x2 ≥ 0
25. Consider the following list of retail items sold in a small neighborhood gift shop.Average ProfitItem Annual Volume per ItemGreeting cards 3,870 $ 0.40T-shirts 1,550 1.25Men’s jewelry 875 4.50Novelty gifts 2,050 12.25Children’s clothes 575 6.85Chocolate cookies 7,000 0.10Earrings 1,285 3.50Other costume jewelry 1,900 15.00a. Rank the item categories in decreasing order of the annual profit. Classify eachin one of the categories as A, B, or C.b. For what reason might the store proprietor choose to sell the chocolate cookieseven though they might be her least profitable item?
Confederate Express Service is attempting to determinehow its shipping costs for a month depend on the numberof units shipped during a month. For the last 15 months, thenumber of units shipped and total shipping cost are given inTable 24 (file Ship.xls). Units TotalMonth Shipped Shipping Cost1 300 $1,0602 400 $1,3803 500 $1,6404 200 $7405 300 $1,0606 350 $1,1907 460 $1,5208 480 $1,5809 120 $54010 760 $2,42011 580 $2,20012 340 $1,47013 120 $79014 100 $72015 500 $1,960
For the products A, B, C, and D, which of the following could be a linear programming objective function? Select one: a. Z = 1A + 2BC + 3D b. Z = 1A + 2AB + 3ABC + 4ABCD c. Z = 1A + 2B + 3C + 4D d. Z = 1A + 2B/C + 3D
b) Consider the LP below:Solve using the big M- methodMinimize Z = 20X1 + 10X2s.t X1 + 2X2 ≤ 403X1 + X2 ≥ 304X1 + 3X2 ≥ 60X1, X2, ≥ 0
Chapter 6. Solve the following Linear Program using the Solver method and answer the questions given below (round to two decimal places): Maximize 12A + 15B s.t. 3A + 7B <= 250 5A + 2B <= 200 B <= 25 A, B >= 0 a. The optimal value of A is 31.03 and the optimal value of B is 22.41. b. The maximized function yields a solution of 708.62. Chapter 7. For the problem you solved in Q1, obtain the Sensitivity Report, and answer the following questions. Remember to round to two digits and you can enter “infinity” for unlimited regions: The range for Variable A is from ????? to ????? The range for Variable B is from ????? to ????? The range for Constraint 1 is from ????? to ????? The range for Constraint 2 is from ????? to ????? The range for Constraint 3 is from ????? to ?????
Given four decision variables A, B, C, and D, which of the following could be a linear programming problem constraint? 1A + 2B - 1C/D >=23 1A + 2A*B + 3A*B/C + 4A*B*C*D >=100 1A + 2B + 3C + 4D >=100 1A + 2B/C + 3D <=45 1A + 2B*C + 3D <=100
The number of crimes in each of a city’s three policeprecincts depends on the number of patrol cars assigned toeach precinct (see Table 11). Five patrol cars are available.Use dynamic programming to determine how many patrolcars should be assigned to each precinct. No. of Patrol Cars Assigned to PrecinctPrecinct 0 1 2 3 4 51 14 10 7 4 1 02 25 19 16 14 12 113 20 14 11 8 6 5