Show your step-by-step process using THE SPECIAL PURPOSE LINEAR PROGRAMMING: TRANSPORTATION STEPPING STONE METHOD to solve this problem.
XYZ Incorporated has received a contract to supply gravel to three new road projects located at three different locations. Project A needs 174 truckloads, Project B needs 204 truckloads, and Project C needs 143 truckloads. The company has three gravel warehouses located in three different places. Warehouse 1 has 158 truckloads available, warehouse 2 has 184, and warehouse 3 has 179. The cost of transportation from the warehouse to the projects are: from warehouse 1 to Projects A, B, C = Php 4, Php 8, Php 8 per truckload respectively. From warehouse 2 to Projects A, B, C = Php 16, Php 24, Php 16 per truckload respectively. From warehouse 3 to Projects A, B, C = Php 8, Php 16, Php 24 per truckload respectively. The objective is to design a plan of distribution that will Minimize the cost of transportation.
Step by stepSolved in 3 steps with 2 images
- A theater is presenting a program on drinking and driving for students and their parents or other responsible adults. The proceeds will be donated to a local alcohol information center. Admission is $10.00 for adults and $5.00 for students. However, this situation has two constraints: the y heather can hold no more than 210 people and for every two adults, there must be at least one student. How many adults and students should attend to raise the maximum amount of money? To raise the maximum amount of money, how many adults and how many students should attend?arrow_forwardA manufacturer of refrigerators must ship at least 100 refrigerators to its two warehouses. Each warehouse holds a maximum of 100 refrigerators. Warehouse A holds 40 refrigerators already, while warehouse B has 15 on hand. It costs $10 to ship a refrigerator to warehouse A and $14 to ship one to warehouse B. How many refrigerators should be shipped to each warehouse to minimize cost? Find the objective function and the constraints for the above problem.arrow_forwardPerth Mining Company operates two mines for the purpose of extracting gold and silver. The Saddle Mine costs $30,000/day to operate, and it yields 50 oz of gold and 3000 oz of silver each of a day The Horseshoe Mine costs $16,000/day to operate, and it yields 75 oz of gold and 1000 oz of silver each of y day. Company management has set a target of at least 650 oz of gold and 18,000 of silver. (a) How many days should each mine be operated so that the target can be met at a minimum cost? The minimum is C - 288000 at (x,y)-(0,18 (b) Suppose C cx + 16,000y. Find the range of values that the Saddle Mine's daily operating cost, the coefficient c of x, can assume without changing the optimal auton SCS (c) Find the range of values that the requirement for gold can assume. s (requirement for gold) s (d) Find the shadow price for the requirement for gold. (Round your answer to the nearest cent.) Sarrow_forward
- Solve the following linear programming problem. You are taking two dietary supplements daily: Supplement A and Supplement B. An ounce of supplement A contains 9 units of calcium, 8 units of vitamin D, and 5 units of sodium. An ounce of supplement B contains 2 units of calcium, 4 units of vitamin D, and 3 units of sodium. Your goal is to get at least 90 units of calcium and at least 120 units of vitamin D from the supplements daily, while at the same time reducing the amount of sodium that you will get. How many ounces of each supplement should you take daily to reach your goals? Ounces of Supplement A = Blank 1. Fill in the blank, read surrounding text. Ounces of Supplement B = Blank 2. Fill in the blank, read surrounding text. How many units of sodium will you get daily under these circumstances? Units of Sodium = Blank 3. Fill in the blank, read surrounding text.arrow_forwardFormulate but do not solve the following exercise as a linear programming problem.. TMA manufactures 37-in. high-definition LCD televisions in two separate locations: Location I and Location II. The output at Location I is at most 5500 televisions/month, whereas the output at Location II is at most 4700 televisions/month. TMA is the main supplier of televisions to Pulsar Corporation, its holding company, which has priority in having all its requirements met. In a certain month, Pulsar placed orders for 2600 and 3700 televisions to be shipped to two of its factories located in City A and City B, respectively. The shipping costs (in dollars) per television from the two TMA plants to the two Pulsar factories are as follows. From TMA Location I Location II Minimize TMA will ship x televisions from Location I to City A and y televisions from Location I to City B. Find a shipping schedule that meets the requirements of both companies while keeping costs, C (in dollars), to a minimum.…arrow_forwardUse Excel to solve the linear programming problem.At one of its factories, a manufacturer of televisions makes one or more of four models of HD units (without cases): a 20-in. LCD, a 42-in. LCD, a 42-in. plasma, and a 50-in. plasma. The assembly and testing time requirements for each model are shown in the table, together with the maximum amounts of time available per week for assembly and testing. In addition to these constraints, the supplier of cases indicated that it would supply no more than 290 cases per week and that of these, no more than 40 could be for the 20-in. LCD model.Use the profit for each television shown in the table to find the number of completed models of each type that should be produced to obtain the maximum profit for the week. Find the maximum profit. 20-in. LCD sets 42-in. LCD sets 42-in. plasma sets 50-in. plasma sets profit $ 20-in.LCD 42-in.LCD 42-in.Plasma 50-in.Plasma TotalAvailable Assembly time…arrow_forward
- Advanced Engineering MathematicsAdvanced MathISBN:9780470458365Author:Erwin KreyszigPublisher:Wiley, John & Sons, IncorporatedNumerical Methods for EngineersAdvanced MathISBN:9780073397924Author:Steven C. Chapra Dr., Raymond P. CanalePublisher:McGraw-Hill EducationIntroductory Mathematics for Engineering Applicat...Advanced MathISBN:9781118141809Author:Nathan KlingbeilPublisher:WILEY
- Mathematics For Machine TechnologyAdvanced MathISBN:9781337798310Author:Peterson, John.Publisher:Cengage Learning,