Scribd
Upload
225 views4 pages

(C) PMGT 201 Sol Exam1 09-10

The document describes three linear programming problems. The first two problems involve graphically solving linear programs to minimize or maximize objective functions subject to constraints. The third problem presents a transportation problem where the goal is to minimize total transportation costs by determining the optimal amounts to ship from three warehouses to three stores to meet demand, given supply and cost constraints.

Uploaded by

bndayel
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
225 views4 pages

(C) PMGT 201 Sol Exam1 09-10

The document describes three linear programming problems. The first two problems involve graphically solving linear programs to minimize or maximize objective functions subject to constraints. The third problem presents a transportation problem where the goal is to minimize total transportation costs by determining the optimal amounts to ship from three warehouses to three stores to meet demand, given supply and cost constraints.

Uploaded by

bndayel
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 4

Operations Management PMGT 201 2009-2010 (1)

Exam1 (B)

Student Name: ---------------------------------------------- Section: -------------------------


ID: ----------------------------------------------------------- Teacher:-------------------------

Exercise 1:

Solve the following liner programming model graphically:


Minimize Z= 6x + 3y
Subject to:
2x + 4y 16
4x + 3y
x,y .

SOLUTION:

Sol:
1:
x + 2y = 10
x= 0 → 2y = 10 → y= 5 → (0,5)
y= 0 → x = 10 → x= 10 → (10,0)
2:
6x + 6y = 36
x= 0 → 6y = 36 → y= 6 → (0,6)
y= 0 → 6x = 36 → x= 6→ (6,0)

x + 2y = 10 → ×-6
6x + 6y = 36
-------------------
-6x – 12y = -60
6x + 6y = 36
-------------------
-6y = -24
y= 4
x + 2(4) = 10
x + 8 = 10
x=2
Z= 4x + 5y
A(0,0) → 4(0) + 5(0) =0
B(4,0) → 4(4) + 5(0) = 16 + 0 = 16
C(4,2) → 4(4) + 5(2) = 16 + 10 = 26
D(2,4) →4(2) + 5(4) = 8 + 20 = 28
E(0,5) →4(0) + 5(5) = 0 + 25 = 25
So, Z is Maximize at D(2,4).

Exercise 2:

Solve the following liner programming model graphically:


Maximize Z= 4x + 5y
Subject to:
x + 2y 10
6x + 6y
x 4
x,y .

SOLUTION:
Sol:
1:
x + 2y = 10
X= 0 → 2y = 10 → y= 5 → (0,5)
Y= 0 → x = 10 → x= 10 → (10,0)
2:
6x + 6y = 36
X= 0 → 6y = 36 → y= 6 → (0,6)
Y= 0 → 6x = 36 → x= 6→ (6,0)

x + 2y = 10 → ×-6
6x + 6y = 36
-------------------
-6x – 12y = -60
6x + 6y = 36
6y = -24
Y= 4
X + 2(4) = 10
X + 8 = 10
X=2

Z= 4x + 5y
A(0,0) → 4(0) + 5(0) =0
B(4,0) → 4(4) + 5(0) = 16 + 0 = 16
C(4,2) → 4(4) + 5(2) = 16 + 10 = 26
D(2,4) →4(2) + 5(4) = 8 + 20 = 28
E(0,5) →4(0) + 5(5) = 0 + 25 = 25
So, z is Maximize at D(2,4)

Exercise 3: Question: Find the mathematical model of the following problem?


A TRANSPORTATION EXAMPLE
The Zephyr Television Company ships televisions from three warehouses to three retail stores
on a monthly basis. Each warehouse has a fixed supply per month and each store has a fixed
demand per month. The manufacturer wants to know the number of televisions sets.
To ship from each warehouse to each store in order to minimize the total cost of
transportation.
Each warehouse has the following supply of televisions available for shipment each month.

Warehouse Supply (sets)


1. Cincinnati 300
2. Atlanta 200
3. Pittsburgh 200
700

Each retail store has the following monthly demand for televisions sets.
Store demand (sets)
A. New York 150
B. Dallas 250
C. Detroit 200
600

Costs of transporting televisions sets from the warehouses to the retail stores vary as a result
differences in modes of transportation and distances. The shipping cost per televisions set for
each route is as follows.
To store
From warehouse A B C
1 $16 $18 $11
2 14 12 13
3 13 15 17

SOLUTION:

Minimize Z = $16x1A + 18x1B + 11x1C + 14x2A + 12x2B + 13x2C + 13x3A +


15x3B + 17x3C
subject to:
x1A + x1B+ x1 ≤ 300,
x2A+ x2B + x2C ≤ 200,
x3A+ x3B + x3C ≤ 200,
x1A + x2A + x3A = 150,
x1B + x2B + x3B = 250,
x1C + x2C + x3C = 200,
xij ≥ 0.

You might also like