AssignmentFind the initial solution of the given transportation problem using the 3 methods.Suppose a manufacturing company owns three factories (sources) and distribute hisproducts to five different retail agencies (destinations). The following table showsthe capacities of the three factories, the quantity of products required by the variousretail agencies and the cost of shipping one unit of the product from each of thethree factories to each of the five retail agencies.Factories11 21 924 121433Requirement 100 6023Retail Agency313161504 535 5020 123 2650 40Capacity50100150300✓

Find the Given details below: Given details: Retail Agency Factories 1 2 3 4 5 Capacity…

Answered: Find the initial solution of the given…

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter2: Introduction To Spreadsheet Modeling

Section: Chapter Questions

Problem 20P: Julie James is opening a lemonade stand. She believes the fixed cost per week of running the stand...

See similar textbooks

Similar questions

TRANSPORTATION METHOD: INSTRUCTIONS: Solve for the optimal distribution and cost of transportation using the given problem below. Show all solution. GIR Company received a contract to supply unleaded gasolne to four different locations Project A needs 60,000 iters, Project Bneeds 90,000 liters, Project Oneeds 20,000 liters, and Product D needs 30,000 liters. The company has two depot located in two different places, Depot 1 har 220.000 liters available and Depot 2 has 80,000 sters wal sole. Cost to Transport Project Project B Project C Proxecto 5 7 13 Depot 1 Depot 2 8 6 B B SIMPLEX METHOD: Instruction Detamine the optimal solution Mimiz 50XL -20 X2 Subject to X1 420 X1 X2 248
Consider the transportation table below. REQUIREDa. Define the decision variablesb. Write a linear programming model for this problem.c. Use the Northwest-Corner Method, the Least-Cost Method and the VAM to getthe starting feasible solution.d. Find the optimal solution using the transportation algorithm discussed in class by considering the least optimal of the objective function computed in (c).e. Formulate a network model to illustrate the optimal solution
Problem 7-14 (pg 278) Using the following equations, graph the constraints and solve using the corner point approach ONLY. Let: X1 = number of air conditioners to be produced X2 = number of fans to be produced Maximize profit = 25X1 + 15X2 subject to 3X1 + 2X2 <= 240 (wiring) 2X1 + 1X2 <= 140 (drilling) X1, X2 >= 0
Consider the followingg linear programming problem: Max 3A + 3Bst. 2A + 4B ≤ 12 6A + 4B ≤ 24 A, B ≥ 0 The point (4.0,0.0) is: a. unbounded. b. is one of the extreme points. c. the optimal solution. d. infeasible.
Transportation Problem: A semi-products manufacturer has 3 production facilities (X, Y, Z) and distributes its products to 3 various customers (K, L, M) from these production facilities. The daily production capacity of each production facility and the daily distribution costs are given in the below table. Daily demands of customers are 42, 27, and 33, respectively. Namely, in a day, customer K requires 42 units of products, customer L requires 27 units of products, and customer M requires 33 units of products. (a) Formulate a balanced transportation problem that could be used to determine how to minimize the total cost of meeting the demand of customers. The formulation should be in open form and decision variables should be defined as integer amounts. (b) Use LINGO/OPL/EXCEL to solve your model. Write down the results of the decision variables and the objective function. Explain the value of the decision variables. What do they mean? (c) Use the Northwest Corner method to find a…
Problem 7-18 (pg 279) Using the following equations, graph the constraints and solve using the corner point approach. X1 = number of undergraduate courses X2 = number of graduate courses Minimize cost = $2,500X1 + $3,000X2 subject to X1 >= 30 X2 >= 20 X1 + X2 >= 60 X1, X2 >= 0
Consider the followingg linear programming problem: Max 3A + 3Bst. 2A + 4B ≤ 12 6A + 4B ≤ 24 A, B ≥ 0 The point (0.0,0.0) is: a. infeasible. b. is one of the extreme points. c. the optimal solution. d. unbounded
Two plants supply three customers with medical supplies. The unit costs of shipping from the plants to the customers, along with the supplies and demands, are given in Table below. The company’s goal is to minimize the cost of meeting customers’ demands. From To Customer 1 Customer 2 Customer 3 Supply Plant 1 55 65 80 35 Plant 2 10 15 25 50 Demand 10 10 10 Formulate a linear programming (LP) model for this problem. Use solver to find the optimal transportation rule As a management science student, the MD of the company seeks your expert advice on ways in which to determine the optimal transportation rule. Advise the MD, providing detailed explanation using your answer obtain in (b). Write your answer in a form of a report to the MD.
1. Consider the following linear programming formulation: Min 5x + 2y Subject to (1) 3x + 6y ≥ 18 (2) 5x + 4y ≥ 20 (3) 8x + 2y ≥ 16 (4) 7x + 6y ≤ 42 (5) x, y ≥ 0 a. Solve the problem graphically. Specifically, show each constraint and the feasible region, draw an objective function line and identify an optimal point (the solution). When reporting the optimal solution and the corresponding objective function value, you may estimate the optimal x and y values from the graph. b. What are the optimal values of x and y, using the solver add-in? What is the corresponding value of the objective function? c. How many extreme points does the feasible region have? Enumerate them. Hint: It's from the graph. d. Change the objective function to 15x + 12y.. What is the new optimal solution(s)?
(5) Consider the following linear programming model with 4 regular constraints:Maximize 3X + 5Y (a) Draw your graph in the space below:subject to: 4X + 4Y ≤ 48 (constraint #1) 4X + 3Y ≤ 50 (constraint #2) 2X + 1Y ≤ 20 (constraint #3) X ≥ 2 (constraint #4) X, Y ≥ 0 (non-negativity constraints)(a) Which of the constraints is redundant? Constraint #______.Justify by drawing a graph similar to Figure 7.14 on p.263.(b) Is point (9,3) a feasible solution? _____. Explain your answer (by analyzing each of the constraints).Constraint #1: _______________________________________________________________Constraint #2: _______________________________________________________________Constraint #3: _______________________________________________________________Constraint #4: _______________________________________________________________(c) Which of the following points yields the best solution? Underline the best solution: (7,5), (9,2), (6,6).Justify your answer (using the data from the above LP…
A linear programming problem is given as follows:min ? = −4?1 + ?2Subject to 8?1 + 2?2 ≥ 164?1 + 2?2 ≤ 12?1 ≤ 6?2 ≤ 4?1, ?2 ≥ 0 I) Find the A, B, C, D, E, F, and G points on the plot below II) Identify the feasible solution area graphically on the following plot (by shading thearea) III) Which points are the extreme points IV) What is the solution of the optimization problem? (x1=?,x2=?,z=?) Show your work V) Which change will make the problem have multiple optimal solutions? If there is more than one answer, choose all.a) Increase of the coefficient of ?1 on the objective function to 4b) Increase of the coefficient of ?1 on the objective function to 2c) Decrease of the coefficient of ?1 on the objective function to -8d) Increase of the coefficient of ?2 on the objective function to -8e) None VI) If new constraints, ?1≤4 and ?2≤6, are added to the given problem, what effect will be? (choose all the effects)a) The feasible solution area will be smaller.b) The feasible solution area will…
Consider the following linear program: Max 3A + 3B S.t. 2A + 4B < 12 6A + 4B < 24 A, B > 0 Find the Optimal Solution using the graphical solution procedure If the objective function is changed to 2A + 6B, what will the optimal solution be? How many extreme points are there? What are the values of A and B at each extreme point?

SEE MORE QUESTIONS

Recommended textbooks for you

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

Operations Management

ISBN:

9781259667473

Author:

William J Stevenson

Publisher:

McGraw-Hill Education

Operations and Supply Chain Management (Mcgraw-hi…

Operations Management

ISBN:

9781259666100

Author:

F. Robert Jacobs, Richard B Chase

Publisher:

McGraw-Hill Education

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

Operations Management

ISBN:

9781259667473

Author:

William J Stevenson

Publisher:

McGraw-Hill Education

Operations and Supply Chain Management (Mcgraw-hi…

Operations Management

ISBN:

9781259666100

Author:

F. Robert Jacobs, Richard B Chase

Publisher:

McGraw-Hill Education

Business in Action

Operations Management

ISBN:

9780135198100

Author:

BOVEE

Publisher:

PEARSON CO

Purchasing and Supply Chain Management

Operations Management

ISBN:

9781285869681

Author:

Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. Patterson

Publisher:

Cengage Learning

Production and Operations Analysis, Seventh Editi…

Operations Management

ISBN:

9781478623069

Author:

Steven Nahmias, Tava Lennon Olsen

Publisher:

Waveland Press, Inc.

SEE MORE TEXTBOOKS