Unit 1 Vectors - 1: Stucture
Uploaded by
JaheerUnit 1 Vectors - 1: Stucture
Uploaded by
JaheerVectors - 1
UNIT 1 VECTORS – 1
Stucture
1.0 Introduction
1.1 Objectives
1.2 Vectors and Scalars
1.3 Components of a Vector
1.4 Section Formula
1.5 Answers to Check Your Progress
1.6 Summary
1.0 INTRODUCTION
In this unit, we shall study vectors. A vectors is a quantity having both magnitude
and direction, such as displacement, velocity, force etc. A scalar is a quantity
having magnitude only but no direction, such as mass, length, time etc. A vector
is represented by a directed line segment. A directed line segment is a portion of
a straight line, where the two end-points are distinguished as initial and terminal.
Scalars are represented using single real numbers as complex numbers only. A
vector in plane is represented using two real numbers. This is done by considering
a rectangular coordinate system by which every point in place is associated with a
pair of numbers (x,y). Then the vector whose initial point is origin and terminal
pont is (x,y) is x + y . This is component form of a vector. Similarly,
component form of a vector in space is x + y + . We shall discuss it in
detail in this Unit. Further, we shall learn to add and subtract vectors and to
multiply a vector by a scalar. There are many applications of vectors in geometry.
We shall prove the section formula for vectors and solve many problems in
geometry using vectors.
1.1 OBJECTIVES
After studying this unit, you will be able to :
define the terms scalar and vector;
define position vector of a point;
find direction cosines and direction ratios of a vector;
find sum and difference of two vectors;
multiply a vector by a scalar;
write a vector in component form; and
use selection formula in geometrical problems. 5
Vectors and Three
Dimensional 1.2 VECTORS AND SCALARS
Geometry
Many quantities in geometry and physics, such as area, volume, mass,
temperature, speed etc. are characterized by a single real number called
magnitude only. Such quantities are called scalars. There are, however, other
physical quantities such as displacement, force, velocity, acceleration etc. which
cannot be characterized by a single real number only. We require both magnitude
and direction to specify them completely. Such quantities are called vectors.
Definition : A quantity having both magnitude and direction is called a vector.
Graphically, a vector is represented by a directed line segement. A directed line
segment with initial point A and terminal point B is denoted by .
B Terminal Point
A
Initial Point
Figure 1
We usually denote vectors by lower case, bold face letters , etc. or by letters
with arrows above them such as ,etc.
If is a vector represented by directed line segment , then magnitude of is
the length of and is dentoed by or .
Two vectors are said to be equal if they have same magnitude and the same
direction.
A vector with zero magnitude (i.e., when initial point and terminal point coincide)
is called a zero vector or null vector. A vector whose magnitude is unity (i.e.,
1 unit) is called a unit vector.
Position Vector and Direction Cosines
The position vector of any point P with respect to the origin of reference O is a
vector . Recall that a point P in space is uniquely determined by three
coordinates. If P has coordinates (x,y, z) and O is the origin of the rectangular
coordinates system, then the magnitude of the position vector is given by
= =
6
Z Vectors - 1
P(x,y,z)
z
y
O(0,0,0)
x
y
x Figure 2
Suppose makes angles α, β and γ with the positive directions of x, y and
z – axes respectively. These angles are called direction angles of ).
The cosines of these angles i.e., , , and are called direction
cosines of the vector and usually denoted by l, m and n respectively.
z
P(x,y,z)
β
y
α
x
Figure 3
It must be noted that
+ =1
i.e., +
Thus, the coordinates of the point P may also be expressed as (lr, mr, nr). The
numbers lr, mr and nr, proportional to the direction cosines are called direction
ratios of vector , and denoted by a, b and c respectively.
Example 1 : Find the magnitude and direction angles of the position vector of the
point P(1,2, 2).
Solution : Let
r= = = 7
Vectors and Three
Dimensional
Geometry
11
Hence = cos 70030'
3
2
= cos 1 48010'
3
2
= cos 1 131050 '
3
Thus, the vector forms acute antles with the x-axis and y-axis, and an obtuse
angle with the z-axis.
Coinitial, Collinear and Coplanar Vectors
Two or more vector having the same initial points are called coinitial Vectors.
Two vectors are said to be collinear if they are parallel to the same line,
irrespective of their magnitude and directions. A set of vectors is said to be
coplanar if they lie on the same plane, or the planes in which the different
vectors lie are all parallel to the same plane.
Addition of Vectors
Let be two vectors. We position them so that the initial point of is the
terminal point of . Then the vector extending from the intial point of to the
terminal point of is defined as the sum of and and is denoted as .
B C
Figure 4
In the Figure 4 a AB, b BC and
This is called triangle law of addition of vectors.
If the vectors and are represented by the two adjacent sides of a
parallelogram, then their sum is the vector represented by the diagonal of
the parallelogram through their common point. This is called parallelogram law
of vector addition.
8
B C Vectors - 1
A D
Figure 5
In above figure 5, by triangle law
AB BC AC
But BC AD
AB AD AC
which is the paralellogram law.
Properties of Vector Addition
1. Addition of vectors is commulative i.e.,
for any vectors and .
Proof : Let OA a and AB b. We have a b OB.
Completing the parallelogram OABC having OA and OB as adjacent sides (see
Figure 6), we have
OC AB a and CB OA a = AB =a and CB OA a
So, we have
OC AB a and CB OA a
A B
O C
Figure 6
2. Addition of vectors is associative, i.e.,
a (b c) (a b) c, where a, b, c are any three vectors.
9
Vectors and Three Proof : Let be represented by , and respectively.
Dimensional
Geometry
Q
R
+
P S
Figure 7
Then a b PQ QR PR
a b a ( b).
Again, b c QR RS QS
a (b c) PQ QS PS
Hence (a b) c a (b c)
3. If is any vector, and is the zero vector then + = .
Here, zero vector is the additive identity for vector addition.
Difference of Vectors
Let be a vector represented by . Then negative of , is denoted by − is
defined by the vector . So, is a vector having same magnitude as but
direction opposite to that of It is also clear that
a ( a) AB BA AA 0
If and are two vectors, then their difference is defined by
a b a ( b).
Geometrically, let and construct so that its magnitude
is same as the vector but the direction opposite to =
(Figure 8).
C
B
−
A
– C
Figure 8
10
Then, by triangle law Vectors - 1
AC ' AB BC ' a ( b) a b.
The vector represents difference of and .
Multiplication of a Vector by a Scalar
The product of vector by a scalar, λ denoted by λ is defined as a vector
whose length is times that of and whose direction is the same or opposite as
that of according as λ is positive or negative.
If = 1 then λ = ( 1) = which is negative of vector Also, note that
–λ =λ(
Let be a non zero vector. If we take λ = , then λ is a unit vector take
because
This vector is denoted by , and is the unit vector in the direction of .
Let be a vector and and are scalars. Then it is easy to prove that
Distributive Property : Let and be vectors and α and β be any scalars.
Then
(i ) (a )a a a
(ii ) ( a b) a b.
Proof of (i)
Let AB be vector as shown in figure below (Figure 9)
α
A B C D
Figure 9
First assume that α and β are positive. Then α is given by which is in same
direction as such that | |=α| |. To consider β , We choose the initial
point C. If =β , then by triangle law of vector addition,
a a AC CD AD
Now, | = AC + CD = α | | + β | |
= (α + β ) | |
11
Vectors and Three Also, the direction of is the same as that of . Thus, = (α + β ) by
Dimensional
Geometry
definition of scalar multiple of a vector. Hence, we have
(α + β) =α +β .
Also, it is clear that the property holds when one or both of β are negative since
Proof of (ii)
As shown in figure (Fig. 10) below, Let & be represented by and
respectively. Then
B C
D E
Figure 10
We assume α to be positive. Take a point D on AB such that AD = α AB and
point E on AC such that AE = α AC. Join D and E.
But, OP1 OQ QP1
Now, ABC ADE (by construction)
and DE is parallel to BC.
α BC
i.e., DE = BC b
Now from ADE,
AE = AD DE
i.e., (a b) a b.
Check Your Progress – 1
1. Classify the following quantities as vectors or scalars.
(a) distance (b) force
(c) Velocity (d) workdone
(e) temperature (f) length
(g) Speed (h) acceleration
12
2. Prove that + =1, where l, m and n are direction cosines of a Vectors - 1
vector.
3. Prove that in a triangle ABC,
AB + BC CA = 0
4. Find the magnitude and direction of the position vector of point P(1, –1, )
5. If the position vector of the point P (x, 0,3) has magnitude 5, find the value
of x.
1.3 COMPONENT OF A VECTOR
Consider the points A(1,0,0) B(0,1,0) and C(0,0,1) on x, y and z–axes
respectively. Then, the position vectors , are unit vectors because
and
The vectors , are called units vectors along the x-axis, y, axis
and z–axis respectively and are denoted by , and respectively.
Suppose P (x, y , z) is a point in space and consider the position vector shown
in following figure (Figure 11). Let P1 be the foot of the perpendicular from P
on the xy plane.
R
P(x,y,z)
z
y
O
S y
x
Q P1
Figure 11
x
Since , and are unit vectors along x, y and z-axes respectively and P has
coordinates (x,y, z), therefore
OQ xi, OS y j and OR zkˆ.
So, QP1 = OS y j and P1P OR zkˆ.
Now, OP OP1 P1 P
But, OP1 OQ QP1
OP OP1 OQ QP1
or , OP (or r ) y j zkˆ
13
Vectors and Three This form of any vector is called component form. Here, x, y and z are called
Dimensional
scalar components of and , , and called vector components of
Geometry
Also note that length of vector , + + is
| |
Let = ,+ + and
= ,+ + be component form of two vectors. Then
1. The vectors and are equal if and only if = , = , = ,
2. The sum of vectors and is given by
+ =( + ) ,+( + ) +( + )
3. The difference of vectors and is given by
– =( – ) , +( – ) +( – )
4. The multiplication of vector by any scalar λ is given by
λ = (λ + (λ + (λ
We may observe that vectors and λ are always collinear, whatever be the
value of λ. In fact, two vectors and are collinear if and only if there exists a
non zero scalar λ such that = λ .
If = + + and
= + +
then the two vectors are collinear if and only if
+ + =λ( + +
λ , λ λ
Example 2 : Let = + – and
= + +3 .
Evaluate
(i) 2 +3 (ii) –2
Solution : (i) 2 = 2(2 + – )=4 + –2
3 = 3( + + )=3 + +9
2 +3 =7 + +7
14
(ii) –2 = (2 + – ) – 2( + + ) Vectors - 1
= (2 + – ) – (2 + + )
0iˆ ˆj 7 kˆ
1 1 ˆ 3 ˆ 4 ˆ
aˆ a (3i 4kˆ) i k
|a| 5 5 5
Example 3 : Find a unit vector in the direction of the vector
=3 –4
Solution : =3 –4 =3 + −
| |= = = 5.
So, unit vector in the direction of is
1 1 ˆ 3 ˆ 4 ˆ
aˆ a (3i 4kˆ) i k
|a| 5 5 5
Example 4 : Find a unit vector in the direction of ( where
a i j kˆ and
b =2i j 3kˆ.
Solution : Here, – =( + + – (2 + – 3
=–3 +4
and | − | = = = 5.
unit vector in the direction of –
Example 5 : Let + 2 + 3 and – +
Find a vector in the direction of
Solution : Here, a b (iˆ 2 ˆj 3kˆ) ( i j)
3 ˆj 3kˆ c
The unit vector in the direction of is
15
Vectors and Three Therefore, the vector having magnitude equal to 7 and in the direction of
Dimensional
Geometry
Example 6 : If are position vectors of the points (1, –1) and (–2, m)
respectively, then find the value of m for which
Solution : Here
b 2iˆ mjˆ
a and b are collinear if a b where is a real number
i.e., iˆ ˆj ( 2iˆ mjˆ) 2 m j
Comparing the component on both sides, we get
Check Your Progress – 2
1. Let 4 –3 + and –2 +5 +
Find the component form and magnitude of the following vectors:
(a) a b (b) a b
2a 3b
2. Let a iˆ 2 ˆj 2kˆ and b 2iˆ 4 ˆj kˆ.
Find
(a) | a b | ( a b ) (b) |2a 3b |
3. Find a unit
vector in the direction
of
ˆ
where a 2i 2 j 5k and b 2iˆ
ˆ ˆ ˆj 3kˆ.
4. Write
theˆdirection ratio’s of the vector
ˆ ˆ
r 2i j k and hence calculate its direction cosines.
5. Show that vectors 2iˆ 3 ˆj kˆ and 4iˆ 6 ˆj 2kˆ are collinear.
1.4 SECTION FORMULA
In this section, we shall discuss section formula and its applications. Before that
let us find component form of a vector joining two points.
16
Vector Joining Two Points Vectors - 1
Let P(x1, y1, z1) and Q (x2, y2, z2) be any two points. The position vectors of P and
Q are
OP x1iˆ y1 ˆj z1kˆ and
OQ x2iˆ y2 ˆj z2 kˆ
The vector joining P and Q is
Q
O P
Figure 12
By triangle law, we have
OP PQ OQ
PQ OQ OP
( x2iˆ y2 ˆj z2 kˆ) ( x2iˆ y2 ˆj z2 kˆ)
( x2 x2 )iˆ ( y2 y2 )kˆ ( z2 z2 )kˆ
The magnitude of Vector is given by
Example 7 : Find the vector where P is the point (5, 7, –1) and Q is the point
(2, 9, 2)
Solution : = (– 2 – 5) + (9–7) + (– 2 –1) =–7 +2 –3
Section Formula : To find the positon vector of the point which divides the line
joining two given points in a given ratio.
Let P and Q be two points with position vectors : and respectively. Let O be
the origin of reference so that
OP a and OB b
Q
R
m
O P
Figure 13
Let R be a point which divides PQ in the ratio m : n. 17
Vectors and Three
Dimensional
Geometry
Let : =
nPR mRQ
From above figure, (Figure 13) we have
1
(1 t )a.
2
PQ SR
Therefore,
n( r a ) m(b r )
m b+n a
r=
m+n
Hence, the position vector of the point R which dividies P and Q in the ratio of
m : n internally is given by
m b + n a
OR = .
m n
Corollary : If R is the midpoint of PQ, then m = n . Therefore, the position
vector of the midpoint of the joint of two points with position vectors is
given by
Remark : If R divides the line segment PQ in the ratio m : n externally, then the
position vector of R is given by
m b na
OR = .
m n
Example 8 : Find the position vector of a point R which divides the line joining
two points P and Q whose position vectors are 2 + – and
+ 2 + in the ratio 2:1
(i) internally (ii) externally
Solution :
(i) Position vector of R which divides PQ in the ratio 2:1 internally is
OR
18
j Vectors - 1
(ii) Position vector of R which divides PQ in the ratio 2:1 externally is
OR
3 ˆj 3kˆ
Example 9 : If the mid-points of the consecutive sides of a quadrilateral are
joined, then show by using vectors that they form a parallelogram.
Solution : Let , , be the positon vectors of the vertices A, B, C, D of
the quadrilateral ABCD. Let P, Q, R, S be the mid-points of sides AB,
BC, CD, DA respectively. Then the position vectors of P, Q, R and S
D R C
S Q
A P B
1 1 1
Now, PQ PQ PQ (b c ) (a b ) (c a )
2 2 2
or AB BC CA ( CA AC )
PQ SR
= SR and also PQ || SR.
Since a pair of opposite sides are equal and parallel, therefore, PQRS is a
parallelogram.
Example 10 : Prove that the three medians of a triangle meet at a point called the
centroid of the triangle which divides each of the medians in the
ratio 2:1.
Solution : Let the position vectors of the vertices A, B, C of a triangle ABC with
respect to any origin O be , , . The position vectors of the mid-
points D, E, F of the sides are
19
Vectors and Three
Dimensional Let G be the point on the median AD such that AG : GD = 2:1.
Geometry
A
•G
B D C
Figure 15
Then by the section formula, the position vector of G is given by
1
2OD + OA 2 b + c a
2 a b c
OG = = =
2 1 3 3
If G1 were the point on the median BE such that BG1 : G1E = 2:1, the same
argument would show that
a +b+c
OG 1
3
In other words, G and G1 coincide. By symmetry, we conclude that all the three
medians pass through the point G such that
a +b+c
OG
3
and which divides each of the medians in the ratio 2:1.
Example 11 : Prove that the straight line joining the mid-points of two non
parallel sides of a trapezium is parallel to the parallel sides and half of their sum.
Solution : Let OABC be a trapezium with parallel sides OA and CB. Take O as
the origin of reference.
C t B
F E
O A
Figure 16
Let = , = , so that , are the position vectors of the points A and C
respectively.
As CB is parallel to OA, the Vector must be a product of the vector by
some scalar, say, t.
So, CB t OA ta (1)
20 The position vector of B is
OB OC CB c ta Vectors - 1
Since F is the mid point of OC,
Similarly, positon vector of midpoint E of AB
We have
FE = OE OF
1
(1 t )a.
2
1
i.e., FE (1 t )OA
2
So, is a scalar multiple of
1
FE || OA and FE (1 t )OA
2
Also, from (1) we have
CB = t OA
OA + CB = (1 + t) OA = 2FE.
Example 12 : Show that the three points with position vectors
2a 3b 5c , a 2b 3c , 7a c
are collinear.
Solution : Let us denote the three points by A, B and C respectively.
We have
AB ( a 2b 3c ) ( 2a 3b 5c )
3a b 2c .
AC (7 a c ) ( 2a 3b 5c )
(9a 3b 6c ) 3 AB
Thus, the vectors and are collinear. These vectors are also
cointial, therefore, the points A, B and C are collinear.
21
Vectors and Three Check Your Progress – 3
Dimensional
Geometry
1. Find a unit vector in the direction of vector joining the points P (1, 2, 3)
and Q (–1, 1, 2).
2. (i) Let P and Q be two points with position vectors = 3 –2 and
OQ= + . Find the position vector of a point R which divides the line
joining P and Q in the ratio 2 :1. (i) internally, and (ii) externally.
3. Show that the line segment joining the mid-points of two sides of a triangle is
parallel to the third side and is half of its length.
4. Show that diagonals of a quadrilateral bisect each other if and only if it is a
parallelogram.
5. ABCD is a parallelogram and P is the point of intersection of its diagonals, O
is the origin prove that
4OP OA OB OC OD
6. Show that the three points : A(6, –7, –1), B(2, –3, 1) and C(4, –5, 0) are
collinear.
1.5 ANSWERS TO CHECK YOUR PROGRESS
Check Your Progress – 1
1. (a) Scalar (b) Vector
(c) Vector (d) Scalar
(e) Scalar (f) Scalar
(g) Scalar (h) Vectors
2. If = makes angles α, β and with positive direction of x, y and z axis
respectively then l = cos α, m = cos β, n = cos
If P has coordinates (x,y, z), then x = r cosα, y = r cosβ and z = rcos
22
3. From adjoining figure, we have + = using triangle law of vector Vectors - 1
addition.
AB BC AC 0 C
or AB BC CA =0 ( CA AC ) A B
Figure 17
4. | |=r= = = =2
5. | |=
5=
25 = +9
= 16
Check Your Progress – 2
1. (a) a b 2iˆ 2 ˆj 4kˆ
|a b| 22 22 42 24 2 6
(b) a b 6iˆ 8 ˆj 2kˆ
a
r 2iˆ ˆj kˆ,
3b 6iˆ 15 ˆj 9kˆ
r aiˆ bjˆ ckˆ,
| 2a 3b | 4 81 121 206
23
Vectors and Three 2. (a) a b 3iˆ 2 ˆj kˆ
Dimensional
Geometry
i.e., OB OB OB and
| a b|= =
| a b | (a b ) 46(3iˆ 2 ˆj kˆ)
(b) 2a 2iˆ 4 ˆj 4kˆ
3b 6iˆ 12 ˆj 3kˆ
2a 3b 4iˆ 16 ˆj 7 kˆ
| 2a 3b | = ( 4)2 ( 16)2 (7)2 321
3. Here, a b 4iˆ 3 ˆj 2kˆ
|a b| 42 32 ( 2)2 29
unit vector in the direction of
4. For any vector r aiˆ bjˆ ckˆ, a, b and c are direction ratios and
a b c
, and are the direction cosines.
|r | |r | |r |
Here, r 2iˆ ˆj kˆ, so the direction ratios are a 2, b 1, c 1
Also, | = =
5. Let a 2iˆ 3 ˆj kˆ and b 4iˆ 6 ˆj 2kˆ 2kˆ
Thus clearly b 2(2iˆ 3 ˆj kˆ) 2a
is a scalar multiple of
Hence,
24
Check Your Progress – 3 Vectors - 1
1. Here, = ( 1 1)
= 2
| |= =
unit vector in the direction of
3. Let A of ABC be considered as the origin of vectors (Figure 18)
D E
B C
Figure 18
Let D and E be the mid-points of sides AB, CA respectively. Then
1 1
AD = AB and AE AC
2 2
Now,
= –
|
25
Vectors and Three 4. ABCD be the quadrilateral and O be the point of intersection of AC and BD
Dimensional (Figure 19) choose O as the origin of vectors.
Geometry
D C
A B
Figure 19
O is the mid-point of AC and BD
OA OD
OP
2
i.e., OB OD O and OC OA O
i.e., iff OB OC OA OD
i.e., if CB = DA
also equivalently OB OA OC OD
i.e., AB DC D C
5. P is the mid-point of AC P
OA OD
OP
2 A B
or 2OP OA OC.....................(i)
O Figure 20
Again, P is also mid-point of BD
1
OP = OB OC
2 …………….(ii)
or 2OP OB OD
Adding (i) and (ii) we get
or 4OP OA OC OB OD
or 4OP OA OC OB OD
6. Here, AB = (2 – 6) + (– 3+ 7) + (1+ 1)
=–4 +4
and AC = (4 – 6) + (0 + 1)
=– 2 2 +
clearly, AB = AC
So, AB AC are collinear vectors. Since AB AC are also
26 coinitial, therefore A, B and C are collinear points.
Vectors - 1
1.6 SUMMARY
In this unit, we discuss mathematical concept of vector. In section 1.2, first of all,
the concept, as distinct from that of a scalar, is defined. Then concepts of position
vector, direction cosines of a vector, coinitial vectors, collinear vectors, coplanar
vectors, are defined and explained. In section 1.3, method of expressing a vector
in 3-dimensional space in terms of standard unit vectors is discussed. In section
1.4, first, method of finding a vector joining two points is discussed. Then, section
formula for finding position vector of the point which divides the vector joining
two given points, is illustrated.
Answers/Solutions to questions/problems/exercises given in various sections of
the unit are available in section 1.5.
27
Vectors and Three
Dimensional Geometry UNIT 2 VECTORS – 2
Structure
2.0 Introduction
2.1 Objectives
2.2 Scalar Product of Vectors
2.3 Vector Product (or Cross Product) of two Vectors
2.4 Triple Product of Vectors
2.5 Answers to Check Your Progress
2.6 Summary
2.0 INTRODUCTION
In the previous unit, we discussed vectors and scalars. We learnt how to add and
subtract two vectors, and how to multiply a vector by a scalar. In this unit, we
shall discuss multiplication of vectors. There are two ways of defining product
of vectors. We can multiply two vectors to get a scalar or a vector. The former
is called scalar product or dot product of vectors and the latter is called vector
product or cross product of vectors. We shall learn many applications of dot
product and cross product of vectors. We shall use dot product to find angle
between two vectors. Two vectors are perpendicular if their dot product is zero.
Dot product helps in finding projection of a vector onto another vector. The cross
product of two vectors is a vector perpendicular to both the vectors.
If cross product of two vectors is zero then the two vectors are parallel (or
collinear). Cross product of vectors is also used in finding area of a triangle or a
parallelogram. Using the two kinds of products, we can also find product of
three vectors. Many of these products will not be defined. In this unit, we shall
discuss the two valid triple products, namely, the scalar triple product and the
vector triple product.
2.1 OBJECTIVES
After studying this unit, you should be able to:
define scalar product or dot product of vectors;
find angle between two vectors;
find projection of a vector on another vector;
28
define cross product or vector product of vectors; Vectors - II
use cross product to find area of a parallelogram vector product of vectors;
define scalar triple product and vector triple product of vectors.
2.2 SCALAR PRODUCT OF TWO VECTORS
Definition : The scalar product or the dot product of two vectors and ,
denoted by . is defined by
. =| || |
where is the angle between the vectors and .
Also the scalar product of any vector with the zero vector is, by definition, the
scalar zero. It is clear from the definition that the dot product . is a scalar
quantity.
Sign of the Scalar Product
If and are two non zero vectors, then the scalar product
. = | | | | cos
is positive, negative or zero, according as the angle , between the vectors is
acute, obtuse or right. In fact,
is acute cos 0 a.b 0
is right cos 0 a.b 0
is obtuse cos 0 a.b 0
Also, note that if and and are non zero vectors then . = 0 if and only if
and are perpendicular (or orthogonal) to each other.
If . is any vector, then the dot product . ., of with itself, is given by
. = | || | cos 0= | |2
Thus, the length | | of any vector is the non negative square root , i.e., of
the scalar product , i.e.,
| | = ,
Angle between two Vectors
If is an angle between two non zero vectors and , then
. = | || | cos
29
Vectors and Three
Dimensional Geometry
So, the angle between two vectors is given by
Properties of Scalar Product
1. Scalar product is cumulative, i.e., . = . for every pair of vectors and .
2. . (– ) = – ( . ) and (– ). (– ) = . for every pair of vectors and .
3. ( λ1 ) . (λ2 ) =( λ1 λ2) ( . ) where and are vectors and λ1 , λ2 are scalars
4. (Distributivity) .( + )= . + .
The following identities can be easily proved using above properties.
(i) ( + ).( – ) = a2 – b2 (here, a2 = . = | |2)
(ii) ( + )2 = a2 + 2 . + b2
(iii) ( – )2 = a2 – 2 . + b2
If , and are mutually perpendicular unit vectors, then
. = . = . = 1 and
. .= . = . =0 (1)
If and be two vectors in component
form, then their scalar product is given by
a1iˆ . (b1iˆ +b2 j b3kˆ) a2iˆ(b1iˆ +b2 j b3kˆ) a3kˆ(b1iˆ +b2 j b3kˆ) (using distributivity)
= a2b3 ( j.kˆ) a3b1 (kˆ.iˆ) a3b2 (kˆ.j) a3b3 (kˆ.kˆ) (using properties)
= a1 b1 + a2 b2 + a3 b3 (using (1))
Thus . = a1 b1 + a2 b2 + a3 b3 .
Projection of a Vectors on another Vector
Let = be two vectors
A
O L B
Figure 1
30
Drop a perpendicular form A on OB as shown in Figure 1. The projection of Vectors - II
on is the vector . If is the angle between and , then projection of
and has length | cos and direction along unit vector . Thus, projection
of on = (| | cos )
a.ba.b
b b
| b |2
|b|
a .b
The scalar component of project of a on b is . Similarly, the scalar
|b|
a .b
component of projection of b on a
|a|
Example 1: Find the angle between the following pair of vectors.
(a) +
(b)
Solution: (a) . = (2 + 3 ) . ( + 4 )
= 2.1 + 0.4 + 3 ( 1)
= 2 3= 1
= . = (2 + 3 ) . (2 + 3 )
= 2.2 + 0.0 + 3.3
= 13
|a| =
= . = ( +4 – ) . ( +4 )
= 1.1 + 4.4 + ( 3) ( 3)
= 26
|a| =
(b) Here, . = ( +2 + ). (2 + 2 + )
= 1.2 + 2.(–2) + 2.1
=0
= =3
31
Vectors and Three = =3
Dimensional Geometry
.
Example 2 : Show that is perpendicular to – , for any
two non zero vectors .
Solution : We know that two vectors are perpendicular if their scalar product is
zero.
( ).( )
= ( )+ .( )
(using distributivity)
( ) ( )+ ( ) ( )
( )+ ( ) =0
so, the given vectors are perpendicular.
Example 3 : Find the scalar component of projection of the vector
a 2iˆ 3 ˆj 5kˆ on the vector b 2i 2 ˆj kˆ.
Here,
2 2 2
and |b| = 2 ( 2) ( 1) = 3
Example 4 : Show that the diagonals of a rhombus are at right angles.
Solution : Let A B C D be a rhombus (Figure 2 )
D C
A B
32 (Figure 2)
ABCD being a rhombus, we have Vectors - II
= ( + ).( )
=
= – =0
2 2
( AB AD )
Example 5 : For any vectors and , prove the triangle inequality
| + |≤| |+| |
Solution : If = or = , then the inequality holds trivially.
So let | | ≠ 0 ≠ | |. Then,
= ( + )2 = ( + ). ( + )
=
= | |2 2 + | |2 ( = )
= | |2 2| | |cos | |2 where is the angle between and
| |2 2| | | | |2 ( cos 1 )
= (| | | |) 2
Hence | | | | | |
Remark : Let = and = , then + =
C
+
A B
Figure 3
As shown in figure 3 inequality says that the sum of two sides of triangle is
greater than the third side. If the equality holds in triangle inequality, i.e.,
| + | | | +| |
Then | AC | = | AB | + | BC |
showing that the points A, B and C are collinear.
Check Your Progress – 1
1. If = 5 –3 –3 and = + –5 then show that + and – are
perpendicular.
33
Vectors and Three 2. Find the angle between the vectors
Dimensional Geometry
(a) = 3 – +2 = – 4 +2
(b) = – –2 = –2 +2 +4
3. Find the vector projection of on where =3 –5 +2 and = 7 + –2 .
Also find the scalar component of projection of vector on .
4. Prove the Cauchy – Schwarz Inequality
| . | ≤ | || |
2
5. Prove that | – | = | | + | | 2 2
– .b
2 a
2.3 VECTOR PRODUCT (OR CROSS PRODUCT) OF TWO
VECTORS
Definition : If and are two non zero and non parallel (or equivalently non
collinear) vectors, then their vector product × is defined as
= | | | |sin
where is the angle between and (0 < < ) and is a unit vector
perpendicular to both and such that , and form a right handed system.
If and are parallel (or collinear) i.e., when = 0 or , then we define the
vector product of and to be the zero vector i.e., = . Also note that if
either or ,then
Properties of the Vector Product
1. = since = 0
2. Vector product is not commutative i.e., ≠ .
However, = –
We have = | || |sin where , and form a right handed system and
= | || a | |sin | where , and ight handed system. So the
direction of | is opposite to that of
Hence, =| || |sin
= –| || |sin
= – .
3. Let from a right–handed system of mutually perpendicular unit vectors
in three dimensional space. Then
= = = and
= =
Also, =– =–
Figure 4
34
4. Two non zero vectors and are parallel if and only if Vectors - II
=
5. Vector product is distributors over addition i.e., if , and
are three vectors, then
(i) ( ) = .
(ii) ( ) = .
6. If is a scalar and and are vectors, then
( = (
Vector Product in the component form
Let = a1 a2 a3 and
= b1 b2 b3
Then
= (a1 a2 a3 ) (b1 b2 b3
= a1 b1 ( ) a1 b2 ( ) a1 b3 ( ) a2 b1 ( ) a2 b3
( ) a2 b3 ( ) a3 b1 ) a3 b2 ( ) a3 b3
( )
= a1 b2 a1 b3 (– a2 b1 (– a2 b3 a3 b1 a3 b2 (–
= (a2 b3 a3 b2) (a1 b3 a3 b1) (a1 b2 a2 b1)
Example 6: Find if = and = 3
Solution : We have
= (3 – 2) – (3 – 1) + (2 – 1)
= –2
Example 7: Find a unit vector perpendicular to both the vectors
a 4iˆ ˆj 3kˆ and b 2i ˆj 2kˆ
Solution : A vector perpendicular to both and is
= (2 – 3) – (–8 6) (4 – 2)
=– 2
| | = = = 3.
So the desired unit vector is
35
Vectors and Three Example 8 : Prove the distributive law
Dimensional Geometry
a (b c ) a b a c
using component form of vectors.
Solution : Let = + +
= + + and
= + + .
So, + = + +( +
Now,
×( + )=
= + .
Example 9: Show that
| |2 = (
Solution : | |2 = | || | sin
| |2 = (| || | sin )2
= | |2| |2 (1– cos2 )
2 2
= | | | b | – ( | a |2| |2 cos2 )
a
(aa) 2 (bb) (a.b) 2
Example 10 : Find | | if
| | = 10, | | = 2, = 12.
Solution : Here = 12
36
Area of Triangle Vectors - II
Let , be two vectors and let be the angle between them ( O < < ). Let O
be the origin for the vectors as shown in figures (Fig. 5) below and let
= , =
B D
θ
O C A
Figure 5
Draw BC OA.
Then BC = OB Sin = |b| sin
Thus, if and represent the adjacent sides of a triangle, then its area is given as
Area of a Parallelogram
In above figure, if D is the fourth vertex of the parallelogram formed by O, B, A
then its area is twice the area of the triangle OBA.
Hence, area of a parallelogram with and as adjacent sides = |
Example 11: Find the area of ABC with vertices A (1,3,2), B (2, –1,1) and
C(–1, 2, 3).
Solution : We have
= –
= (2 – 1) (–1 – 3) (1 – 2)
= –4 –
and = ( –1 – 1) (2 – 3) (3 – 2)
=–2 –
37
Vectors and Three
Dimensional Geometry
Example 12 : Show that ( – ) ( ) = 2( ). Interpret the result
geometrically.
Solution : ( – ) ( )
=( – ) ( – )
= – –
= 0 0
=2( )
Let ABCD be a parallelogram with = and =– .
Then area of parallelogram = =
D C
b
A a B
Figure 6
Also, diagonal = +
and diagonal = –
( ) ( )=
= area of parallelogram formed by and .
Thus, the above result shows that the area of a parallelogram formed by diagonals
of a parallelogram is twice the area of the parallelogram.
Check Your Progress – 2
1. Find a unit vector perpendicular to each of the vector ( + ) and ( – ),
where = 2 – 4 and = – 2
2. Show that
( ) ( ) ( )=
38
3. For Vectors Vectors - II
= –2
Compute ( and ( ).
is ( × = ( ).
4. If the vectors , and satisfy + + = 0, then prove that
= =
5. Find the area of a parallelogram whose diagonals are
= 3 + –2
2.4 TRIPLE PRODUCT OF VECTORS
Product of three vectors may or may not have a meaning. For example,
( . as is a scalar and dot product is defined only for
vectors. Similarly, ( . has no meaning. The products of the type
( and are meaningful and called triple products. The
former is a vector while the latter is a scalar.
Scalar Triple Product
Definition : Let , and be any three vectors. The scalar product of . )
is called scalar triple product of , and and is denoted by [ , ]. Thus
[ , ] = .( .
It is clear from the definition that [ , ]. Is a scalar quantity.
Geometrically, the scalar triple product gives the volume of a parallelepiped
formed by vectors , as adjacent sides.
Scalar Triple Product as a determinant
Let =
and =
Then
.(
=( –
= –
39
Vectors and Three
Dimensional Geometry =
Thus, .(
Note : We can omit the brackets in .( because
( . is meaningless.
Properties of Scalar Triple Product
1. [ , =[
=–[ ]=–[ ,
This is clear if we note the properties of a determinant as [ , can be
expressed as a determinant.
2. In scalar triple product .( , the dot and cross can be interchanged.
Indeed, .( =[ =[
= =
3. [ pa, qb, rc ] pqr[a, b, c] where p, q and r are scalars. Again it is clear
using properties of determinants.
4. If any two of are the same then [ For example,
[ ,
Coplanarity of three vectors
Theorem : Three vectors are coplanar if and only if [
Proof : First suppose that are coplanar . If are parallel
vectors, then If are not parallel,
then being perpendicular to plane containing is also
perpendicular to because
Conversely, suppose that [ , = 0. If are both non zero, then
are perpendicular as their dot product is zero. But is
perpendicular to both and hence must lie in a plane, i.e.,
they are coplanar. If = then are coplanar as zero vector is
coplanar with any two vectors. If = , then
, must be coplanar.
Note : Four points A, B , C and D are coplanar if the vectors , and are
coplanar.
40
Example 13 : If = 7 – 2 +3 = – 2 +2 , and =2 +8 Vectors - II
find [ , ,
Solution : [ , , = .( ×
= 7(0 – 16) + 2(0 – 4) + 3(8 + 4)
= –112 – 8 + 36
= – 84
Example 14 : Find the value of λ for which the vectors
= –4 + = λ – 2 + , and = 2 + 3 + 3 are
coplanar,
Solution : If , and are coplanar, we have
= .( = 0 i.e.,
1(–6 –3) + 4(3 – 2) + (3 + 4) = 0
Example 15 : If , , are coplanar then prove that , and are also
coplanar.
Solution : Since , , are coplanar,
[ , ,
Now [ , ] =( ) .( )
= ( + ) .[( +( ]
= ( + ) .[ × ] ( as 0
= .( a .( ) + .( )+ ( + ( )+
=[ , , [ , , +
= 2[ , , (using property (4)
=0
41
Vectors and Three Vector Triple Product
Dimensional Geometry
Definition : Let , , and any three vectors. Then, the vectors ( ) and
( ) are called vector triple products.
It is clear that, in general
( ) ( )×
Note that ( ) is a vector perpendicular to both and . And also
is perpendicular to both and . Thus ( ) lies in a plane containing
the vectors and , i.e., ( ), and are coplanar vectors.
We now show that for any three vectors ,
( )=( –(
Let =
and = Then
=( – +( – +( –
(
– – –
= [ ( – + – (
+[ (
Also, (1)
=(
(
= [ (
[ (
[ (
= [ (
[ (
[ ( (2)
42
From (1) and (2), we have Vectors - II
( =( –(
It is also clear from this expression that ( is a vector in the plane of
and
Now = – (
=–[ –( )
= ( )
= ( )
So, ( is a vector in the plane of .
Theorem : Let be any three vectors. Then
if and only if are collinear.
Proof : First suppose
Now, (
and ( (
So, (a.b)c (b.c)a
Conversely, suppose that
. Then
–( –
and – ( –
So, – (
( ( =(
i.e., (
Example 16 : Show that
Solution :
=( –( . ) –( ) + ) –(
= since dot product is commutative.
Example 17 : Let be any four vectors. Then
prove that
(i) ( )=[ ]c [
(ii) ( )=[ ] [
43
Vectors and Three Solution : (i) Let = Then
Dimensional Geometry
( )= )
=(
=(
=[ –
=[
=[
(ii) Let = . Then
( ) =(
(
= – [( r –(
=(
=(
=( ) –( )
=[ , ] –[ ]
Example 18 : Prove that
[ , , a =
Solution : [ , , a
= ). [ × ) (
= )[ ) )
= ). [ ) a c ] ( )
= ) [ ) ] = [a )][ )]
=[ ]2.
Example 19 : For vectors =
and = verify that
) )
Solution : We have
× =
44
=3 +3 +3
So, ( Vectors - II
= – 9 –6 – 3 (1)
Also,
= ( –2 + .( + 2 +
=1–4–1=–4
( ) =–4 ( + + = –8 –4 –4
and = ( +2 + .( + + =1
( ) = +2 –
Thus, ( ) –( ) = –6 – (2)
Hence, from (1) and (2)
)=( ) –( )
Check Your Progress – 3
1. For vectors = + , = +2 = + +2 find [ , ].
2. Find the volume of the parallelepiped whose edges are represented by
= –3 , = + = – +2
3. Show that the four points having position vectors
+ , 6 +11 +2 + 6 i + + 4 are coplanar.
4. Prove that
( ). ( ) = ( . )( . ) – ( )( . )
5. For any vector prove that
( )+ ( ) + ( )=2
6. Prove that
[ ( )] = ( . ) ( × )
2.5 ANSWERS TO CHECK YOUR PROGRESS
Check Your Progress – 1
1. Here, + = +2 and
– = –4 +2
So, ( + ). ( – ) = ( + 2 –4 +2
= 24 – 8 – 16 = 0
Hence + and + are perpendicular vectors.
45
Vectors and Three
2. (a) Here, . = 3 (– 4) + (– 1). 0 +2.2
Dimensional Geometry
= – 12 + 4 = – 8
| |= =
| |= =
(b) Here, . = 1(– 2) + (– 1) 2 + (– 2) 4
= – 12
| |= =
| |= =
θ=
3. Vector Projection of on
a.b
2 b
|b|
4. The inequality holds trivially if (a b) c a (b c ) 0, b 0
Now, =| | | cos
Hence ≤| |b |
5. =
= –
= – 2 +
( dot product is commulative)
46
Check Your Progress – 2 Vectors - II
1. Here =2 +
= 3
Let = . Then is vector perpendicular to both
Now =
= (–6 + 6)
= 12
A unit vector in the direction of is
So, is a unit vector perpendicular to both
2. ) a ( )
= (using distributivity)
= – – (
=– and =– =0
3. = –
=–5
Also,
= –
Clearly,
47
Vectors and Three 4.
Dimensional Geometry
i.e., +
i.e., + 0 (
i.e., =–
i.e., = ……………..(1)
Similarly,
=
i.e., +
i.e., =–
i.e., = ……………. (2)
From (1) and (2), we have
5. Let ABCD be the parallelogram
D C
A B
Figure 7
So area of parallelogram ABCD
48 = |
Vectors - II
Now, | =
= (2 – 3) – (1+ 6) + (–1 – 4)
= –1 –7 –5
| AB AD | =
=5
Hence, the area of parallelogram ABCD = 5
Check Your Progress – 3
1. = = 3 +5 –7
( = (2 ). (3 )
= 6 + 5 –21
= –10
2. Volume of Parallelopiped = | ( |
Now, ( =
=–7
Volume = | –7| = 7
3. Let = − +2
= + +2
= +2 + 6
So, = – = +12
= OC – = –9 +4
49
Vectors and Three
Dimensional Geometry
AB, BC and CD are coplanar.
Hence A, B, C and D are coplanar.
4. Let × = Then
( ). ( ) = r .( )
= (r ).
= (( ) ).
= [(
=( )–( . )
=( )–( )
5. L.H.S. = ( ) ( ) ( )
=[( )i [( )
= )
i
= )
Let =
So, –
Similarly, =
L.H.S. = 3 –
=3
6.
= .
= (
=–( ( 0
= ( (
50
Vectors - II
2.6 SUMMARY
This unit discusses various operations on vectors. The binary operation of scalar
product is discussed in section 2.2. In the next section, the binary operation of
vector product (also, called cross product) is illustrated. Finally in section 2.4, the
ternary operation of tripe product of vectors is explained.
Answers/Solutions to questions/problems/exercises given in various sections of
the unit are available in section 2.5.
51
Vectors and Three
Dimensional Geometry UNIT 3 THREE-DIMENSIONAL GEOMETRY – 1
Structure
3.0 Introduction
3.1 Objectives
3.2 Three Dimensional Space
3.3 Equation of a Straight Line in Space
3.4 Shortest Distance Between Two Lines
3.5 Answers to Check Your Progress
3.6 Summary
3.0 INTRODUCTION
Let us recall the concepts of two dimensional geometry. A point in plane is
represented by an order pair of real numbers by a two-dimensional Cartesian
coordinate system. In this unit, we shall see that a point in space is uniquely
determined by an order triple of real numbers by a three dimensional Cartesian
coordinate system. Once we have established a one to one correspondence
between points in space and ordered triple of real numbers, we can extend the
concept of distance between two points in space. We shall study distance formula
for finding distance between two given points in space.
Also recall that we introduced the concepts of direction cosines and direction
ratios of a vector. Infact, the same concept are valid for a directed line also.
Infact, the concept of slope of a line in two dimensional plane is extended by
direction cosines and direction ratios of a line in three dimensional plane.
We shall also study various forms of equation of a straight line in space. A
straight line in space is uniquely determined if we know a point on the line and
direction of the line or if we know two points on the line. Thus, we shall obtain
equation of a straight line with a given point and parallel to a given direction, and
equation of a straight line passing, through two given points. These equations are
obtained both in vector and Cartesian forms.
Also recall that two lines in a plane either intersect or are parallel (or are
coincident). But in space, we may have two non-intersecting and non-parallel
lines. Such lines are called skew lines. In the last section, we shall introduce the
concept of distance between two lines and find formula for calculating the
shortest distance between two skew lines.
52
Three Dimensional
3.1 OBJECTIVES Geometry − I
After completing this unit, will be able to :
find the distance between two points in space;
find the direction cosines and direction ratios of a line passing through two
points;
find the equation of a straight line passing through a given point and parallel
to a given vector in vector form and in Cartesian form;
find the vector and Cartesian equations of a line passing through two given
points;
define the terms skew lines and coplanar lines; and
find the distance between two skew lines.
3.2 THREE DIMENSIONAL SPACE
Let us recall that a point in plane is uniquely determined by an ordered pair of real
numbers through a two dimensional Cartesian coordinate system. Similarly, there
is one to one correspondence between points in space and ordered triplets of real
numbers through a three dimensional Cartesian coordinate system, by fixing a
point 0 as origin 0 and three mutually perpendicular lines through O as x-axis,
y-axis and z-axis. The three axes are taken in such a way that they form a right-
handed system. With any point P, we associate a triple of real number (x,y,z) in
the following manner :
We drop a perpendicular from P to the xy–plane meeting it at M and take PM = z.
From M drop perpendiculars on x-axis and y-axis meeting them at A and B
respectively. Take MB = x and MA = y
z
P(x,y,z)
B y
A M
x Figure 1
53
Vectors and Three Also, given a triple (x,y,z) we can locate a point P in space uniquely whose
Dimensional Geometry
Cartesian coordinates are (x,y,z)
Distance between two Points
Recall from the Unit ‘Vectors – I’ that if P is any point with coordinate (x,y,z) and
position vector then
=x +y
The distance OP of any point P(x,y,z) from the origin is given by
OP = = =
Similarly, if P ( are two points with postion
vectors
Then
= =
= –
=( ( + (
and PQ = | =|
O Figure 2
Thus, the distance between two points P ( is given by
PQ =
54
We have studies section formula (in Unit – 1 on Vectors) to find position vector Three Dimensional
Geometry − I
of a point R which divides the line segment joining the points P and Q with
position vectors and respectively. If is the position vector of
R, then
If P has coordinates P ( R has
coordinates (x,y,z), then
If we put m= n= 1, we get the coordinate of mid-point of PQ given as
Example 1 : Find the distance between the points P(1, –1, 0) and Q (2, 3, –1)
Solution : PQ =
= =
Direction Cosines and Direction Ratios
If are the angles which a non-zero vector makes with positive
x–axis, y –axis and z– axis respectively, then cos cos and cos are called
the direction cosines of we write
l = cos m = cos and n = cos
Also, + + =1
If a, b, c are numbers proportional to l, m and n respectively, then a, b, c are
called the direction ratios of
55
Vectors and Three with + + = 1.
Dimensional Geometry
Which gives
If = a + b is any vector, its direction ratios are a, b, c and its direction
cosines are
Consider the line joining the points P ( whose
position vectors
are and
Now AB =
= –
Therefore, direction ratios of AB are And the
direction cosines of AB are
Where =
Thus, the direction cosines of a line joining points A(
are given by
56
Three Dimensional
Geometry − I
Where AB is the distance between A and B
Example 2 : Find the direction cosines of a line which makes equal angles with
the axes.
Solution : Let l, m, n be the direction cosines of the given line. Then
Since the given line makes equal angles with the axes, therefore, we have
l=m=n
So, +
Example 3: Find the direction cosines of the line passing through the two points
(1,2,3) and (–1,1,0)
Solution : We know that the direction cosines of the line passing through two
points A( are given by
AB =
Here A is (1,2,3) and B is (–1,1,0)
So, AB,
where AB = – –
= =
57
Vectors and Three Thus, the direction cosines of line joining A and B are
Dimensional Geometry
Check Your Progress 1
1. Prove by finding distances that the three points (–2,3,5), (1,2,3) and
( 7,0, 1) are collinear.
2. Show that the points (0,7,10) (–1,6,6) and (–4,9,6) from an isosceles right
angled triangle.
3. The direction ratios of a line are 1, –2, –2. What are its direction cosines ?
4. A line makes angles of 45 and 60 with the positive axes of x and y
respectively. What angle does it make with the positive axis of x ?
5. Find the direction cosines of the line passing through the two points
(–2, 4, 5) and (1,2,3).
3.3 EQUATION OF A STRAIGHT LINE IN SPACE
A line in space is completely determined once we know one of its points and its
direction. We shall use vectors to measure direction and find equations of straight
line in space.
(a) Equation of a straight line passing through a fixed point A and
parallel to the vector
Let be the position vector of the given point A and let be the position vector
of any point P on the given line.
A t
P
O Figure 3
We have
=
58
Since is parallel to , we must have =t for some scalar t. Three Dimensional
Geometry − I
= +t
Thus, each point P on the line has position vector + t for some scalar t.
Conversely, for each value of the scalar t, + t is the position vector of a
point of the line.
Hence, the vector equation of the line is
= +t
Where t is a parameter.
Let us now write (1) in Cartesian form.
Let the coordinates of point A be (
So that =
Suppose the line has direction ratios a, b and c, then =
Substituting in (1), we get
= +t(
Equating the coefficients of we get
x= y= and z = (2)
These are the parametric equations of the line.
Eliminating the parameter t, from (2), we get
This the Cartesian equation of a straight line.
Cartesian Equation of a straight line passing through the point ) and
having direction cosines l, m, n is given by
Equations (1), (2), (3) and (4) are different forms of equations of a straight line
passing through a given point and parallel to a given direction.
59
Vectors and Three (b) Equation of a straight line passing through two given points
Dimensional Geometry
Let us now find equation of a straight line passing through two distinct points
A( B( . Let be the position vectors of the points
A and B respectively.
Since the points A and B lie on the line therefore is parallel to the line.
Now, = –
= –
l
–
O Figure 4
Thus, the vector equation of line passing through A and parallel to is
= (5)
Equation (5) is the vector equation of a line passing through two points with
position vectors and .
Equation (5) can also be written as
= (1 – t) R (6)
Let us now derive the Cartesian form the vector equation (5)
We have
Substituting these values in (5), we get
= +(
Equating the coefficients of , we get
60
Eliminating t, we obtain Three Dimensional
Geometry − I
Equation (7) is the Cartesian form of equation of a straight line passing through
two points ( and (
Example 5 : Find the equations of the line (both Vector and Cartesian) passing
through the point (1, –1,–2) and parallel to the vector
Solution : We have
and
Therefore, the vector equation of the line is
=( )+t(
Now is the position vector of any point P (x,y,z) on the line.
So,
)+t(
= (1 + 3t) – (1 + 2t) + (–2 + 5t)
Thus x = 1 +3t, y = –1 –2t, z = –2 + 5t
Eliminating t, we get
Example 6 : Find the Vector and Cartesian equation of the line passing through
the points (–2, 0, 3) and (3,5, –2)
Solution : We have
= –2 and
=3
So, 5
The vector equation of a line passing through two points with position vectors
is given by
= –
= ( –2 and t ( 5 )
61
Vectors and Three If is the position vector of the point P (x, y, z) then we have
Dimensional Geometry
x = (–2
= (–2
So, x = –2 +5t, y = 5t, z = 3–5t
Eliminating t, we get
Example 7 : The Cartesian equation of a line is
Find the Vector equation of the line.
Solution : Comparing the given equation with the standard form
We get
=–3, a = 4, b = 5, c = 1
Thus, the required line passes through the point (–3, 2, –5) and is parallel to the
vector 4
Thus, the equation of line in vector form is
)+t )
Angle between two lines
Consider the two lines with vector equations
= +t
= +t
The angle between these lines is defined as the angle between the directions of
and Also, we know that the angle between the vectors and is given
by
Thus, (10) gives the angle between the lines (8) and (9). If the equation of two
62 lines are given in Cartesian form
Three Dimensional
Geometry − I
then the angle between them is given by
Cos (11)
as sin2 = 1– cos2 , therefore, we also have
sin (12)
Thus, the angle between two lines whose direction ratios are
and is given by (11) or (12).
If instead of direction ratios, we take direction cosines l, m, n and
of the two lines, then (10) and (11) can be written as
cos = and
and sin =
It is clear from these relations that two lines are perpendicular to each other if and
only if
=0
and parallel to each other if and only if
=0
Similarly, two lines with direction ratios , and , are
(i) perpendicular iff , and
(ii) parallel iff
63
Vectors and Three Example 8: Find the angle between the lines
Dimensional Geometry
+t )
+s )
Solution : Here and 3
If is the angle between the two lines, then
Example 9 : Find the angle between the pair of lines
Solution : The direction ratios of the line
are 2, 1, and –3. similarly, the direction ratios of the line
Therefore, the angle between them is given by
cos
64
Example 10: Find the equation of the line passing through the point (–1,3,–2) Three Dimensional
and perpendicular to the two lines Geometry − I
Solution : Let the equation of the given line be
Since (i) is perpendicular to both the lines therefore,
l +2m +3n = 0 ……………………(ii)
–3l +2m +5n = 0 …………………(iii)
Solving (ii) and (iii) we get
Or
The required equation is
Check Your Progress 2
1 Find the Vector equation of the line passing through the point (3,1,4) and
parallel to the vector – Also find the Cartesian equation of the
line.
2 Find the vector and Cartesian equation of the line passing through (1,0,–4)
and is parallel to the line
3. Find the vector equation for the line through the points (3,4,–7) and (1, –1,6)
Also find the Cartesian equation.
4. Find the angle between the following pairs of lines.
65
Vectors and Three 5. Find k so that the lines
Dimensional Geometry
are at right angles.
3.4 SHORTEST DISTANCE BETWEEN TWO LINES
Two lines in space may either lie in the same plane or in different planes. In the
former case, such lines are called coplanar lines. Clearly line which do not lie in
the same planes are called non coplanar lines. We know that two lines in plane
are either intersecting or parallel. But in space, two non coplanar lines may
neither intersect, nor be parallel to each other . Such lines are called skew lines.
Definition : Two non coplanar liens are called skew lines if they are neither
parallel nor intersecting.
The shortest distance between two lines is the join of a point in one line with one
point on the other so that the length of the segment so obtained is the smallest.
Clearly, the shortest distance between two intersecting lines is zero and shortest
distance between two parallel lines is the distance by which the two lines are
separated. For skew lines, the direction of shortest distance is perpendicular to
both the lines.
Let us now find an expression for the shortest distance between two skew lines.
Consider two skew liens and (Fig. 5 ) with vector equation
and
Let A and C be points on
Let A and C be points on and with position vectors respectively.
C M
A L
Figure 5
The line LM of shortest distance is perpendicular to both and therefore is
66
parallel to ×
The length of LM is the project of Three Dimensional
Geometry − I
So, LM = AC |Cos |, when is the angle between on
Now a unit vector along by
Hence, LM = AC |Cos
Remarks :
1. Two lines will intersect if and only if the shortest distance between them is
zero i.e. LM = 0
or ( – ) ( – ) = 0
2. If two lines are parallel and are given by = + t and = +p ,
then they are coplanar. Then the distance between these two lines is given by
This is because d = LM = AC |cos – | (see. Fig. 6) so that
67
Vectors and Three
Dimensional Geometry
C(M)
A L
Figure 6
Cartesian form the distance between skew lines
Let the equation of two skew lines
The corresponding vector from equation of and respectively are
)+t )
)+ ).
Comparing these equations with = and = and substituting
the values in (i), we see that the distance between and is
Example 11 : Find the shortest distance between the lines
)+t )
and )+ )
Solution : Comparing with equations = +t and = +t , we have
68
=
Three Dimensional
= Geometry − I
– =2
and =
So | = =
Thus, Shortest distance
Example 12 : Find the shortest distance between the lines whose vector
equations are :
and
Solution : The two equations are:
– –
Here, we have
=2
So, – =
69
Vectors and Three
Dimensional Geometry and =
So | = =3
Hence, the shortest distance between the two lines =
Example 13 : Show that the lines
intersect.
Solution : Given lines are :
converting these equations into vectors, we get
)+t )
)+s )
Comparing with equations = +t and = +t respectively, we have
=
=
=
=7
70 =3
Three Dimensional
and = Geometry − I
= .
Now ( ). (| =
Thus, the shortest distance between the two lines =
Hence, the two lines intersect.
Check Your Progress – 3
1. Find the shortest distance between the two lines whose vector equations
are
+t )
and )+s )
2. Find the shortest distance between the two lines
and
3. Find the distance between the lines
4. Determine whether the following pair of lines interest
– +
– +
3.5 ANSWERS TO CHECK YOUR PROGRESS
Check Your Progress – 1
1. Let A, B, C denote the points (–2,3,5), (1,2,3) and (7,0,–1) respectively
Then AB =
= =
BC =
71
Vectors and Three AB = = =
Dimensional Geometry
AC =
Therefore, AB + BC = AC
Hence, the three points are Colliner.
2. Let A (0,7,10), B (–1,6,6) and C(–4,9,6) denote the given points. Then
AB =
AB = =
BC=
= =
AC =
AC = =6
Since AB = BC, therefore, the triangle
Further, + = +
Also
Hence, is a right angled triangle.
3. Let a = 1, b = –2, c = –2
The direction cosines are
72
4. Let be the angles which the line makes with the x-axis, y-axis, y- Three Dimensional
axis and z-axis respectively. Geometry − I
and cos = cos 60 =
Now, cos2 + cos2 + cos2 =1
Or cos2 = i.e., cos2 =
= 60 or 120
5. Let A(–2, 4, –5 and B(1, 2, 3) denote the given points. Then
AB = = =
The direction cosines of the line joining the points A and B are given by
Hence, the direction cosines are
Check Your Progress – 2
1. We have
and
Therefore, the vector equation of the line is
)+t(
If is the position vector of point (x, y, z), then
=(
73
Vectors and Three = (3–t) + (1–t) + (4–2t)
Dimensional Geometry
x = 3 – t, y = 1 + t, z = 4–2t
Eliminating t, we get
which is the equation of line in Cartesian form.
2. A vector parallel to the line
is
Thus we have to find equation of a line passing through (1, 0, 4) & parallel
to the vector
So, and =
+t(
Also, the Cartesian equation of the line is
3. Let A (3, 4,–7) and B(1, –1, 6) denote the given points. The direction
ratios of AB are 1–3, –1–4, 6+7 or –2, –5, 13
Also as A (3, 4, –7) lies on the line,
= =
Hence, the vector equation is
i.e., ( )
Also, Cartesian equation of a line passing through the points
( is
So, the required Cartesian equation is
74
4(i) The given liens are Three Dimensional
Geometry − I
Therefore, the direction ratios of line (1) are 1, 0, –1 and the direction
ratios of line (2) are 3,4,5
If is the angle between the two lines, then
Cos =
(i) Here, and
If is the angle between the two lines,
Hence = cos-1
5. The given lines are
The direction ratios of line (1) are –3, 2k, 2 and direction ratios of line (2) are 3k,
1, –5. Since the lines (1) and (2) are at right angles, therefore
(–3) (3k) + (2k)(1) + 2(–5) = 0
or –9k + 2k –10 = 0
or –7k = 10
75
Vectors and Three Check Your Progress – 3
Dimensional Geometry
1. Here
=
=
= and
=
= (2 =
and =
= =
| =
The shortest distance between the two lines is
2. The given equation can be written as
)+t ) and
)+s )
=(
= –4
Also, =
76
|= = Three Dimensional
| Geometry − I
The shortest distance between the two lines is
3. The given lines are
Converting these equations into vector form, we have
)+t )
)+s )
Comparing these equation with
and
Now, =( )=
and
| |= = =
77
Vectors and Three 4. The given lines are
Dimensional Geometry
+ ) and
+µ )
Now, =
and =
| |= =
3.6 SUMMARY
The unit, as the title suggests, is about three-dimensional geometry. In section
3.2, first, the concept of three dimensional space is illustrated. Then formula for
distance between two points in three-dimensional space, is derived. Then, the
concepts of direction cosines and direction ratios are explained. In section 3.3,
formulae for finding equations of a straight line are derived when (i) a point of the
line and a vector parallel to the required line are given and when (ii) a pair of
points is given. In section 3.4, formula for finding shortest distance between pair
of straight lines in three-dimensional space, is first derived and then is used in
solving problems.
Answers/Solutions to questions/problems/exercises given in various sections of
the unit are available in section 3.5.
78
Linear Programming
UNIT 4 LINEAR PROGRAMMING
Structure
4.0 Introduction
4.1 Objectives
4.2 Linear Programming
4.3 Techniques of Solving Linear Programming Problem
4.4 Cost Minimisation
4.5 Answers to Check Your Progress
4.6 Summary
4.0 INTRODUCTION
We first make the idea clear through an illustration.
Suppose a furniture company makes chairs and tables only. Each chair gives
a profit of ` 20 whereas each table gives a profit of `30. Both products are
processed by three machines Ml, M2 and M3. Each chair requires 3 hrs 5 hrs
and 2 hrs on Ml, M2 and M3. respectively, whereas the corresponding figures
for each table are 3, 2, 6. The machine M l can work for 36 hrs per week,
whereas M2 and M3 can work for 50 hrs and 60 hrs, respectively. How many
chairs and tables should be manufactured per week to maximise the profit?
We begin by assuming that x chairs and y tables, be manufactured per week.
The profit of the company will be ` (20x + 30y) per week. Since the objective
of the company is to maximise its profit, we have to find out the maximum
possible value of P = 20x + 30y. We call this as the objective function.
To manufacture x chairs and y tables, the company will require (3x + 3y) hrs
on machine M1 . But the total time available on machine M1 is 36 hrs.
Therefore, we have a constraint 3x + 3y ≤ 36.
Similarly, we have the constraint 5x + 2y ≤ 50 for the machine M2 and the
constraint 2x + 6y ≤ 60 for the machine M3.
Also since it is not possible for the company to produce negative number of
chairs and tables, we must have x ≥ 0 and y ≥ 0. The above problem can now be
written in the following format :
79
Vectors and Three Maximise
Dimensional Geometry
P = 20x + 30y
subject to
3x + 3y ≤ 36
5x + 2 y ≤ 50
2 x + 6y ≤ 60
and x ≥ 0, y ≥ 0
We now plot the region bounded by constraints in Fig. 1 The shaded region is
called the feasible region or the solution space as the coordinators of any point
lying in this region always satisfy the constraints. Students are encouraged to
verify this by taking points (2,2),(2,4) (4,2) which lies in the feasible region.
25
5x
+2
y=
50
12
(3,
9)
10
2x
+6
y=
60
3x
+ 3y
= 36
0 10 12 30
Figure 1
We redraw the feasible region without shading to clarify another concept (see
Figure 2).
For any particular value of P, we can draw in the objective function as a straight
2
line with slope This is because P = 20x + 30 y is a straight line, which
3
can be written as
2 P
y= x
3 30
80
Linear Programming
A(0,10)
10
B(3,9) ‘Equal Profit’ lines
Direction of
Increasing Profit
0(0,0) 10
Figure 2
and this generates a family of parallel lines with slope but with different
intercepts on the axes. On any particular line, the different combinations of x
and y (chairs and tables) all yield the same profit (P).
higher y-intercepts yield higher profits.
The problem is therefore to maximise the y-intercept, while at the same time
remaining within constraints (or, feasible region). The part of the profit line
which fall within the feasible region have been heavily drawn. Profit lines drawn
farthest away from the origin (0, 0) yield the highest profits. Therefore, the
highest profit yielded within the feasible region is at point B(3, 9). Therefore,
the maximum profit is given by ` (20× 3 + 30× 9) = ` 330.
We are now ready for the definition of linear programming – the technique of
solving the problem such as above.
What is Linear Programming
Linear because the equations and relationships introduced are linear. Note that
all the constraints and the objective functions are linear. Programming is used in
the sense of method, rather than in the computing sense. 81
Vectors and Three Infact, linear programming is a technique for specifying how to use limited
Dimensional Geometry
resources or capacities of a business to obtain a particular objective, such as
least cost, highest margin or least time, when those resources have alternative
uses.
4.1 OBJECTIVES
After studying this unit, you should be able to:
define the terms-objective function, constraints, feasible region,
feasible solution, optimal solution and linear programming;
draw feasible region and use it to obtain optimal solution;
tell when there are more than one optimal solutions; and
know when the problem has no optimal solution.
4.2 LINEAR PROGRAMMING
We begin by listing some definitions.
Definitions
Objective Functions: If a1, a2, . . . , an are constants and x1 x2, ..., xn are
variables, then the linear function Z = a1x1 + a2x2 +...+ anxn which is to be
maximised or minimised is called objective function*.
Constraints: These are the restrictions to be satisfied by the variables x1,
x2 ..., xn. These are usually expressed as inequations and equations.
Non-negative Restrictions: The values of the variables x1 x2, ..., xn
involved in the linear programming problem (LPP) are greater than or
equal to zero (This is so because most of the variable represent some
economic or physical variable.)
Feasible Region: The common region determined by all the constraints of
an LPP is called the feasible region of the LPP.
Feasible Solution: Every point that lies in the feasible region is called a
feasible solution. Note that each point in the feasible region satisfies all the
constraints for the LPP.
Optimal Solution: A feasible solution that maximises or minimizes the
objective function is called an optimal solution of the LPP.
* In this unit we shall work with just two variables.
82
Definition Linear Programming
Convex Region
A region R in the coordinate plane is said to be convex if whenever we take two
points A and B in the region R, the segment joining A and B lies completely in
R.
The student may observe that a feasible region for a linear programming is a
convex region.
One of the properties of the convex region is that maximum and minimum values
of a function defined on convex regions occur at the corner points only. Since
all feasible regions are convex regions, maximum and minimum values of
optimal functions occur at the corner points of the feasible region.
The region of Figure 3 is convex but that of Figure 4 is not convex.
y B y
B B
A
A
A
o x o x
Figure 3 : Convex Region Figure 4 : Not Convex
4.3 TECHNIQUES OF SOLVING LINEAR PROGRAMMING
PROBLEM
There are two techniques of solving an L.P.P. (Linear Programming Problem)
by graphical method. These are
(i) Corner point method, and
(ii) Iso profit or Iso-cost method.
The following procedure lists the coner point method.
Corner Point Method*
Step 1 Plot the feasible region.
Step 2 Find the coordinates of the cornor points of the feasible region.
Step 3 Calculate the value of the objective function at each of the corner points
of the feasible region.
Step 4 Pick up the maximum (or minimum) value of the objective function
from amongst the points in step 3.
* The method explained in Example 1 is the iso-profit method. You are advised to use corner
method unless you are specifically asked to do the problem by the iso -profit or iso-cost
method.
83
Vectors and Three Example 1 Find the maximum value of 5x + 2y subject to the constraints
Dimensional Geometry
–2x – 3y ≤ –6
x – 2y ≤ 2
6x + 4y ≤ 24
–3x +2y ≤ 3
x ≥ 0, y ≥ 0.
Solution
Let us denote 5x + 2y by P.
Note that –2x –3y ≤ –6 can be written as 2x + 3 y ≥ 6.
We can write the given LPP in the following format :
Maximise
P = 5x + 2y
subject to
2x + 3y ≥ 6 (I)
x – 2y ≤ 2 (II)
6x + 4y ≤ 24 (III)
–3x +2y ≤ 3 (IV)
and x ≥ 0, y ≥ 0
We plot the feasible region bounded by the given constraints in Figure 5
The lines I and II intersect in A (18/7, 2/7)
The lines II and III intersect in B (7/2, 3/4)
The lines III and IV intersect in C (3/2, 15/4)
The lines IV and I intersect in D (3/13, 24/13)
Let us evaluate P at A, B, C and D
P(A) = 5 (18/7) + (2/7) = 94/7 P(B) = 5 (7/2) + 2(3/4) =19
P(C) = 5 (3/2) + 2(15/4) = 15 P(D) = 5 (3/13) + 2(24/13)= 63/13
Thus, maximum value of P is 19 and its occurs at x = 7/2, y =3/4.
84
Linear Programming
III
6x
+
4
y
=
24
4)
5/
2, 1
I
/
(3
C
2x
+3
y =
6
/ 4)
D / 2,3
7
B(
IV A
0 1 2 3 4 5 6
3
=
2y
x+
-3
2
II 2 y=
-1 x-
-
Figure 5
Example 2 Find the maximum value of 2x + y subject to the constraints
x + 3y ≥ 6
x – 3y ≤ 3
3x + 4y ≤ 24
–3x + 2y ≤ 6
5x + y ≥ 5
x, y ≥ 0
Solution
We write the given question in the following format :
Maximise
P = 2x + y
subject to
x + 3y ≥ 6 (I)
x – 3y ≤ 3 (II)
3x + 4y ≤ 24 (III)
–3x + 2y ≤ 6 (IV)
5x + y ≥ 5 (V)
and x≥ 0, y ≥ 0 (VI)
85
Vectors and Three The feasible region is sketched in Figure 6
Dimensional Geometry
V
6
C(4/3,5)
I 3
E B
1
A(9/2,1/2)
-2 -1 0 1 2 3 4 5 8
IV
V
II III
Figure 6
The lines I and II intersect in A(9/2, 1/2)
The lines II and III intersect in B(84/13, 15/13)
The lines III and IV intersect in C(4/3, 5)
The lines IV and V intersect in D(4/13, 45/13)
The lines V and I intersect in E(9/14, 25/14).
Let us evaluate P at the points A, B, C, D and E as follows:
P(A) = 2(9/2) + 1/2 = 19/2
P(B) = 2(84/13) + 15/13 = 183/13
P(C) = 2(4/3) + 5 = 23/3
P(D) = 2(4/13) + 45/13 = 53/13
P(E) = 2(9/14) + 25/14 = 43/14
The maximum value of P is 183/13 which occurs at x = 84/13 and y = 15/13.
Example 3: An aeroplane can carry a maximum of 200 passengers. A profit of
` 400 is made on each first class ticket and a profit of ` 300 is made on
each economy class ticket. The airline reserves at least 20 seats for first class.
However, at least 4 times as many passengers prefer to travel by economy
class than by first class. Determine how many of each type of tickets must be
sold in order to maximise the profit for the airline? What is the maximum profit?
86
Solution Linear Programming
Let number of first class tickets sold be x and the number of economy class tickets
sold be y.
As the airline makes a profit of `400 on first calss and `300 on economy class,
the profit of the airlines is 400x + 300y
As the aeroplane can carry maximum of 200 passengers, we must have
x + y ≤ 200. As the airline reserves at least 20 tickets for the first class, x ≥ 20.
Next, as the number of passengers preferring economy class is at least four times
the number of passengers preferring the first class, we must have y ≥ 4x.
Also, x ≥ 0, y ≥ 0.
Therefore the LPP is
Maximixe
P = 400x + 300y [objective function]
subject to x + y ≤ 200, [capacity function]
y ≥ 20 [first class function]
y ≥ 4x [preference constraint]
x ≥ 0, y ≥ 0 [non-negativity]
We plot the feasible region in Figure 7
y
200
C(20,180) B(40,160)
A(20,80)
x
0 20 200
Figure 7 7
Figure
We now calculate the profit at the corner points of the feasible region.
P(A) = P(20,80) = (400)(20) + (300)(80) = 8000 + 24000 = 32000
P(B) = P(20,160) = (400)(40) + (300)(160) = 64000
P(C) = P(20,180) = (400)(20) + (300)(180) = 62000
Hence, profit of the airlines maximum at B i.e., when 40 tickets of first class
and 160 tickets of ecoomy class are sold. Also, maximum profit is ` 64,000.
87
Vectors and Three Example 4: Suriti wants to invest at most ` 12000 in Savings Certificate and
Dimensional Geometry
National Savings Bonds. She has to invest at least ` 2000 in Savings
Certificate and at least ` 4000 in National Savings Bonds. If the rate of interest
in Saving Certificate is 8% per annum and the rate of interest on National
Saving Bond is 10% per annum, how much money should she invest to earn
maximum yearly income ? Find also the maximum yearly income ?
Solution
Suppose Suriti invests ` x in saving certificate and ` y in National Savings
Bonds.
As she has just ` 12000 to invest, we must have x + y ≤ 12000.
Also, as she has to invest at least ` 2000 in savings certificate x ≥ 2000.
Next, as she must invest at least Rs. 4000 in National Savings Certificate
y ≥ 4000. Yearly income from saving certificate = ` = 0.08x and from
National Savings Bonds = ` = Rs. 0.1y
Her total income is ` P where
P = 0.08x + 0.1y
Thus, the linear programming problem is
Maximise
subject to
x + y ≤ 12000 [Total Money Constraint]
x ≥ 2000 [Savings Certificate Constraint]
y ≥ 4000 [National Savings Bonds Constraint]
x ≥ 0, y ≥ 0 [ Non-negativity Constraint]
However, note that the constraints x ≥ 0, y ≥0, are redundant in view of
x ≥ 2000 and y ≥ 4000.
We draw the feasible region in Figure 8
88
Y Linear Programming
12000
C(2000,10000)
x+
y=
12
00
0
Y = 4000
4000 A(2000, 4000) B(8000, 4000)
X = 2000 x
0 2000 12000
Figure 8
We now calculate the profit at the corner points of the feasible region.
We have
P(A) = P(2000,4000) = (0.08) (2000) + (0.1)(4000)
= 160 +400 = 560
P(B) = P(8000,4000) = (0.08) (2000) + (0.1)(4000)
= 640 +400 = 1040
P(C) = P(2000,10000) = (0.08) (2000) + (0.1)(10000)
= 160 +1000 =1160.
Thus, she must invest ` 2000 in Savings certificate and ` 10000 in National
Savings Bonds in order to earn maximum income.
Example 5 If a young man rides his motor cycle at 25 km per hour, he has to
spend ` 2 per km on petrol; if he rides it at a faster speed of 40 km per hour,
the petrol cost increases to ` 5 per km. He wishes to spend at most ` 100 on
petrol and wishes to find what is maximum distance he can travel within one
hour. Express this as a linear programming problem and then solve it.
Solution
Let x km be the distance travlled at the rate of 25 km/h and y km be the
distance travelled at the rate of 40 km/h. Then the total distance covered by the
young man is D = (x + y) km.
The money spent in travelling x km (at the rate of 25 km/h) is 2x and the money
spent in travelling y km (at the rate of 40 km/h) is 5y. Thus, total money spent
during the journey is ` (2x +5y). Since the young man wishes to spend at most
Rs. 100 on the journey, we must have 2x + 5y ≤ 100.
89
Vectors and Three
Dimensional Geometry
Also, note that x ≥ 0, y ≥ 0.
The mathematical formulation of the linear programming problem is
Maximise
D=x+y
subject to
2x + 5y ≤ 100
and x ≥ 0, y ≥ 0.
The feasible region is sketched in Figure 9.
Y
40
30
C(0,20)
20
50 40
B 3
, 3
10
A(25,0) A(25,0) x
0 10 20 30 40 50
Figure 9
Figure 9
The corner points of feasible region are O(0,0), A(25,0),
Let us evaluate D at these points
D(O) = 0 + 0 = 0
D(A) = 25 + 0 = 25
D(C) = 0 + 20 = 20
Thus, the maximum values of D is 30 which occurs at x = 50/3, y = 40/3
90
When do we have Multiple Solutions ? Linear Programming
Whenever the objective function isoprofit (iso-cost) line is parallel to one of the
constraints we have multiple optimal solutions to the linear programming
problem. We illustrate this in the following example.
Example 6 The xyz company manufactures two products A and B. They are
processed on the same machine. A takes 10 mintues per item and B takes 2
minutes per items on the machine. The machine can run for a maximum of 35
hours in a week. Product A requires 1 kg and product B 0.5 kg of the raw
material per item, the supply of which is 600 kg per week. Note more than 800
items of product B are required per week. If the product A costs ` 5 per items
and can be sold for ` 10 and Product B costs ` 6 per items and can be sold for
` 8 per item. Determine how many items per week be produced for A and B
in order to maximize the profit.
Solution
We summarise the information given in the question as follows :
Product A (x) Product B(y) Constraint
Machine 10 (min. per item) 2 (min. per item) ≤ 35 60 = 2100
Material 1 (kg per item) 0.5 (kg per item) ≤ 600
Number for the Proudct B ≤ 800
Profit ` (10 –5) = ` 5 ` (8–6) = ` 2 per Maximise P
per item item
Suppose x items of A and y items of B are be manufactured. The given
problem can be written as follows.
Maximise
P = 5x + 2y
subject to
10x + 2y ≤ 2100 (Machine constraint)
x + 0.5y ≤ 600 (Material constraint)
y ≤ 800 (Restriction on B)
x ≥ 0, y ≥ 0 (Non-negativity)
The feasible region has been shaded in Figure 10.
91
Vectors and Three y
Dimensional Geometry 1200
1000
A(0,800)
800 Y = 800
B(50,800)
600
x+
0 .5
10 x
y
=
+
60
2y
400 0
=6
00
200
C(210,0)
x
0(0,0) 100 200 300 400 500 600
Figure 1010
Figure
We now calculate the value of P at the corner points of the feasible region
P(A) = P(0,800) = 1600
P(B) = P(50,800) = 1850
P(C) = P(210,0) = 1050
P(O) = P(0,0) = 0
Maximum profit is ` 1850 for x = 50 and y = 800
Redundant Constraints
In the above example, the constraitn x + 0.5, y ≤ 600 does not affect the
feasible region. Such a constraints is called as redundant constraint.
Redundant constraints are unnecessary in the formulation and solution of the
problem, because they do not affect the feasible region.
Example 7 The manager of an oil refinery wants to decide on the optimal mix
of two possible blending processes 1 and 2, of which the inputs and outputs per
product runs as follows :
Process Crude A Crude B Gasoline X Gasoline Y
1 5 3 5 8
2 4 5 4 4
92
The maximum amounts available of crudes A and B are 200 untis and 150 Linear Programming
units, respectively. At least 100 units of gasoline X and 80 untis of Y are
required. The profit per production run from processes 1 and 2 ` 300 and Rs.
400 respectively. Formulate the above as linear programming and solve it by
graphical method.
Solution
Let process 1 be run x times and process 2 be y times. The mathematical
formulation of the above linear programming problem is given by
Maximise
P = 300 x + 400 y
subject to
5x + 4y ≤ 200 (constraint on Crude A)
3x + 5y ≤ 200 (constraint on Crude B)
5x + 4y ≥ 100 (constraint on gasoline X)
8x + 4y ≥ 80 (constraint on gasoline Y)
x ≥ 0, y ≥ 0 (non-negativity)
The feasible region has been shaded in Figure 11.
We have
P(A) = P(0,30) = 12000
P(C) = P(40,0) = 12,000
P(D) = P(25,0) = 7500
P(E) = P(0,200) = 8000
1 and 11 runs of process 2 will give maximum profit.
93
Vectors and Three Y
Dimensional Geometry
50
40 5x
+
A(0,30) 4y
=
3x 20
30 +5 0
y=
150
E(0,25)
20 5x
8x +4 B
+ y=
10
4y
10 0 C(40,0)
=
x
80
D(20,0)
0 10 20 25 30 40 50 60
Figure 11
Remark : The constraint 8x + 4y ≥ 80 does not affect the feasible region, that
is, the constraint 8x + 4y ≥ 80 is a redundant constraint.
No Feasible Solution
In case the solution space or the feasible region is empty, that is, there is no
point which satisfies all the constraints, we say that the linear programming
problem has no feasible solution.
Illustration : We illustrate this in the following linear programming problem.
Maximise
P = 2x + 5y
subject to 5
x + 2y ≤ 10
x ≥ 12
and x≥ 0, y ≥ 0
we draw the feasible region in Fig 12.
10 12
Figure 12
The direction of arrows indicate that the feasible region is empty. Hence, the
given linear programming problem has no feasible solution.
Unbounded solution
Sometimes the feasible region is unbounded. In such cases, the optimal
solution may not exist, because the value of the objective function goes on
increasing in the unbounded region.
94
Illustration Let us look at the following illustration. Linear Programming
Maximise
P = 7x + 5y
subject to
2x + 5y ≥ 10
x≥4
y≥3
x ≥ 0, y≥ 0
has no bounded solution.
We draw the feasible region in Fig. 13
3
2
0 4 5
Figure 13
The constraint 2x + 5y ≥ 10 is a redundant constraint.
The feasible region is unbounded. Note that the linear programming problem
has no bounded solution.
Chcek Your Progress – 1
1. Best Gift Packs company manufactures two types of gift packs, type A and
type B. Type A requires 5 minutes each for cutting and 10 minutes
assembling it. Type B requires 8 minutes each for cutting and 8 minutes
each for assembling. There are at most 200 minutes available for cutting
and at most 4 hours available for assembling. The profit is ` 50 each for
type A and ` 25 each for type B. How many gift packs of each type should
the company manufacture in order to maximise the profit ?
2. A manufacturer makes two types of furniture, chairs and tables. Both the
products are processed on three machines A 1, A2 and A3. Machine A1
requires 3 hrs for a chair and 3 hrs for a table, machine A 2 requires 5 hrs
for a chair and 2 hrs for a table and machine A 3 requires 2 hrs a chair
and 6 hrs for a table. Maximum time available on machine A 1, A2, A3 is
36 hrs, 50 hrs and 60 hrs respectively. Profits are ` 20 per chair and
` 30 per table. Formulate the above as a linear programming problem to
maximise the profit and solve it.
95
Vectors and Three 3. A manufacturer wishes to produce two types of steel trunks. He has two
Dimensional Geometry
machines A and B. For completing, the first type of trunk, he requires 3
hrs on machine A and 2 hrs on machine B whereas the second type of trunk
requires 3 hrs on machine A and 3 hrs on machine B. Machines A and B can
work at the most for 18 hrs and 14 hrs per day respectively. He earns a
profit of `30 and ` 40 per trunk of first type and second type respectively.
How many trunks of each type must he make each day to make
maximum profit? What is his maximum profit?
4. A new businessman wants to make plastic buckets. There are two types
of available plastic bucket making machines. One type of machine
makes 120 buckets a day, occupies 20 square metres and is
operated by 5 men. The corresponding data for second type of
machine is 80 buckets, 24 square metres and 3 men. The available
resources with the businessman are 200 sq. metres and 40 men. How
many machines of each type the manufacturer should buy, so as to
maximise the number of buckets?
5. A producer has 20 and 10 units of labour and capital respectively which
he can use to produce two kinds of goods X and Y. To produce one unit
of goods X, 2 units of capital and 1 unit of labour is required. To
produce one unit of goods Y, 3 units of labour and 1 unit of capital is
required. If X and Y are priced at ` 80 and ` 100 per unit
respectively, how should the producer use his resources to maximize
the total revenue? Solve the problem graphically.
6. A firm has available two kinds of fruit juices – pineapple and
orange juice. These are mixed and the two types of mixtures are
obtained which are sold as soft drinks A and B. One tin of A needs 4
kgs of pineapple juice and 1 kg of orange juice. One tin of B needs 2
kgs of pineapple juice and 3 kgs of orange juice. The firm has
available only 46 kgs of pineapple juice and 24 kgs of orange juice.
Each tin of A and B sold at a profit of ` 4 and ` 2 respectively. How
many tins of A and B should the firm produce to maximise profit?
4.4 COST MINIMISATION
We illustrate the concept by the following example.
Example 7 : A farm is engaged in breeding pigs. The pigs are fed on
various products grown on the farm. In view of the need to ensure, certain
nutrient constituents, it is necessary to buy two products (call them A and B)
in addition. The contents of the various products, per unit, in nutrient
constituents (e.g., vitamins, proteins, etc.) is given in the following table:
Nutrient content in product Minimum amount of
Nutrients A B nutrient
M1 36 6 108
M2 3 12 36
M3 20 10 100
96
The last column of the above table gives the minimum amounts of nutrient Linear Programming
constituients M1, M2, M3 which must given to the pigs. If products A and B cost
` 20 and ` 40 per unit respectively, how much each of these two products
should be bought, so that the total cost is minimised?
Solution
Let x units of A and y units B be purchased. Our goal is to minimise the total
cost
C = 20x + 40y
By using x units of A and y units of B, we shall get 36x + 6y units of
M1 Since we need at least 108 units of M1, we must have
36x + 6y ≥ 108
Similarly for M2 we have 3x + 12y ≥ 36 and for M3 we have 20x + 10y ≥100.
Also, we cannot use negative numbers of x and y. Thus, our problem is
Minimise
C = 20x + 40y
subject to
36x + 6y ≥108
3x + 12y ≥ 36
20x + 10y ≥100
x ≥ 0, y≥ 0
We now draw the constraints on the same graph to obtain the feasible region.
Since x ≥ 0, y ≥ 0, we shall restrict ourself only to the first quadrant. See
Figure 14. We obtain point B by solving 36x + 6y = 108 and 20x + 10y = 100
and point C by solving 3x + 12y = 36 and 20x + 10y = 100. The feasible region
has been shaded.
97
Vectors and Three y
Dimensional Geometry
18 A(0.18)
36 x
+1
6y
10 =
10 8
20
x+
B(2,6)
10
5
y
=
10
0
3
C(4,2)
3x +1
2y =36 D(12,0)
x
0 3 5 12
Figure14
We next draw a family of straight lines
with varying values of C. See Figure 15
y
Equal Cost lines
6
4 C
C = Direction Increasing Cost
24
3 C = 0
20
=
C 16 0
2 = 0
C 12
C = 0
80
1 =
40
0 1 2 3 4 5 6 7 8 9 10 11 12 x
Figure 15
It is clear from here that in order to have least possible cost, we should take
a cost line which intersects the feasible region and is as near to the origin
as possible. Therefore we should consider only the corner points of the
feasible region as possible candidates for least cost.
98
C(A) = C(0, 18) = 720 Linear Programming
C(B) = C(2, 6) = 20× 2 + 40× 6 = 280
C (C )=C (4,2)=20 ×4+ 40×2= 160
C(D) = C(12, 0) = 240
Minimum cost is obtained at C, that is, for x = 4, y= 2. Minimum possible
cost is `160.
Remark: The procedure for finding least cost is the same as that for the
maximization of profit.
Example 8 A diet for a sick person must contain at least 1400
units of vitamins, 50 units of minerals and 1400 of calories. Two foods
A and B are available at a cost of ` 4 and ` 3 per unit, respectively. If one
unit of A contains 200 units of vitamins, one unit of mineral and 40
calories and one unit of food B contains 100 units of vitamins, two units of
minerals and 40 calories. Find what combination of food be used to have
least cost?
Solution
Let x units of food A and y units of food B be used to give the sick person the
least quantities of vitamins, minerals and calories.
The total cost of the food is C = 4x + 3y. We wish to minimise C.
By consuming x units of A and y units of B, the sick person will get
200x + 100 y units of vitamins. Since the least quantity of vitamin required is
1400, we must have 200x + 100y ≥ 1400
A(0,35)
35
25
x+
2y
=5
0
B(20,15)
40
20
x+
14
0x
40
+
10
y
0
=1
y
40
=
14
(E 50,0 )
00
0 7 35 50
Figure16
Similarly, we must have
Minerals : x + 2y ≥50
Calories : 40x + 40y ≥ 1400 99
Vectors and Three Also,since x and y cannot be negative, we must have x ≥0, y ≥0
Dimensional Geometry
Thus, the linear programming problem is
Minimise
C = 4x + 3 y
subject to
200 x + 100 y ≥ 1400
x + 2y ≥ 50
40x + 40 y ≥ 1400
and x ≥ 0, y ≥ 0
We draw the feasible region of the above linear programming problem in fig.
16. Note that constraint 200x + 100 y ≥ 1400 is a redundant constraint. The
other two intersect in (20,15).
The corner points of the feasible regions are A(0, 35), B(20,15) and E(50,0).
We find the value of C at each of these corner points.
C(A) = 4(0) + 3(35) = 105
C(B) = 4(20) + 3(15) = 125
C(E) = 4(50) + 3(0) = 200
Thus, least cost is occurs at x = 0, y =35.
Example 9 Every gram of wheat provides 0.1 g of proteins and 0.25 g of
carbohydrates. The corresponding values for rice are 0.05 g and 0.5 g, respectively.
Wheat costs `2 per kg and rice ` 8. The minimum daily requirements of protein and
carbohydrates for an average child are 50 g and 200 g, respectively. In what quanti-
ties should wheat and rice be mixed in the daily diet to provide the minimum daily
requirements of protein and carbohydrates at minimum cost? (The protein and
carbohydrate values given here are fictitious and may be quite different from the
actual values.)
Solution
Let x kg of wheat and y kg of rice be given to the child to give him at least
the minimum requirements of protein and carbohydrates. Then cost of the
food is (2x + 8y) = C (say).
Since one gram wheat contains 0.1 g of proteins, x kg of wheat will contain
(1000 x) (0.1) = 100 x grams of protein.
Similarly, y kg of rice contain (100 y) (0.05) = 50 y grams of protein. Thus,
x kg of wheat and y kg of rice will contain (100 x + 50 y) gms of protein.
100
As the minimum requirement of protein is 50 g, we must have Linear Programming
100x + 50y ≥ 50.
Similarly, for carbohydrate, we must have
(1000x) (0.25) + (1000y) (0.5) ≥ 200
or 250x + 500y ≥ 200
Also, x and y must be non-negative, that is, x ≥ 0, y ≥ 0.
Thus, the linear programming problem is
Minimise
C= 2x + 8y
subject to
100x + 50y ≥ 50
250x + 500y ≥ 200
and x ≥ 0, y ≥ 0.
We draw the feaible region of its problem in Figure 17
1 A(0,1)
0.4
2 1
B ,
5 5
E(0.8,0)
0 ½ 0.8
Figure17
The corner points of the feasible region are A(0,1), B(2/5,1/5) and E(0.8,0).
Let us evaluate C at the conrer points of the feasible region.
C (A) = 2(0) + 8(1) = 8
2 1 12
C ( B) = 2 =8 = 2.4
5 5 5
C (E) = 2(0.8) + 8(0) = 1.6
Thus, the cost is least when x = 0.8, y = 0. The least cost is Rs. 1.60.
101
Vectors and Three Example 10 An animal feed manufacturer produces a compound
Dimensional Geometry
mixture from two materials A and B. A costs `2 per kilograms and B,
` 4 per kilogram. Material A is supplied in packs of 25 kilograms and
material B in packs of 50 kilograms. A batch of at least 1,00,000
kilograms of the mixture is to be produced with the specification that at
least 40,000 kilograms of material A, should be used in the manufacture,
which ensures the minimum guaranteed content of the ingredient.
How many packs of A and B should be purchased in order to minimise cost?
Solution
Let x packs of A and y packs of B be purchased in order to meet the
requirement. Our goal is to minimise the total cost. The total cost is
C=2 25 + 4 50y = 50x + 200y
The constraints are
25x + 50y ≥ 100000
50x ≥ 40000
Therefore, the linear programming problem is
Minimise
C = 50x + 200y
subject to
25x + 50y ≥ 100000
50x ≥ 40000
x ≥ 0, y ≥ 0
We can rewrite the problem as
Minimise
C = 50x + 200y
subject to
x + 2y ≥ 4000
x ≥ 800
x ≥ 0, y ≥ 0
The feasible region of the above linear programming problem is
given in Figure 17
Let us evaluate C at the corner points of the feasible region.
C(A) = 50 800 + 50 1600
= 40000 + 80000 = 120000
102 C(B) = 50 4000 + 50 0 = 200000
Linear Programming
3000
2000
A (800,1600)
1000
B(4000,0)
B(4000,0)
0 800 1000 2000 3000 4000
Figure 18
Therefore, cost is minimum when x = 800, y = 1600. The minimum possible
cost is Rs. 1,20,000.
Check Your Progress – 2
1. Two tailors, A and B, earn ` 150 and ` 200 per day respectively. A can
stitch 6 shirts and 4 pants while B can stitch 10 shirts and 4 pants per day. How
many days shall each work if it is desired to produce (at least) 60 shirts and 32
pants at a minimum labour cost ? Also calculate the least cost.
2. A dietician mixes together two kinds of food in such a way that the mixture
contains at least 6 units of vitamin A, 7 units of vitamin B, 11 units of vitamin
C and 9 units of vitamin D. The vitamin contents of 1 unit food X and 1 unit
of food Y are given below:
Vitamin A Vitamin B Vitamin C Vitamin D
Food X 1 1 1 2
Food Y 2 1 3 1
One unit of food X costs ` 5, whereas one unit of good Y cost ` 8. Find
the least cost the mixture which will produce the dersired diet. Is
there any redundant constraint ?
3. A diet for a sick person must contain at least 4000 units of vitamins, 50 units of
minerals and 1400 of calories. Two foods, A and B, are available at a cost
of ` 4 and ` 3 per unit respectively. If one unit of A contains 200 units
of vitamin, 1 unit of mineral and 40 calories and one unit of food B contains
100 units of vitamin, 2 units of minerals and 40 calories, find what
combination of foods should be used to have the least cost ? Also calculate
the least cost.
103
Vectors and Three 4. A tailor needs at least 40 large buttons and 60 small buttons. In the market,
Dimensional Geometry
buttons are available in boxes or cards. A box contains 6 large and two small
buttons and a card contains 2 large and 4 small buttons. If the cost of a box is
30 paise and card is 20 paise. Find how many boxes and cards should he buy
as to minimise the expenditure ?
4.5 ANSWERS TO CHECK YOUR PROGRESS
Y
30
1. Type A : x, Type B : y then LPP is
Maximize
P = 50x + 25y 25 C
B(8,20)
subject to
20
5x + 8y ≤ 200 [Cutting constraint]
10x + 8y ≤ 240 [Assembly constraint] 10
x≥0,y≥0 [Non- negativity] 10 20 A 30 40 x
P(A) = 1200 0
P (B) = 900 Figure 19
P (C) = 625
P(0) = 0
Thus, profit is maximum when x = 24, y = 0
Maximum profit = Rs. 1200
2. Chairs : x, Tables : y, then LPP is
Maximize
P = 20x + 30y
subject to
3x + 3y ≤ 36 [Machine A 1 constraint]
5x + 2y ≤ 50 [Machine A 2 constraint]
2x + 6y ≤ 60 [Machine A 3 constraint]
x ≥ 0, y ≤ 0 [Non-negativity]
104
Y Linear Programming
30
20 5x + 2y = 50
D C
10
3x + 3y = 36
2x + 6y = 60
B
0 10 20 30 x
A
Figure 20
P (A) = 20 (10) + 30(0) = 200
26 10 820
P (B) = 20 + 30 =
3 3 3
P (C) = 20 (3) + 30(9) = 330
P (D) = 20 (10) + 30(0) = 200
P(0) = 20(0) + 30(0) = 0
Thus, profit is maximum
when x = 3, y = 9.
Maximum Profit = Rs. 330
3. First type trunks : x Second type trunks : y
The LPP is
Maximise P = 30 x + 40 y,
subject to
3x + 3y ≤ 18 [Machine A constraint]
2x + 3y ≤ 14 [Machine B constraint]
x ≥ 0, y ≥0 [non-negativity]
P(A) = 180
P(B) =200
P (C) = 560/3
P(O) = 0
105
Vectors and Three 4
Dimensional Geometry
14/3
C
B(4,2)
0 3 6 A x
3 6
Figure 21
Thus, profit is maximum when x = 4, y = 2 and maximum profit is Rs. 200.
4. We write the information in the question in tabular form as follows :
First type of First type of Constraint
machine (x) machine (x)
Area 20 (sq. m per 24 (sq. m per ≤ 200
machine) machine)
Labour 5 (per machine) 3 (per machine) ≤ 40
Buckets 120 (per 80 (per Maximise N
machine) machine)
x and y machines of the second type be
Let x machines of the first type
purchased.
We have to
Maxmise
N = 120 x + 80y
subject to
20 x + 24 y ≤ 200 (Area constraint)
5x + 3y ≤ 40 (Labour constraint)
x ≥ 0, y ≥ 0 ( Non-negativity)
106
Y
Linear Programming
13
25/3 A(0,25/3)
5x
+
8
3y
=4
0
6
B(6,10/3)
4
20
x+
2 24
y=
200
x
0 2 4 6 8 10 x
C(8,0)
Figure 22
The feasible region for the above linear programming problem has been
shaded in the figure.
We find the value of N at the cornor points of the feasible region. We have
25 2,000 2
N (A) = N 0, = = 666
3 3 3
10 2960 2
N (B) = N 6, = = 986
3 3 3
N (C) = N(8,0) = 960
N (O) = N(0,0) = 0
Thus, the value of N is maximum when x = 6, y = 10/3. As y cannot be in
fraction, we take x = 6, y = 3.
5. We summarise the information given in the question in tabular form as
follows:
Good X Good Y Constraint
Capital 2 1 10
Labour 1 3 20
Revenue 80 100 Maximize R
Let x units of X and y units of Y be produced. The above problem can be
written as
Maxmize
R = 80 x + 100y
subject to
2x + y ≤ 10 (Capital constraint)
x + 3y ≤ 20 (Labour constraint)
x ≥ 0, y ≥ 0 ( Non-negativity)
We shade the feasible region in following figure.
107
Vectors and Three
Y
Dimensional Geometry
A(0,20/3)
10
B(2,6)
xx
0 C(5,0) 20
Figure 23
We now check the revenue at corner points of the feasible region.
2
R (A) = 80(0) + 100(20/3)= 2000/3 = 666
3
R(B) = 80(2) + 100(6) = 760
R(C) = 80(5) + 100(0) = 400
R(0) = 80(0) + 100(0) = 0
This shows that the revenue is maximum when x = 2 and y = 6
i.e. when 2 units of x and 6 units y are produced and the maximum revenue is
Rs. 760.
6. We summarise the information given in the above question in the
following table.
Drink A Drink B Constraint
Pineapple juice 4(kg per tin) 2(kg per tin) ≤ 46
Orange juice 1(kg per tin) 3(kg per tin) ≤ 24
Profit 4 2 Maximize P
Let x tins of drink A and y tins of drink B be filled up. The above problem
can be written as
Maximise
P = 4x + 2y
Subject to
4x + 2y ≤ 46 (pineabpple juice constraint)
x + 3y ≤ 24 (organge juice constraint)
x ≥ 0, y ≥ 0 (non-negativity)
108 The feasible region has been shaded. See the following figure.
Y Linear Programming
23
4x
+
12
2y
=
46
8 A(0,8)
B(9,5)
x+
4 3y =
24
C (23/2,0)
x
0 4 8 12 16 20 24 x
Figure 24
We have
P(A) = 4 (0) + 2(8) = 16
P(B) = 4(9) + 2(5) = 46
23
P(C ) 4 + 2(0) = 46
2
P(0) = 0
We have maximum profit at B and C. In this case, we say that we have
multiple solutions. In fact, each point on the segment BC gives a profit of
` 46. This is because the segment BC is one of the isoprofit lines.
Check Your Progress 2
1. Suppose tailor A works for x days and tailor B work for y days.
The LPP is
Minimise
C = 150x + 200y
subject to
6x + 10y ≥ 60 [Shirts constraints ]
4x + 4 y ≥ 32 [ Pants constraint]
x ≥ 0, y ≥ 0 [ Non–negativity]
109
Vectors and Three y
Dimensional Geometry
8 R
Q(5,3)
P
x
0 4 8 10
12
Figure 25
C (P) = 1500
C (Q) = 1350
C( R) = 1600
Thus, cost is least when x =5 and y = 3
2. Food X : x units and Food Y : y units LPP is
8 S
(1,6)
R
4
3 (5,2)
Q
P
0 4 6 8 11 12 x
Figure 26
Minimise
C = 5x + 8y
subject to
x+2y≥6
x+y≥7
x + 3 y ≥ 11
2 x+ y ≥ 8
x ≥ 0, y ≥ 0
110
Now, C(P) = 55, C (Q) = 41 Linear Programming
C(R) = 30, C(S) = 64
Thus, C is least when x = 5, y = 2
least Cost is Rs. 41
The constraint x + 2y ≥ 6 is a redundant constraint.
3. Let x units of food A and y units of food B be used. The LPP is
Minimise
C = 4x + 3y
subject to
200x + 100y ≥ 400 (vitamins constraints)
x + 2 y ≥ 50 (minerals constraints)
40x + 40y ≥ 1400 (calories constraints)
x ≥ 0, y ≥ 0 (non-negativity)
We have
C(P) = 200, C (Q) = 125, C (R) = 110,
C(S) = 120
Thus, C is least when x = 5, y = 30.
40
S(0,40)
30
R(5,30)
35
20
Q(20,15)
10
P(50,0)
x
0 10 20 30 35 40 50
Figure 27
111
Vectors and Three 4. Let x boxes and y cards be purchased.
Dimensional Geometry
Cost of x boxes is 30x paise and cost of y cards is 20y paise.
Cost incurred by the tailor (in paise ) is 30x + 20y
Number of large buttons obtained from x boses and y cards is 2x + 4y.
According to given condition.
6x + 2y ≥ 40
Number of small buttons obtained from x boxes and y cards is 2x + 4y.
According to the given condition
2x + 4y ≥60
Also, x ≥ 0, y ≥ 0
Thus, the linear programming problem is
Minimize
C = 30 x + 20y [objective function]
subject to
6x + 2y ≥40 [large button constraint]
2 x + 4y ≥ 60 [small button constraint]
x ≥0, y ≥0 [ non-negativity]
We draw the feasible in the following figure.
We now calculate the cost at the corner points of the feasible region.
C(A) = C(0,20) = 30(0) + (20)(20) = 400
C(B) = C(5/2, 55/2) = (30) (5/2) = (20) (55/2) = 75 + 550 = 525
C(D) = C (30,0) = (30)(30) + (20)(0) = 900
A (0,20)
15
B(5/2,55/2)
2x + 4y ≥ 60
³
6x + 2y ≥40
Xx
0 20/3 D(30,0)
Figure 28
Thus, the least cost occurs when the tailor purchases just 20 cards and the least
cost is 400.
112
Linear Programming
4.7 SUMMARY
The unit is about the mathematical discipline of linear programming. In section
4.0, a number of relevant concepts including that of objective function, feasible
region/solution space are introduced. Then the nomenclature ‘linear
programming’ is explained. In section 4.2 the above concepts alongwith some
other relevant concepts are (formally) defined. Section 4.3 explains the two
graphical methods for solving linear programming problems (L.P.P.). viz. (i)
corner point method (ii) iso-profit and iso-cost method. The methods are
explained through a number of examples. Section 4.4 discusses methods of cost
minimisation in context of linear programming problems.
Answers/Solutions to questions/problems/exercises given in various sections of
the unit are available in section 4.5.
113
You might also like
- Linear Algebra .Ageometric Approach W.H.freemanNo ratings yetLinear Algebra .Ageometric Approach W.H.freeman17 pages
- Maths - Vector - Three-Dimensional GeometryNo ratings yetMaths - Vector - Three-Dimensional Geometry152 pages
- DR Aft: Introduction To Conics, GeometricallyNo ratings yetDR Aft: Introduction To Conics, Geometrically8 pages
- People Manipulate Objects But Cultivate Fields BeyNo ratings yetPeople Manipulate Objects But Cultivate Fields Bey14 pages
- Chapter 6 (Vectors and Vectors Geometry)No ratings yetChapter 6 (Vectors and Vectors Geometry)24 pages
- Emphases in Teaching and Learning: 1. Problem Solving in MathematicsNo ratings yetEmphases in Teaching and Learning: 1. Problem Solving in Mathematics6 pages
- Geometry Review by Peaceminusone: CHAPTER 1: Points, Lines, Planes, and AnglesNo ratings yetGeometry Review by Peaceminusone: CHAPTER 1: Points, Lines, Planes, and Angles15 pages
- Area Between Curves, Average Value of A Function - Gary TaylorNo ratings yetArea Between Curves, Average Value of A Function - Gary Taylor4 pages
- Applied Mathematics For Physical ChemistryNo ratings yetApplied Mathematics For Physical Chemistry117 pages
- 1 995 Mathematics Olympiad Lecture Notes - Vectors - Greg Gamble - VectorsNo ratings yet1 995 Mathematics Olympiad Lecture Notes - Vectors - Greg Gamble - Vectors1 page
- Chapter 3 Units of Measurement and ApplicationNo ratings yetChapter 3 Units of Measurement and Application30 pages
- GCSE (9-1) Mathematics (Higher) : 2017 Exam Preparation Worksheet (Non Calculator)No ratings yetGCSE (9-1) Mathematics (Higher) : 2017 Exam Preparation Worksheet (Non Calculator)9 pages
- A Mathematicians Guided Tour Through High DimensionsNo ratings yetA Mathematicians Guided Tour Through High Dimensions10 pages
- Vectors - Definition, Properties and Algebra: Topic B1.1No ratings yetVectors - Definition, Properties and Algebra: Topic B1.124 pages
- Fundamentals of Linear Algebra - Ya. S. Bugrov PDFNo ratings yetFundamentals of Linear Algebra - Ya. S. Bugrov PDF189 pages
- Math 1 Mathematics For General EducationNo ratings yetMath 1 Mathematics For General Education43 pages
- Sequences and Infinite Series: D. DeturckNo ratings yetSequences and Infinite Series: D. Deturck54 pages
- Modeling, Simulation and Scale-Up of A Batch Reactor: René O. Vargas and Francisco López-SerranoNo ratings yetModeling, Simulation and Scale-Up of A Batch Reactor: René O. Vargas and Francisco López-Serrano7 pages
- Nuclei _ Recommended MCQs - (NEW NCERT PATTERN)No ratings yetNuclei _ Recommended MCQs - (NEW NCERT PATTERN)7 pages
- Mulliken Symbols For Irreducible Representations100% (1)Mulliken Symbols For Irreducible Representations2 pages
- Effect of The Thickness of The PT Film Coated On A Counter Electrode On The Performance of A Dye-Sensitized Solar CellNo ratings yetEffect of The Thickness of The PT Film Coated On A Counter Electrode On The Performance of A Dye-Sensitized Solar Cell7 pages
- (Shu Tanaka, Masamitsu Bando, Utkan Gungordu) Physics, Mathematics, and All That Quantum Jazz (PDF) (ZZZZZ) PDF100% (1)(Shu Tanaka, Masamitsu Bando, Utkan Gungordu) Physics, Mathematics, and All That Quantum Jazz (PDF) (ZZZZZ) PDF290 pages
- Complete Download Electron Magnetic Resonance Principles 1st Edition Yuanzhi Xu PDF All Chapters100% (11)Complete Download Electron Magnetic Resonance Principles 1st Edition Yuanzhi Xu PDF All Chapters85 pages
- The Effect of Bed Roughness On Velocity ProfileNo ratings yetThe Effect of Bed Roughness On Velocity Profile7 pages
- AP Physics I - Newton's Laws and Uniform Circular Motion Study Guide (Chapters 4,5, & 6)No ratings yetAP Physics I - Newton's Laws and Uniform Circular Motion Study Guide (Chapters 4,5, & 6)15 pages
- Bmee207l Kinematics-And-dynamics-Of-machines TH 1.0 67 Bmee207lNo ratings yetBmee207l Kinematics-And-dynamics-Of-machines TH 1.0 67 Bmee207l3 pages
- CBSE NCERT Solutions For Class 11 Physics Chapter 2: Back of Chapter QuestionsNo ratings yetCBSE NCERT Solutions For Class 11 Physics Chapter 2: Back of Chapter Questions19 pages
- People Manipulate Objects But Cultivate Fields BeyPeople Manipulate Objects But Cultivate Fields Bey
- Emphases in Teaching and Learning: 1. Problem Solving in MathematicsEmphases in Teaching and Learning: 1. Problem Solving in Mathematics
- Geometry Review by Peaceminusone: CHAPTER 1: Points, Lines, Planes, and AnglesGeometry Review by Peaceminusone: CHAPTER 1: Points, Lines, Planes, and Angles
- Area Between Curves, Average Value of A Function - Gary TaylorArea Between Curves, Average Value of A Function - Gary Taylor
- 1 995 Mathematics Olympiad Lecture Notes - Vectors - Greg Gamble - Vectors1 995 Mathematics Olympiad Lecture Notes - Vectors - Greg Gamble - Vectors
- GCSE (9-1) Mathematics (Higher) : 2017 Exam Preparation Worksheet (Non Calculator)GCSE (9-1) Mathematics (Higher) : 2017 Exam Preparation Worksheet (Non Calculator)
- A Mathematicians Guided Tour Through High DimensionsA Mathematicians Guided Tour Through High Dimensions
- Vectors - Definition, Properties and Algebra: Topic B1.1Vectors - Definition, Properties and Algebra: Topic B1.1
- Fundamentals of Linear Algebra - Ya. S. Bugrov PDFFundamentals of Linear Algebra - Ya. S. Bugrov PDF
- Modeling, Simulation and Scale-Up of A Batch Reactor: René O. Vargas and Francisco López-SerranoModeling, Simulation and Scale-Up of A Batch Reactor: René O. Vargas and Francisco López-Serrano
- Effect of The Thickness of The PT Film Coated On A Counter Electrode On The Performance of A Dye-Sensitized Solar CellEffect of The Thickness of The PT Film Coated On A Counter Electrode On The Performance of A Dye-Sensitized Solar Cell
- (Shu Tanaka, Masamitsu Bando, Utkan Gungordu) Physics, Mathematics, and All That Quantum Jazz (PDF) (ZZZZZ) PDF(Shu Tanaka, Masamitsu Bando, Utkan Gungordu) Physics, Mathematics, and All That Quantum Jazz (PDF) (ZZZZZ) PDF
- Complete Download Electron Magnetic Resonance Principles 1st Edition Yuanzhi Xu PDF All ChaptersComplete Download Electron Magnetic Resonance Principles 1st Edition Yuanzhi Xu PDF All Chapters
- AP Physics I - Newton's Laws and Uniform Circular Motion Study Guide (Chapters 4,5, & 6)AP Physics I - Newton's Laws and Uniform Circular Motion Study Guide (Chapters 4,5, & 6)
- Bmee207l Kinematics-And-dynamics-Of-machines TH 1.0 67 Bmee207lBmee207l Kinematics-And-dynamics-Of-machines TH 1.0 67 Bmee207l
- CBSE NCERT Solutions For Class 11 Physics Chapter 2: Back of Chapter QuestionsCBSE NCERT Solutions For Class 11 Physics Chapter 2: Back of Chapter Questions