Scribd
Upload
0 views

Tutorial 2 (7)

Uploaded by

salmarefaie
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0 views

Tutorial 2 (7)

Uploaded by

salmarefaie
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 12

Topic 2: Introduction to Optimization Tutorial 2

and Linear Programming Week 3


Steps of Formulating Linear Programming
Problems
1. Define the decision variables (Xi).
2. Define the objective function (minimise or maximise).
3. Write the mathematical functions.
4. Write a description for each constraint.
5. Write the R.H.S for each constraint.
6. Write for each constraint.
7. Write the decision variable on the L.H.S of each constraint.
8. Write the coefficient for each decision variable in each constraint.
Question 1
A Chef wishes to mix two types of food F1 and F2 in such a way that the
vitamin contents of the mixture contain at least 8 units of vitamin A and at most
11 units of vitamin B.

Food F1 costs $60/Kg and Food F2 costs $80/kg. Food F1 contains 3 units/kg
of vitamin A and 5 units/kg of vitamin B while Food F2 contains 4 units/kg
of vitamin A and 2 units/kg of vitamin B.

❖Formulate this problem as a linear programming problem.


A
n
Decision Variables: X1: the number of kgs of F1 used in mixture
s
X2: the number of kgs of F2 used in mixture
w
e Objective Function: MIN 60X1 + 80X2
r
Constraints: Subject to 3X1 + 4X2 ≥ 8 (Amount of vitamin A in F1 and F2)

5X1 + 2X2 ≤ 11 (Amount of vitamin B in F1 and F2)

X1, X2 ≥ 0 (Nonnegativity condition)


Question 2
The Electro-tech Corporation manufactures two industrial-sized electrical devices:
generators and alternators. Both products require wiring and testing during the
assembly process. Each generator requires 2 hours of wiring and 1 hour of testing and can
be sold for a $250 profit. Each alternator requires 3 hours of wiring and 2 hours of testing
and can be sold for a $150 profit. There are 260 hours of wiring time and 140 hours of
testing time available in the next production period and Electro-tech wants to maximize
profit. Suppose that Electro-tech's management decides that they need to make at least 20
generators and at least 20 alternators.

❖Formulate this problem as a linear programming problem.


A Decision Variables: X1: the number of generators manufactured

n X2: the number of alternators manufactured

s
Objective Function: MAX 250X1 + 150X2
w
e Constraints: Subject to 2X1 + 3X2 ≤ 260 (Wiring time)

r
1X1 + 2X2 ≤ 140 (Testing time)

X1 ≥ 20 (Minimum generators)

X2 ≥ 20 (Minimum alternators)

X1, X2 ≥ 0 (Nonnegativity condition)


Question 3
Sanderson Manufacturing produces ornate, decorative wood frame doors and
windows. Each item produced goes through three manufacturing processes: cutting,
sanding, and finishing. Each door produced requires 1 hour in cutting, 30 minutes in
sanding, and 30 minutes in finishing. Each window requires 30 minutes in cutting, 45
minutes in sanding, and 1 hour in finishing. In the coming week Sanderson has 40 hours
of cutting capacity available, 40 hours of sanding capacity, and 60 hours of finishing
capacity. Assume all doors produced can be sold for a profit of $500 and all windows can
be sold for a profit of $400.

❖Formulate this problem as a linear programming problem to maximize the profit.


A Decision Variables: D: the number of doors manufactured

n W: the number of windows manufactured

s
Objective Function: MAX 500D + 400W
w
e Constraints: Subject to 1D + 0.5W ≤ 40 (Cutting time)

r
0.5D + 0.75W ≤ 40 (Sanding time)

0.5D + 1W ≤ 60 (Finishing time)

D, W ≥ 0 (Nonnegativity condition)
Question 4
Bobbins Manufacturing produces softball and baseballs for youth recreation
leagues. Each softball costs $11 to produce and sells for $17 while each baseball
costs $10.50 and sells for $15. The material and labor required to produce each item
is listed here along with the availability of each resource.

❖Formulate this problem as a linear programming problem to maximize the profit.


A Decision Variables: X1: the number of softballs produced Profit of
X1 =17-11 = 6
n X2: the number of baseballs produced
X2=15-10.5 = 4.5
s
Objective Function: MAX 6X1 + 4.5X2
w Constraints: Subject to 5X1 + 4X2 ≤ 6,000 (Leather)
e
r 6X1 + 3X2 ≤ 5,400 (Nylon)

4X1 + 2X2 ≤ 4,000 (Core)

2.5X1 + 2X2 ≤ 3,500 (Labor)

1X1 + 1X2 ≤ 1,500 (Stitching)

X1, X2 ≥ 0 (Nonnegativity condition)


• 5X1 + 4X2 = 6,000 (Leather) ❖The graphical method:
(0 , 1,500)
Solve and get the points
When X1=0, X2=1,500
When X2=0, X1=1,200 (1,200 , 0)

• 6X1 + 3X2 = 5,400 (Nylon)

When X1=0, X2= 1,800 (0 , 1,800)


When X2=0, X1= 900 (900 , 0)
• 4X1 + 2X2 = 4,000 (Core)

When X1=0, X2= 2,000 (0 , 2,000)

When X2=0, X1= 1,000 (1,000 , 0)

• 2.5X1 + 2X2 = 3,500 (Labor)


Feasible
When X1=0, X2= 1,750 (0 , 1,750) Region

When X2=0, X1= 1,400 (1,400 , 0)

• 1X1 + 1X2 = 1,500 (Stitching)

When X1=0, X2= 1,500 (0 , 1,500)

When X2=0, X1= 1,500 (1,500 , 0)

You might also like