Operation Research (Upvote will be given. Please write the complete solutions. No long explanation needed.)Please answer letter (a) only 3) Consider the assignment problem having the following cost table.AssigneeABCDa) Formulate the LP Model.Define VariablesSubject ToObjective FunctionNonnegativityABCD1ABCDNo.SubstractedABCD8676Total Cost Z=12b) Formulate this problem as a transportation problem by constructing theappropriate parameter table and obtain an optimal solution.123416587Task232534537466344No.Substracted

Part (A): Decision Variable: Suppose-Xij be the decision variable that assignee (1=1,2,3,4)…

3) Consider the assignment problem having the following cost table. Assignee A B D a) Formulate the LP Model. Define Variables Objective Function Subject To Nonnegativity A B C D A B C D 1 8 6 7 6 A B C D No. Substracted Total Cost Z= 1 2 1 6 5 8 7 b) Formulate this problem as a transportation problem by constructing the appropriate parameter table and obtain an optimal solution. 1 2 3 4 Task 2 3 2 5 3 4 5 3 7 3 6 6 4 4 No. Substracted

3) Consider the assignment problem having the following cost table. Assignee A B D a) Formulate the LP Model. Define Variables Objective Function Subject To Nonnegativity A B C D A B C D 1 8 6 7 6 A B C D No. Substracted Total Cost Z= 1 2 1 6 5 8 7 b) Formulate this problem as a transportation problem by constructing the appropriate parameter table and obtain an optimal solution. 1 2 3 4 Task 2 3 2 5 3 4 5 3 7 3 6 6 4 4 No. Substracted

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter6: Optimization Models With Integer Variables

Section6.5: Set-covering And Location-assignment Models

Problem 35P

See similar textbooks

Similar questions

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
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
Consider the followingg linear programming problem: Max 3A + 3Bst. 2A + 4B ≤ 12 6A + 4B ≤ 24 A, B ≥ 0 The point (0.0,6.0) is: a. the optimal solution. b. is one of the extreme points. c. infeasible. d. unbounded.
ASAP PLEASE.. The distribution of goods from the source (factory) to the target (warehouse) will cause problems regarding TRANSPORT, namely how the goods are sent from the factory to the warehouse which produces minimum costs. If it is known that - the capacity of 3 factories is 40000, 30000 and 20000, - the need for 3 warehouses is 20000, 50000 and 30000 respectively. The cost of shipping goods from the factory to the warehouse is shown in the following table Solve the above TRANSPORTATION problems with VAM and MODI
Consider the following linear programming problem: Max 3A + 3B s.t 2A + 4B < 12 6A + 4B < 24 A,B > 0 a. Find the optimal solution using the graphical solution procedure. b. If the objective function is changed to 2A + 6B, what will the optimal solution be?
General Ford produces cars at L.A. and Detroit and hasa warehouse in Atlanta; the company supplies cars tocustomers in Houston and Tampa. The cost of shipping a carbetween points is given in Table 60 (“—” means that ashipment is not allowed). L.A. can produce as many as1,100 cars, and Detroit can produce as many as 2,900 cars.Houston must receive 2,400 cars, and Tampa must receive1,500 cars.a Formulate a balanced transportation problem thatcan be used to minimize the shipping costs incurred inmeeting demands at Houston and Tampa.b Modify the answer to part (a) if shipments betweenL.A. and Detroit are not allowed.c Modify the answer to part (a) if shipments betweenHouston and Tampa are allowed at a cost of $5.
Define the decision variablesand Write a linear programming model for this problem. B. Use the Northwest-Corner Method, the Least-Cost Method and the VAM to getthe starting feasible solution.ThenFind the optimal solution using the transportation algorithm discussed in class by considering the least optimal of the objective function computed. 3.C.Formulate a network model to illustrate the optimal solution.
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?
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
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
Explain how to determine the number of variables and constraints that would be in a transportation problem simplyby knowing the number of sources and the number of destinations.
the Problem. The DISTRIBUTION UNLIMITED CO. will be producing the same new product at two different factories, and then the product must be shipped to two warehouses, where either factory can supply either warehouse. The distribution network available for shipping this product is shown in Fig. 3.13, where F1 and F2 are the two factories, W1 and W2 are the two warehouses, and DC is a distribution center. The amounts to be shipped from F1 and F2 are shown to their left, and the amounts to be received at W1 and W2 are shown to their right. Each arrow represents a feasible shipping lane. Thus, F1 can ship directly to W1 and has three possible routes (F1 → DC → W2, F1 → F2 → DC → W2, and F1 → W1 → W2) for shipping to W2. Factory F2 has just one route to W2 (F2 → DC → W2) and one to W1 (F2 → DC → W2 → W1). The cost per unit shipped through each shipping lane is shown next to the arrow. Also shown next to F1 → F2 and DC → W2 are the maximum amounts that can be shipped through these lanes. The…