Scribd
Upload
169 views3 pages

Operational Research - Midterm Exam: 1) Solution

This document contains the solutions to two optimization problems. The first problem involves optimizing the allocation of shipments from two warehouses to three customers to minimize total shipping costs. The second problem involves finding the optimal values of five decision variables to maximize an objective function while satisfying four constraints. Both problems are solved using the simplex method, transforming the initial tables into final tables with basic variables that provide the optimal solution values.

Uploaded by

siddharth_abbineni
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
Download as doc, pdf, or txt
169 views3 pages

Operational Research - Midterm Exam: 1) Solution

This document contains the solutions to two optimization problems. The first problem involves optimizing the allocation of shipments from two warehouses to three customers to minimize total shipping costs. The second problem involves finding the optimal values of five decision variables to maximize an objective function while satisfying four constraints. Both problems are solved using the simplex method, transforming the initial tables into final tables with basic variables that provide the optimal solution values.

Uploaded by

siddharth_abbineni
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
Download as doc, pdf, or txt
Download as doc, pdf, or txt
You are on page 1/ 3

Operational Research - Midterm Exam

Siddharth Abbineni 110004657

1) Solution

Customer 1 Customer 2 Customer 3

Warehouse 1 $15 $35 $25

Warehouse 2 $10 $50 $40

Cost $90 $80 $110

Customer 1:
X11+X21+X31 = 30
Customer 2:
X12+X22+X32 = 30
Customer 3:
X13+X23+X33 = 30

Let xij be the number of units from warehouse i shipped to customer j.

15x11+ 35x12+ 25x13  (Cost of shipping units from warehouse 1)

10x21+ 50x22+ 40x23  (Cost of shipping units from warehouse 2)

x11+ x12+ x13≤ 40

x21+ x22+ x23≤ 30

x11+ x21+ x31<= 30

x12+ x22+ x32<= 30

x13+ x23+ x33≥ 30


2). Solution

3X1+2X2+X3<=10

X1+4X2+X4<=11

3X1+3X2+X5<=13

Z-4X1-5X2=0

Basic Z X1 X2 X3 X4 X5 RHS
Variable
Z 1 -4 -5 0 0 0 0
X3 0 3 2 1 0 0 10
X4 0 1 4 0 1 0 11
X5 0 3 3 0 0 1 13

Operations:

R1-> R1+5R3

R2 -> R2-2R3

R3 -> 1/4R3

R4 -> R4-3R3

The Simplex table transforms into the table below.

Basic Z X1 X2 X3 X4 X5 RHS
Variable
Z 1 -2.75 0 0 1.25 0 13.75
X3 0 2.5 0 1 -0.5 0 4.5
X2 0 0.25 1 0 0.25 0 2.75
X5 0 2.25 0 0 -0.75 1 4.75

Operations

R1 -> R1+11R2/4

R2 -> 5R2/2
R3 -> R3-R2/4

R4 -> R4-9R2/4

Basic Variable Z X1 X2 X3 X4 X5 RHS

Z 1 0 0 1.1 0.7 0 18.7

X1 0 1 0 0.4 -0.2 0 18

X2 0 0 1 -0.1 0.3 0 2.3

X5 0 0 0 -0.9 -0.3 1 0.7

X1 = 1 8

X2= 2.3

Z= 18.7

There are no negative values in the first row. We can stop the transformations.

You might also like