System of Inequalities

1
Common Solution of system of
inequalities
(Graphical Method)

2
 Common Solution of system of inequalities
• Convert inequality into equality
• Draw equality (line)
• Select any point (not on the line) as test solution
• Put test solution into inequality
• If statement TRUE then direction of solution is TOWORDS
• If statement FALSE then direction of solution is AWAY

3
X+Y=1200
Find Common Solution Space X+Y≤1200
For X-intercept, put Y=0
(1200,0) 2X + Y≥1600
For Y-intercept, put X=0 X,Y≥0
(0,1200)
1500
Test solution (0,0)
0≤1200 True, 1200
to words test solution
900
2X+Y=1600
For X-intercept, put Y=0 600
(800,0)
For Y-intercept, put X=0 300
(0,1600)
0
Test solution (0,0) 300 600 900 1200
0≥1600 False,
away from test solution 4
X+Y=300
Find Common Solution Space X+Y ≤ 300
(300,0)
X ≥ 1/3 (X+Y)
(0,300) X,Y≥0
Test solution (0,0)
0≤300 True,
to words test solution

2X-Y=0 300
(0,0)
200
(100,200)
Test solution (100,0) 100
100 ≥100/3 True,
to words test solution 0
100 200 300

5
X+Y=60
(60,0) Find Common Solution Space X+Y ≥ 60
(0,60)
X ≥ 30
Test solution (0,0)
0 ≥ 60 False, Y ≤ 40
Away from test solution X,Y ≥ 0

X=30
(30,0)
Line parallel to Y-axix
Test solution (0,0)
0 ≥30 False, 60
Away from test solution
40
Y=40
(0,40) 20
Line parallel to X-axix
Test solution (0,0) 0
0 ≤ 40 True, 20 40 60
To words test solution

6
 Find Common Solution Space 4X + 3Y  240
2X + 1Y  100
X, Y  0
4X+3Y=240
(60,0)
(0,80)
Test solution (0,0)
100
0 ≤ 240 True,
To words test solution
80

60
2X+1Y=100
(50,0) 40
(0,100)
Test solution (0,0) 20
0 ≤ 100 True,
To words test solution
0
20 40 60

7
 Find Common Solution Space 360X + 240Y  5760
X+Y  20
X, Y  0
360X+240Y=5760
(16,0) 24
(0,24)
Test solution (0,0) 20
0 ≤ 5760 True,
To words test solution
16

12
X+Y=20
(20,0) 8
(0,20)
Test solution (0,0) 4
0 ≤ 20 True,
To words test solution
0
4 8 12 16 20

8
 Find Common Solution Space 5X + 10Y  90
5X+10Y=90
(18,0) 4X + 3Y  48
(0,9) ½X 1.5
X, Y  0
Test solution (0,0) 24
0 ≥ 90 False,
Away from test solution
20
4X+3Y=48
(12,0) 16
(0,16)
Test solution (0,0) 12
0 ≥ 48 False,
Away from test solution
8
X=3
(3,0) 4
Line parallel to y-Axix
Test solution (0,0)
0 ≥ 1.5 False, 0
Away from test solution 4 8 12 16 20

9
X≥1 X=1 Find Common Solution Space X, Y1
(1,0)
Line parallel to Y-axix X , Y≤ 4
Test solution (0,0)
0 ≥ 1 False, X ≥ Y
Away from test solution 6 X, Y  0
Y≥ 1 Y=1
(0,1) 5
Line parallel to X-axix
Test solution (0,0)
0 ≥ 1 False, 4
Away from test solution

X≤4 X=4 3
(4,0)
Line parallel to Y-axix
Test solution (0,0)
2
0 ≤ 4 True,
To words test solution 1
Y≤ 4 Y=4 X=Y
(0,4) (0,0) & (1,1) 0
Line parallel to X-axix 1 2 3 4 5
Test solution (0,0) Test solution (1,0)
0 ≤ 4 True, 1≥ 0 True,
To words test solution To words test solution 10
X+Y ≥ 5 Find Common Solution Space 5  1X + 1Y  7
(5,0)
(0,5) 8  1X + 2Y  10
Test solution (0,0)
X, Y  0
0 ≥ 5 False,
Away from test solution 12
X+Y ≤ 7
(7,0) 10
(0,7)
Test solution (0,0)
0 ≤ 7 True, 8
To words test solution
X+2Y ≥ 8 6
(8,0)
(0,4)
Test solution (0,0) 4
0 ≥ 8 False,
Away from test solution
2
X+2Y ≤ 10
(10,0)
(0,5) 0
Test solution (0,0) 2 4 6 8 10
0 ≤ 10 True,
To words test solution
11
Find Common Solution Space 0.3X+0.6Y ≤ 9.6
25X+10Y ≤ 400
50X+60Y ≤ 1000
X, Y  0

12
 Find Common Solution Space
X+Y ≤ 1
X+Y≥4
X,Y≥0
X+Y =1
(1,0)
(0,1)
Test solution (0,0)
0 ≤ 1 True,
To words test solution 4

X+Y =4 3
(4,0)
(0,4)
Test solution (0,0) 2
0 ≥ 4 False,
Away from test solution
1

0
1 2 3 4

13
 Development of system of inequalities
Example: A doctor has prescribed a diet in which the total number of calories cannot exceed
1200. She insists that twice the number of protein calories added to the number of carbohydrate
calories must equal or exceed 1600. Write these conditions as a system of inequality
X=Number of protein calories
Y=Number of carbohydrate calories

X+Y≤1200
2X + Y≥1600
X,Y≥0

14
 Example: A school has only enough money to hire atmost 300 teachers. Each teacher has
either a M.Sc degree or B.Sc degree. The school boards desires that atleast 1/3 of its teachers
have the M.Sc degrees. Express these conditions as a system of inequalities

X=Teacher having M.Sc degree

Y=Teacher having B.Sc degree

X+Y ≤ 300
X ≥ 1/3 (X+Y)
X,Y≥0

15
 Example: The Sweet Smell Fertilizer Company markets bags of manure labeled "not less than
60 pounds dry weight." The packaged manure is a combination of compost and sewage
wastes. Each bag should contain at least 30 pounds of compost but no more than 40 pounds of
sewage. Express these conditions as a system of inequalities

X=Number of pounds of compost

Y=Number of pounds of sewage

X+Y≥60
X ≥ 30
Y≤40
X,Y≥0
16
 Example: A factory is planning to buy some machines to produce boxes and has a choice of
B-1 or B-9 machines. Rs. 9.6 million has been budgeted for the purchase of machines. B-1
machines costing Rs. 0.3 million each, require 25 hours of maintenance and 50 square meters
of floor area. Machine B-9 costing Rs. 0.6 million each, require 10 hours of maintenance and
50 square meters of floor area. If total Floor area of 1000 square meters and maintenance
time of 400 hours are available each week. Express these conditions as a system of
inequalities
X=Number of B-1 machine
Y= Number of B-9 machine

0.3X+0.6Y ≤ 9.6
25X+10Y ≤ 400
50X+50Y ≤1000
X,Y≥0

17
 Linear Programming (LP)
• Many management decisions involve trying to make the most effective use of
an organization’s resources
• Resources: machinery, lobour, money, time, warehouse space or raw material
• These resources may be used to produce products (such as machinery,
furniture, food )or services (such as schedules for shipping and production,
advertising policies, or investment decisions)
• Linear Programming (LP) is a widely used mathematical
technique designed to help managers in planning and
decision making relative to resource allocation.

18
 Requirements of a LP problem

• All problems seek to maximize or minimize some quantity, usually

profit or cost
• LP problems must have restrictions, or constraints, that limit the
degree to which we can pursue our objective
• There must be alternative courses of action to choose from. For
example, if a company produces three different products,
management may use LP to decide how to allocate among them its
limited production resources
• The objective and constraints in linear programming problems
must be expressed in terms of linear equations or inequalities
19
Components of LP
• Decision Variables
• Objective function (OF)
• Constraints

20
Example: A factory is planning to buy some machines to produce boxes and has a choice of
B-1 or B-9 machines. Rs. 9.6 million has been budgeted for the purchase of machines. B-1
machines costing Rs. 0.3 million each, require 25 hours of maintenance and 50 square meters
of floor area. Machine B-9 costing Rs. 0.6 million each, require 10 hours of maintenance and
50 square meters of floor area. If total Floor area of 1000 square meters and maintenance
time of 400 hours are available each week. Each machine of B-1 type can produce 1500 and
B-9 type 2000 boxes. Find number of machine of each type to optimize box production
X=Number of B-1 machine
Y= Number of B-9 machine
Max: Z=1500X+2000Y
(X) (Y) Available
0.3X+0.6Y ≤ 9.6
Cost 0.3 0.6 9.6 25X+10Y ≤ 400
Time 25 10 400 50X+50Y ≤1000
Area 50 50 1000 X ,Y≥0
Cost 1500 2000
21
 Corner Point Objective
Function value
1500X+2000Y
1(0,0) 0
2(0,16) 32,000
3(8,12) 36,000
4(13.33,6.66) 33,333.33
5(16,0) 24,000
2
3

1 5
22
Example:-The Flair Furniture Company produces tables and chairs. The production
process require a certain number of hours in carpentry department and in the painting
department. Each table takes 4 hours of carpentry and 2 hours in the painting. Each
chair takes 3 hours of carpentry and 1 hour in the painting. During the current
production period, 240 hours of carpentry time are available and 100 hours in the
painting time are available.

Each table sold yields a profit of $7;each chair produced is sold for a $5 profit.

Determine the best possible combination of tables and chairs to manufacture in order to
reach the maximum profit. Develop LP problem and then solve the problem

23
Each table sold yields a profit of $7;each chair produced is sold for a $5 profit.
•Each table takes 4 hours of carpentry and 2 hours in the painting & varnishing shop
•Each chair takes 3 hours of carpentry and 1 hour in the painting & varnishing shop
•240 hours of carpentry & 100 hours in the painting and varnishing time are available
determine the best possible combination of tables and chairs in order to reach the
maximum profit Available
X Y
Department Hours This
Tables Chairs
Week
Carpentry 4 3 240
Painting 2 1 100

Profit/unit $7 $5
Decision variables: CONSTRAINTS:

X=Number of tables to be produced 4X + 3Y  240 Carpentry constraint

Y=Number of chairs to be produced 2X + 1Y  100 Painting Constraint

To obtain meaningful solution
OF: Max Z = 7X + 5Y
X, Y  0 24
Non-nagativity constraint
4X + 3Y  240
(60,0)
120
(0,80)
0  240 True, To words

Number of Chairs
100

80 Painting
2X + 1Y  100
(50,0) 60
(0,100)
40
0  100 True, To words Carpentry
20

0
20 40 60 80 100
Number of Tables
25
 Corner Objective
Point Function value
7X+5Y
1(0,0) 0
120
2(0,80) 400

Number of Chairs
100 3(30,40) 410
1. $0
2 4(50,0) 350
80 2. $400
60 3. $410
4. $350
40 3
Feasible
20
Region
0 1 4 60
20 40 80 100
Number of Tables
26
Example: A factory produces Transformers and Switchgears. The machines in department A can
work up to 6 hours per day whereas those in department B can work up to 7.5 hours per day.
A transformer requires 4 hours in department A & 3 hours in department B, whereas a switch
gear requires 2 hours in department A & 5 hours in department B.
The profit margin on a transformer is Rs.5,000 and on a switch gear is Rs.6,000. How many
transformers and switch gears may be produced to maximize profit in a month having 20
working days. How many machine hours will remain idle during the month in each department
at the maximum level of profit
Trans. Switch gear Total X=Number of transformers
(X) (Y) Y= Number of switch gears
A 4 2 120 hrs OF: Max: Z = 5000X + 6000Y
B 3 5 150 hrs
Profit Rs.5000 Rs.6000 4X + 2Y ≤ 120
3X + 5Y ≤ 150
27
OF: Max: Z = 5000X + 6000Y
Corner points OF value
(0,0) 0
4X + 2Y ≤ 120
(30,0) 150,000
(0,30) 180,000 3X + 5Y ≤ 150
(21.43, 17.14) 209,990 100

80

X = 21 Y =17 60

4(21) + 2(17) 120 40

118 120 20
3(21) + 5(17) 150
0
148 150 20 40 60 80
28
 Example:-Professor Symons wishes to employ two students, John and Mary,
to mark papers for his classes. John can grade 20 papers per hour; John earns
$15 per hour. Mary grade 30 papers per hour; Mary earns $25 per hour.
Each must be employed at least one hour a week.
If Prof. Symons has at least 110 papers to be graded each week, how many
hours per week should he employ each person to minimize the cost?

X=The number of hours per week John is employed.

Y= The number of hours per week Mary is employed. OF: Min Z = 15X + 25Y
(X) (Y) Min. Requirement
20X + 30Y  110
grading 20 30 110
X 1 X 1
Y 1 Y 1
Cost 15 25 X, Y 0
30
2 Corner Objective
Point Function value
Z=15X+25Y
1(4,1) 85
1 2(1,3) 90

31
 Example:-The Holiday Meal Turkey Ranch is considering buying two
different brands of turkey feed and blending them to provide a
good, low-cost diet for its turkeys. Each feed contains, three
nutritional ingredients.
Each pound of brand 1 purchased, contains 5 ounces of ingredient A,
4 ounces of ingredient B, and ½ ounce of ingredient C.
Each pound of brand 2 contains 10 ounces of ingredient A, 3 ounces
of ingredient B, but no ingredient C.
The brand 1 feed costs the ranch 2 cents a pound, while the brand 2
feed costs 3 cents a pound.
The minimum requirement is 90 units for ingredient A, 48 units for
ingredient B and 1.5 units for ingredient C. The owner of the ranch
would like produce lowest-cost diet
32
Each pound of brand 1 : 5 ounces of ingredient A, 4 ounces of ingredient B, and ½ ounce of ingredient C.
Each pound of brand 2 : 10 ounces of ingredient A, 3 ounces of ingredient B, but no ingredient C.
The brand 1 : 2 cents a pound, brand 2: 3 cents a pound.
The minimum requirement is 90 units for ingredient A, 48 units for ingredient B and 1.5 units for ingredient C.
Brand 1 Brand 2 Min.
(X) (Y) Requirement
A 5 10 5X + 10Y  90
90
B 4 3 48 4X + 3Y  48
C 0.5 0 1.5 ½X 1.5
Cost 2 3
X, Y 0
X=Number of pounds of brand 1 feed purchased
Y= Number of pounds of brand 2 feed purchased

OF: Min Z = 2X + 3Y 33
 Corner Points
Corner Point Objective
Function value
A(3,12) 42
B(8.4,4.8) 31.2
C(18, 0) 36

34
Example: A pharmaceutical company has developed a formula to prepare herbal medicine by using product X or
product Y .
From each milligram (mg) of X it can extract one unit of iron and one unit of calcium.
From each milligram (mg) of Y it can extract one unit of iron and two units of calcium.
Cost of product X is Rs.500 per mg and cost of product Y is Rs.600 per mg. Each tablet of the medicine is
required to contain
• 5 to 7 units of iron
• 8 to 10 units of calcium
How many mg of each product should be used to produce the tablets at the lowest cost
Product Product Total X= No. of mg of Product X
(X) (Y) Y= No. of mg of Product Y
Between 5 to 7
Iron 1 1 OF: Min: Z = 500X + 600Y
Between 8 to 10
Calc. 1 2
Cost Rs.500 5  1X + 1Y  7
Rs.600
8  1X + 2Y  10
X, Y  0 35
 5  1X + 1Y  7 1X + 1Y  7
OF: Min: Z = 500X + 600Y 8  1X + 2Y  10 1X + 1Y  5
X, Y  1X + 2Y  10
1X + 2Y  8
X, Y  0

Value

1 3000
2800
3600

2 4 3800

36
Problems in LP solution

•Infeasible solution
•More than one optimum Solution
•Redundant Constraints
•Unbounded solution

37
Max: Z= 2X+3Y
Ist Constraint: (0,3) (6,0)
X + 2Y ≤ 6
2nd Constraint: (0,8) (4,0)
2X + Y ≤ 8
3rd Constraint : parallel to Y at X=7
X ≥7
12
X,Y0
10
Infeasible Solution
8
No Common region
6 that satisfy all the
constraints
4

0
2 4 6 8 10 38
Max Z = X + Y
Ist Constraint: (0,0) (1,1)
Subject to
X-Y  0 2nd Constraint: (0,3) (-1,0)
3X - Y  -3
X,Y0
3
Infeasible Solution
2
No Common region
1 that satisfy all the
constraints

-3 -2 -1 -1 1 2 3

-2

-3
39
MAX: : 3X + 2Y
Ist Constraint: (0,6) & (4,0)
6X + 4Y ≤ 24
2nd Constraint : parallel to Y atX=3
X ≤3
X,Y0 A
6

5 Corner Objective
Point Function value
4
A(0,6) 12
3 B(3,1.5) 12
C(3,0) 9
2
Feasible B Alternative Optimal Solution
1 Region
0
1 2 3 4 5 40
 Max: Z = 2X+3Y
Ist Constraint: (0,20) (20,0)
X + Y ≤ 20
2nd Constraint: (0, 15) (15 , 0)
2X + 2Y ≤ 30
3rd Constraint : parallel to Y at X=25
X ≤ 25
30
X,Y0 Redundancy
25 A constraint that does not
affect the feasible solution
20 region
15

10
Feasible
5 Region
0
5 10 15 20 25 41
 Max Z = -X + 2Y
Ist Constraint: (0,1) (-1,0)
Subject to
X- Y  -1 2nd Constraint: (0,2) (-4,0)
-½X + Y 2
(2,3)
X,Y0
3
OF
-X + 2Y=2 2
X=0  Y= 1 (0,1)
Y=0  X= -2 (-2,0) 1

-4 -3 -2 -1 -1 1 2 3
Solution space is infinite(unbounded)
-2 but finite solution is possible
-3
42
Max:OF 2X+3Y
Ist Constraint: (0,5) (10,0)
X +2 Y ≥ 10 2nd Constraint: parallel to X at Y=10
Y ≤ 10 3rd Constraint : parallel to Y at X=5
X ≥5 30
OF
X,Y0 25 2X + 3Y=6
X=0  Y= 2 point (0,2)
20 Y=0  X= 3 point (3,0)

15 Unbounded Solution

10 Common region is unbounded

and OF line will never exit the
5 solution space
0
5 10 15 20 25 43
Q#(22):- An employer recruits experienced (X) and fresh workmen
(Y) for his firm under the condition that
(a):- He cannot employ more than 9 people. "X" and "Y" can be
related by the inequality
X +Y  9
(b):- On the average experienced person does 5 units of work while
a fresh one (Y) does 3 units of work daily. But the employer has to
5X +3Y  30
maintain an output of at least 30 units of work per day. This
situation can be expressed as X  5 , Y =1
X
(c):- The rules and regulations demand that the employer should 1 ,Y =1
5
employ not more than 5 experienced hands (X) to 1 fresh one (Y) X
and this fact can be expressed as Y
5

(d):- The union however forbids the employer to employ less X  2 , Y =1

than 2 experienced persons (X) to each fresh person (Y). This X
1 ,Y =1
situation can be expressed as 2
X
Y 44
2
Q#(23)A large bus can take 40 passengers and a small bus can take 25 passengers. If a group of
250 students go for a summer camp by bus, at least how many small buses should they rent if
they have rented 3 large buses?

45
Q#(23):- Jack is paid $300 per day, but he is fined $20 each day he is late to work. If Jack
wants to make at least $5910 this month, how many times can he be late if he works 20 days
this month?

46