MCQ EE ch08 QC
MCQ EE ch08 QC
Linear Programming
Quick Check
A Solving Linear Inequalities in One Unknown
1. Basic Properties of Linear Inequalities
Inequalities involve 4 kinds of relational operators:
x Reminder
a
‘ ’ indicates that the end point is excluded in the solution.
‘•’ indicates that the end point is included in the solution.
x
b
1
Mathematics Exam Elite – Multiple-choice Questions (Compulsory Part)
5x – 3 > 7 2x + 8 5x – 3
5x > 7 + 3 (addition property) 2x – 5x –3 – 8 (addition property)
5 x 10
> (multiplication property) –3x –11
5 5 –3 x –11
x >2 (multiplication property)
–3 –3
11
x Reminder
x 3
0 2 The inequality sign
x is reversed.
0 11
3
Example
x x
0 4 6 –1 0 3
2
8 Inequalities and Linear Programming
y = ax 2 + bx + c
x
O
y>0
–2 y<0
3
Mathematics Exam Elite – Multiple-choice Questions (Compulsory Part)
Example
Method 1 Method 2
By sketching the quadratic graph: NF By algebraic method:
2
y = 2x – 3x – 5 2x2 – 3x – 5 0
Find the x-intercepts: (2x – 5)(x + 1) 0
( 25) 0
2
i.e. solve 2x – 3x – 5 = 0
2 [ x – (–1)] x –
(x + 1)(2x – 5) = 0
5
5 ∴ x –1 or x
The solution are and –1. 2
2
5
Hence, the x-intercepts are and –1.
2
Find the y-intercept:
y-intercept = 2(0)2 – 3(0) – 5 = –5
y
y = 2x2 – 3x − 5
x
O
–1 5
2
–5
4
8 Inequalities and Linear Programming
12
y
Reminder
y=
–3
1. Usually, a pair of arrows is used to
4x
x indicate the required half-plane.
–3 O 3
2. A solid line is used if the operator in
the inequality is ‘’ or ‘’.
–4
It means the x-y pairs on the line are
the solutions of the inequality.
–8 3. A dotted line is used if the operator
in the inequality is ‘>’ or ‘<’.
By using the test point (0, 0). It means the x-y pairs on the line are
Putting x = 0 and y = 0 into L.H.S. of the inequality, NOT the solutions of the inequality.
L.H.S. = 0
Since 0 < 12, the half-plane containing the point (0, 0) is the solution.
NF
D Linear Programming
The feasible solution of a linear programming problem is the common solution of all the individual
inequalities defined by the constraints in the problem.
For a linear function f (x, y) = Ax + By + C, its maximum and minimum values are attained at the
vertices of the region of the feasible solution. They can be found by evaluating the values of f (x, y)
at these vertices.