Please select a subject first
Advertisements
Advertisements
Lines `overliner = (hati + hatj - hatk) + λ(2hati - 2hatj + hatk)` and `overliner = (4hati - 3hatj + 2hatk) + μ(hati - 2hatj + 2hatk)` are coplanar. Find the equation of the plane determined by them.
Concept: Coplanarity of Two Lines
Find the length of the perpendicular drawn from the point P(3, 2, 1) to the line `overliner = (7hati + 7hatj + 6hatk) + λ(-2hati + 2hatj + 3hatk)`
Concept: Distance of a Point from a Line
Find the vector equation of a line passing through the point `hati + 2hatj + 3hatk` and perpendicular to the vectors `hati + hatj + hatk` and `2hati - hatj + hatk`.
Concept: Vector and Cartesian Equations of a Line
Find the shortest distance between the lines `barr = (4hati - hatj) + λ(hati + 2hatj - 3hatk)` and `barr = (hati - hatj -2hatk) + μ(hati + 4hatj - 5hatk)`
Concept: Distance Between Skew Lines and Parallel Lines
The perpendicular distance of the plane `bar r. (3 hat i + 4 hat j + 12 hat k) = 78` from the origin is ______.
Concept: Equation of a Plane
Minimize `z=4x+5y ` subject to `2x+y>=7, 2x+3y<=15, x<=3,x>=0, y>=0` solve using graphical method.
Concept: Graphical Method of Solving Linear Programming Problems
Minimize: Z = 6x + 4y
Subject to the conditions:
3x + 2y ≥ 12,
x + y ≥ 5,
0 ≤ x ≤ 4,
0 ≤ y ≤ 4
Concept: Graphical Method of Solving Linear Programming Problems
Solve the following L.P.P graphically:
Maximize: Z = 10x + 25y
Subject to: x ≤ 3, y ≤ 3, x + y ≤ 5, x ≥ 0, y ≥ 0
Concept: Graphical Method of Solving Linear Programming Problems
Minimize :Z=6x+4y
Subject to : 3x+2y ≥12
x+y ≥5
0 ≤x ≤4
0 ≤ y ≤ 4
Concept: Graphical Method of Solving Linear Programming Problems
Minimum and maximum z = 5x + 2y subject to the following constraints:
x-2y ≤ 2
3x+2y ≤ 12
-3x+2y ≤ 3
x ≥ 0,y ≥ 0
Concept: Graphical Method of Solving Linear Programming Problems
A company manufactures bicycles and tricycles each of which must be processed through machines A and B. Machine A has maximum of 120 hours available and machine B has maximum of 180 hours available. Manufacturing a bicycle requires 6 hours on machine A and 3 hours on machine B. Manufacturing a tricycle requires 4 hours on machine A and 10 hours on machine B.
If profits are Rs. 180 for a bicycle and Rs. 220 for a tricycle, formulate and solve the L.P.P. to determine the number of bicycles and tricycles that should be manufactured in order to maximize the profit.
Concept: Graphical Method of Solving Linear Programming Problems
Solve the following L. P. P. graphically:Linear Programming
Minimize Z = 6x + 2y
Subject to
5x + 9y ≤ 90
x + y ≥ 4
y ≤ 8
x ≥ 0, y ≥ 0
Concept: Graphical Method of Solving Linear Programming Problems
Solve the following LPP by graphical method:
Minimize Z = 7x + y subject to 5x + y ≥ 5, x + y ≥ 3, x ≥ 0, y ≥ 0
Concept: Graphical Method of Solving Linear Programming Problems
Maximize: z = 3x + 5y Subject to
x +4y ≤ 24 3x + y ≤ 21
x + y ≤ 9 x ≥ 0 , y ≥0
Concept: Graphical Method of Solving Linear Programming Problems
Find the feasible solution of the following inequation:
2x + 3y ≤ 6, x + y ≥ 2, x ≥ 0, y ≥ 0
Concept: Linear Programming Problem (L.P.P.)
The company makes concrete bricks made up of cement and sand. The weight of a concrete brick has to be at least 5 kg. Cement costs ₹ 20 per kg and sand costs of ₹ 6 per kg. Strength consideration dictates that a concrete brick should contain minimum 4 kg of cement and not more than 2 kg of sand. Form the L.P.P. for the cost to be minimum.
Concept: Linear Programming Problem (L.P.P.)
The maximum value of z = 5x + 3y subject to the constraints 3x + 5y ≤ 15, 5x + 2y ≤ 10, x, y ≥ 0 is ______.
Concept: Linear Programming Problem (L.P.P.)
Solve each of the following inequations graphically using XY-plane:
4x - 18 ≥ 0
Concept: Linear Programming Problem (L.P.P.)
Solve the following LPP:
Minimize z = 4x + 2y
Subject to 3x + y ≥ 27, x + y ≥ 21, x + 2y ≥ 30, x ≥ 0, y ≥ 0
Concept: Linear Programming Problem (L.P.P.)
A firm manufactures two products A and B on which profit earned per unit are ₹ 3 and ₹ 4 respectively. Each product is processed on two machines M1 and M2. The product A requires one minute of processing time on M1 and two minutes of processing time on M2, B requires one minute of processing time on M1 and one minute of processing time on M2. Machine M1 is available for use for 450 minutes while M2 is available for 600 minutes during any working day. Find the number of units of products A and B to be manufactured to get the maximum profit.
Concept: Linear Programming Problem (L.P.P.)
