Find the initial basic feasible solution of the following transportation problem by The Least Cost Method and then optimize the solution using U-V Method: Destination Supply DI D2 D3 D4 Source 4 5 11 300 S2 8 7 11 1200 S3 10 13 100 Demand 400 200 600 400 7, 4. 9.

Find the initial basic feasible solution of the following transportation problem by The Least Cost Method and then optimize the solution using U-V Method: Destination Supply DI D2 D3 D4 Source 4 5 11 300 S2 8 7 11 1200 S3 10 13 100 Demand 400 200 600 400 7, 4. 9.

Name: Find the initial basic feasible solutionof the following transportati
Uploaded: 2024-03-20T07:07:26.000Z
Channel: Bartleby
Description: Find the initial basic feasible solutionof the following transportationproblem by The Least Cost Methodand then optimize the solution usingU-V Method:DestinationSourceSupplyD1 D2 D3 D411300S258711 1200S310 913 100Demand 400 200 600 4007.4.4.

Advanced Engineering Mathematics

10th Edition

ISBN:9780470458365

Author:Erwin Kreyszig

Publisher:Erwin Kreyszig

Chapter2: Second-order Linear Odes

Section: Chapter Questions

Problem 1RQ

See similar textbooks

Similar questions

Find the initial feasible solution using. (i) North West corner method (ii) VAM method Also compare both results. TO From A B C D Supply I 12 4 9 5 55 II 8 1 6 6 45 III 1 12 4 7 30 Demand 40 20 40 20
What is the requirement of initial basic feasible solution in transportation Problem. Which method is most suitable for solving Transportations problem? Find the initial feasible solution using. (i) NWCR method (ii) VAM method Also compare both results. TO From A B C D Supply I 12 4 9 5 55 II 8 1 6 6 45 III 1 12 4 7 30 Demand 40 20 40 20
consider the transportation problem presented in the following table: D1 D2 D3 D4 SUPPLY S1 19 30 50 10 7 S2 70 30 40 60 9 S3 40 8 70 20 18 Demand D5 8 7 14 find initial feasible solution using Vogel's Approximation method (VAM), also find optimal solution using stepping-stone method.
Justify answer using complementary slackness and give optimal solution also to the dual aswell.
Use the least optimal initial basic feasible solution from (a) as your starting point to find the optimal solution.
To minimize costs on the production line, an industrial engineer at a fiber-optic manufacturing firm is considering two robots. Robot X would have a $82,000 first cost, a $30,000 annual maintenance and operation (M&O) cost, and $50,000, $42,000, and $35,000 salvage prices after 1, 2, and 3 years, respectively. Robot Y will have a first cost of $97,000, a yearly M&O cost of $27,000, and after 1, 2, and 3 years, respectively, salvage prices of $60,000, $51,000, and $42,000. If a 2-year study period is specified at an interest rate of 15 percent per year and replacement after 1 year is not an option, what robot should be selected?
Consider the LP model and its corresponding graph below. Maximize z = 5x + 4ySubject to:3x + 2y <= 12x + 2y >= 8x >= 0y >= 0 From the given graph, what are the corner points of the feasible region? What are the values of x and y for the optimal solution? What is the maximum value of z?
Use Euler's method with step size 0.25 to compute the approximate y-values y1, y2,y3, and y4 of the solution of the initial-value problem y1= ,y2= ,y3= ,y4=
Find the value of the unknown variables and the maximum profit using the simplex method. Maximize Z: 6x1 + 5x2Subject to:1) 2x1 + x2 = 122) 2x1 + 3x2≤ 243) 2x1 + 9x2≥ 36 II. Procedures1. Set up the new programs with slack variables.2. Make the initial table and enter the needed data.3. Compute the Zj values.4. Compute the Cj – Zj values.5. Identify the optimum column.6. Determine the pivotal row.7. Construct the table II with the replacing row.8. Complete the table entries indicating the optimum solution and pivotal row.9. Construct table III replacing row and complete the entries by providing the necessary data to complete the table.10.Continue the process until you reach the optimum table/solution.11.Make a decision from the optimum table.
Use Euler's method with step size 0.5 to compute the approximate y-values y1, y2, y3 and y4 of the solution of the initial-value problem y' = y − 3x, y(2) = 2. y1 = y2 = y3 = y4 =
THE PINEAPPLE HARVESTING SEASON IN BACOLOD IS SHORT , AND MOST FARMERS DELIVER THEIR TRUCKLOADS OF PINEAPPLE TO A GIANT CENTRAL STORAGE BIN WITHIN A TWO - WEEK SPAN . BECAUSE OF THIS , PINEAPPLE - FILLED TRUCKS WAITING TO UNLOAD AND RETURN TO THE FIELDS HAVE BEEN KNOWN TO BACK UP FOR A BLOCK AT THE RECEIVING BIN . THE CENTRAL BINJ IS OWNED COOPERATIVELY, AND IT IS TO EVERY FARMER'S BENEFIT TO MAKE THE UNLOADING/STORAGE PROCESS AS EFFICIENT AS POSSIBLE. THE COST OF PINEAPPLE DETERIORATION CAUSED BY UNLOADING DSELAYS AND THE COST OF TRUCK RENTAL AND IDLE DRIVER TIME ARE SIGNIFICANT CONCERNS TO THE COOPERATIVE MEMBERS . ALTHOUGH FARMERS HAVE DIFFICULTY QUANTIFYING CROP DAMAGE, IT IS EASY TO ASSIGN A WAITING AND UNLOADING COST FOR TRUCK AND DRIVER OF P 18 PER HOUR . THE STORAGE BIN IS OPEN AND OPERATED 16 HOURS PER DAY AND 7 DAYS PER WEEK DURING THE HARVEST SEASON AND IS CAPABLE OF UNLOADING , 35 TRUCKS PER HOUR ACCORDING TO AN EXPONENTIAL DISTRIBUTION . FULL TRUCKS ARRIVE ALL…
A function, z = ax + by, is to be optimized subject to the constraint, x2 + y2=1 where a and b are positive constants. Use Lagrange multipliers to show that this problem has only one solution in the positive quadrant (i.e. in the region x > 0, y > 0) and that the optimal value of z is √a2 +b2.