24 views

Uploaded by Usiel Vela

Solution Problemset 4

save

You are on page 1of 5

**The following linear programming problem has been solved by The Management Scientist. Use the
**

output to answer the questions.

LINEAR PROGRAMMING PROBLEM

**MAX 25X1+30X2+15X3
**

S.T.

1) 4X1+5X2+8X3<1200

2) 9X1+15X2+3X3<1500

OPTIMAL SOLUTION

Objective Function Value = 4700.000

**Variable Value Reduced Cost
**

X1 140.000 0.000

X2 0.000 10.000

X3 80.000 0.000

**Constraint Slack/Surplus Dual Price
**

1 0.000 1.000

2 0.000 2.333

**OBJECTIVE COEFFICIENT RANGES
**

Variable Lower Limit Current Value Upper Limit

X1 19.286 25.000 45.000

X2 No Lower Limit 30.000 40.000

X3 8.333 15.000 50.000

**RIGHT HAND SIDE RANGES
**

Constraint Lower Limit Current Value Upper Limit

1 666.667 1200.000 4000.000

2 450.000 1500.000 2700.000

**a. Give the complete optimal solution.
**

b. Which constraints are binding?

c. What is the dual price for the second constraint? What interpretation does this have?

d. Over what range can the objective function coefficient of x2 vary before a new solution

point becomes optimal?

e. By how much can the amount of resource 2 decrease before the dual price will change?

**f. What would happen if the first constraint's right-hand side increased by 700 and the
**

second's decreased by 350?

ANS:

**a. x1 = 140, x2 = 0, x3 = 80, s1 = 0, s2 = 0, obj. func. = 4700
**

b. Constraints 1 and 2 are binding.

c. Dual price 2 = 2.33. A unit increase in the right-hand side of constraint 2 will increase the

value of the objective function by 2.33.

d. As long as c2

e. 1050

f.

change.

what constraints will be binding? e.t.33. x1A + x1B x2A + x2B 200 x3A + x3B x4A + x4B . 1) x1 + x2 2) 2x1 + x2 3) 2x1 + 5x2 4) x1 . ANS: Min 5x1A + 6x1B + 4x2A + 2x2B + 3x3A + 6x3B + 9x4A + 7x4B s. . Constraints 1 and 2 will be binding. c2 c. x1 = 250.t. Find the dual price for each constraint in the original problem. = 475 d. x2 a. over what range can c2 vary before there is a change in the optimal solution point? c. If the objective function becomes Min 1. func.) Question Number 3 Write the LP formulation for this transportation problem. x2 = 50. Keeping c2 fixed at 2. obj. and the objective function? d. 0. If the objective function becomes Min 7x1 + 6x2. e. Dual prices are . what will be the optimal values of x1. over what range can c1 vary before there is a change in the optimal solution point? b. x2. c1 b. Keeping c1 fixed at 1. Min x1 + 2x2 s.Question Number 2 The binding constraints for this problem are the first and second.5x1 + 2x2.33 (The first and third values are negative. ANS: a.

Min 2xAX + 3xAY + 5xAZ+ 9xBX + 12xBY + 10xBZ s. Source Supply Destination Demand A 200 X 50 B 100 Y 125 C 150 Z 125 Shipping costs are: Destination Source X Y Z A 3 2 5 B 9 10 -- C 5 6 4 (Source B cannot ship to destination Z) .t. Information about the move is given below. xAX + xAY + xAZ xBX + xBY + xBZ xAX + xBX = 300 xAY + xBY = 300 xAZ + xBZ = 300 xij ANS: Question Number 5 Canning Transport is to move goods from three factories to three distribution centers. x1A + x2A + x3A + x4A = 250 x1B + x2B + x3B + x4B = 250 all xij Question Number 4 Draw the network for this transportation problem. Give the network model and the linear programming model for this problem.

t.ANS: Min 3xAX + 2xAY + 5xAZ + 9xBX + 10xBY + 5xCX + 6xCY + 4xCZ s.t. ANS: Min 3x16 + 2x14 + 3x15 + 5x24 + 6x25 + 2x32 + 8x34 + 10x35 + 5x46 + 9x47 + 12x56 + 15x57 s. x16 + x14 + x35 x24 + x25 x23 x32 + x34 + x35 x46 + x47 x14 + x24 + x34) = 0 x56 + x57 x15 + x25 + x35) = 0 x16 + x46 + x56 = 600 . xAX + xAY + xAZ xBX + xBY xCX + xCY + xCZ xDX + xDY + xDZ xAX + xBX + xCX + xDX = 250 xAY + xBY + xCY + xDY = 125 xAZ + xBZ + xCZ + xDZ = 125 xij Question Number 6 Write the linear program for this transshipment problem.

and L3 as node 7 Min 50x13 + 500x14 + 600x23 + 450x24 + 250x35 + 300x36 + 500x37 + 350x45 + 650x46 + 450x47 s. RVW sells 10 each to three different used car lots. ANS: a. Repair Shops Used Car Lots S1 S2 L1 L2 L3 Auction 1 550 500 S1 250 300 500 Auction 2 600 450 S2 350 650 450 b. b. RVW is concerned with minimizing its total cost given the costs in the table below. Formulate this problem as a transshipment linear programming model. x13 + x14 15 x23 + x24 15 x13 + x23 x35 x36 x37 = 0 x14 + x24 x45 x46 x47 = 0 x35 + x45 = 10 x36 + x46 = 10 x37 + x4 = 10 xij 0 for all i. L2 as node 6. There are various costs associated with the average purchase and transportation prices from each auction to each repair shop. S1 as node 3. S2 as node 4. x56 + x57 = 600 Question Number 7 RVW (Restored Volkswagens) buys 15 used VW's at each of two car auctions each week held at different locations. c c. Given the costs below. a. L1 as node 5. When they are restored to RVW's specifications. Also there are transportation costs from the repair shops to the used car lots.j . draw a network representation for this problem.t. A2 as node 2. It then transports the cars to repair shops it contracts with. Report the optimal solution using excel solver. Denote A1 as node 1.

- Step by Step Optimization SUploaded byNopparut
- interior point method PaperUploaded bymanorathprasad
- emanUploaded byapi-231890132
- Ch10Uploaded byAmbosLinderoAllanChristopher
- ESI4312-Spring2014-Syllabusb(1)Uploaded bySieggy Bennicoff Yundt
- Ch2_ModelFormulationGraphicalSolution-1.pptUploaded byBob Rob
- 38-44.pdfUploaded byray m derania
- Graphical Method in ORUploaded byAli Memon
- xpress_evalguideUploaded byalleleashish
- 21331201Uploaded byPradeep Joshi
- maths 8 2Uploaded byapi-230427224
- Ampl MinosUploaded byZobayer Tushar
- Linear Programming Problems en 29-5-2012Uploaded byDustin Gamble
- lec22Uploaded byDeepak Sakkari
- Optimisation techniques Syllabus BIT Mesra.pdfUploaded byAnkit
- Portfolio Risk Analysis - Linear Programming, Solver usage in excelUploaded byJohn Carter
- Operations Management - 2Uploaded byRolly Balberan
- Quantitative TechniquesUploaded bysurajmore
- Module 3hjkhjkhjkUploaded byKrishnaPavan
- (NATO ASI Series 51) Ellis L. Johnson (Auth.), Stein W. Wallace (Eds.)-Algorithms and Model Formulations in Mathematical Programming-Springer-Verlag Berlin Heidelberg (1989)Uploaded byanant_nimkar9243
- Revenue ManagementUploaded byd3lict
- Framework for Linear Information InequalityUploaded byMichael Atallah
- Lecture 9Uploaded byKhawaja Noman Bashir
- A modified linear programming method for distribution system reconfigurationUploaded byapi-3697505
- Lecture 3.pdfUploaded bysatheeshsep24
- Linear Programming Problem (LPP)Uploaded byMahesh Rangaswamy
- EJOR_free1Uploaded bynnle
- ps3Uploaded byEhsan Spencer
- 8 or CompilationUploaded byadvancedaccountant
- Decision Analysis and Modeling - Assignment June 2018Uploaded byAvinash Kaur

- 0408Uploaded byUsiel Vela
- tecnologia_1.docUploaded byUsiel Vela
- tecnologia_1Uploaded byUsiel Vela
- Problemas ProyectoUploaded byUsiel Vela
- MODELO ENTIDAD RELACION Y RACIONAL DE LIGA DE FUTBOLUploaded byUsiel Vela
- Requerimientos - Cap 5Uploaded byUsiel Vela
- completo-manual-de-informtica.pdfUploaded byUsiel Vela
- La Ciencia sociedad y tecnologiaUploaded byUsiel Vela
- tecnologia_1.docUploaded byUsiel Vela
- tecnologia_1.docUploaded byUsiel Vela
- Tarea microeconomiaUploaded byUsiel Vela
- 4_laboratorio_de_computo_i.pdfUploaded byUsiel Vela