Tunis Business School
Operations Research 1
Fall 2012
Tutorial 3
Question 1
Solve the following LPs using the graphical Method:
1.
Max
Z= 5x1 + 4x2
subject to 3x1 + 2x2 60,
x1 + 2x2 40,
x1, x2 0.
2.
Max Z = 5x1 + 2x2
x1 + 3x2 6,
x1 + x2 4,
3x1 + x2
7,
x1

Linear Programming
Example: Maximize x + y
Subject to:
y
2x + y = 60
x and y are called
Control variables
x + y is called the
Objective function
x + 2y 90
2x + y 60
x0
y0
The inequalities are constraints
It is called Linear programming as the
functions ar

Z06_TAYL4367_10_SE_Mod A.QXD
1/9/09
1:07 AM
Module
Page A-1
A
The Simplex
Solution Method
A-1
Z06_TAYL4367_10_SE_Mod A.QXD
A-2
1/9/09
1:07 AM
Page A-2
Module A The Simplex Solution Method
he simplex method is a general mathematical solution technique for

Construct a Packet #1
You are working for the home monitoring company as their IT Guru. You must design a packet that will
show whether there is motion, whether either or both doors open, and any of the six windows open
You can do this work in the groups