Advertisements
Advertisements
State whether the following is True or False :
The region represented by the inqualities x ≤ 0, y ≤ 0 lies in first quadrant.
Options
True
False
Advertisements
Solution
The region represented by the inqualities x ≤ 0, y ≤ 0 lies in first quadrant False.
APPEARS IN
RELATED QUESTIONS
The postmaster of a local post office wishes to hire extra helpers during the Deepawali season, because of a large increase in the volume of mail handling and delivery. Because of the limited office space and the budgetary conditions, the number of temporary helpers must not exceed 10. According to past experience, a man can handle 300 letters and 80 packages per day, on the average, and a woman can handle 400 letters and 50 packets per day. The postmaster believes that the daily volume of extra mail and packages will be no less than 3400 and 680 respectively. A man receives Rs 225 a day and a woman receives Rs 200 a day. How many men and women helpers should be hired to keep the pay-roll at a minimum ? Formulate an LPP and solve it graphically.
A company produces two types of goods A and B, that require gold and silver. Each unit of type A requires 3 g of silver and 1 g of golds while that of type B requires 1 g of silver and 2 g of gold. The company can procure a maximum of 9 g of silver and 8 g of gold. If each unit of type A brings a profit of Rs 40 and that of type B Rs 50, formulate LPP to maximize profit.
A small manufacturing firm produces two types of gadgets A and B, which are first processed in the foundry, then sent to the machine shop for finishing. The number of man-hours of labour required in each shop for the production of each unit of A and B, and the number of man-hours the firm has available per week are as follows:
Gadget | Foundry | Machine-shop |
A | 10 | 5 |
B | 6 | 4 |
Firm's capacity per week | 1000 | 600 |
The profit on the sale of A is Rs 30 per unit as compared with Rs 20 per unit of B. The problem is to determine the weekly production of gadgets A and B, so that the total profit is maximized. Formulate this problem as a LPP.
A firm manufactures 3 products A, B and C. The profits are Rs 3, Rs 2 and Rs 4 respectively. The firm has 2 machines and below is the required processing time in minutes for each machine on each product :
Machine | Products | ||
A | B | C | |
M_{1} M_{2} |
4 | 3 | 5 |
2 | 2 | 4 |
Machines M_{1} and M_{2}_{ }have 2000 and 2500 machine minutes respectively. The firm must manufacture 100 A's, 200 B's and 50 C's but not more than 150 A's. Set up a LPP to maximize the profit.
Amit's mathematics teacher has given him three very long lists of problems with the instruction to submit not more than 100 of them (correctly solved) for credit. The problem in the first set are worth 5 points each, those in the second set are worth 4 points each, and those in the third set are worth 6 points each. Amit knows from experience that he requires on the average 3 minutes to solve a 5 point problem, 2 minutes to solve a 4 point problem, and 4 minutes to solve a 6 point problem. Because he has other subjects to worry about, he can not afford to devote more than
A farmer has a 100 acre farm. He can sell the tomatoes, lettuce, or radishes he can raise. The price he can obtain is Rs 1 per kilogram for tomatoes, Rs 0.75 a head for lettuce and Rs 2 per kilogram for radishes. The average yield per acre is 2000 kgs for radishes, 3000 heads of lettuce and 1000 kilograms of radishes. Fertilizer is available at Rs 0.50 per kg and the amount required per acre is 100 kgs each for tomatoes and lettuce and 50 kilograms for radishes. Labour required for sowing, cultivating and harvesting per acre is 5 man-days for tomatoes and radishes and 6 man-days for lettuce. A total of 400 man-days of labour are available at Rs 20 per man-day. Formulate this problem as a LPP to maximize the farmer's total profit.
The corner points of the feasible region determined by the following system of linear inequalities:
2x + y ≤ 10, x + 3y ≤ 15, x, y ≥ 0 are (0, 0), (5, 0), (3, 4) and (0, 5). Let Z = px + qy, where p, q > 0. Condition on p and q so that the maximum of Z occurs at both (3, 4) and (0, 5) is
A firm manufactures two products, each of which must be processed through two departments, 1 and 2. The hourly requirements per unit for each product in each department, the weekly capacities in each department, selling price per unit, labour cost per unit, and raw material cost per unit are summarized as follows:
Product A | Product B | Weekly capacity | |
Department 1 | 3 | 2 | 130 |
Department 2 | 4 | 6 | 260 |
Selling price per unit | ₹ 25 | ₹ 30 | |
Labour cost per unit | ₹ 16 | ₹ 20 | |
Raw material cost per unit | ₹ 4 | ₹ 4 |
The problem is to determine the number of units to produce each product so as to maximize total contribution to profit. Formulate this as a LPP.
Solve the following L.P.P. by graphical method :
Maximize : Z = 10x + 25y subject to 0 ≤ x ≤ 3, 0 ≤ y ≤ 3, x + y ≤ 5 also find maximum value of z.
Solve the following L.P.P. by graphical method :
Maximize: Z = 3x + 5y subject to x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0 also find maximum value of Z.
Solve the following L.P.P. by graphical method :
Minimize : Z = 7x + y subject to 5x + y ≥ 5, x + y ≥ 3, x ≥ 0, y ≥ 0.
Fill in the blank :
Graphical solution set of the in equations x ≥ 0, y ≥ 0 is in _______ quadrant
Solve the following problem :
Maximize Z = 5x_{1} + 6x_{2} Subject to 2x_{1} + 3x_{2} ≤ 18, 2x_{1} + x_{2} ≤ 12, x ≥ 0, x_{2} ≥ 0
Solve the following problem :
Minimize Z = 4x + 2y Subject to 3x + y ≥ 27, x + y ≥ 21, x ≥ 0, y ≥ 0
Solve the following problem :
Maximize Z = 4x_{1} + 3x_{2} Subject to 3x_{1} + x_{2} ≤ 15, 3x_{1} + 4x_{2} ≤ 24, x_{1} ≥ 0, x_{2} ≥ 0
Solve the following problem :
A company manufactures bicyles and tricycles, each of which must be processed through two machines A and B Maximum availability of machine A and B is respectively 120 and 180 hours. 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 ₹ 180 for a bicycle and ₹ 220 on a tricycle, determine the number of bicycles and tricycles that should be manufacturing in order to maximize the profit.
Choose the correct alternative:
If LPP has optimal solution at two point, then
Choose the correct alternative:
The point at which the minimum value of Z = 8x + 12y subject to the constraints 2x + y ≥ 8, x + 2y ≥ 10, x ≥ 0, y ≥ 0 is obtained at the point
Choose the correct alternative:
The corner points of feasible region for the inequations, x + y ≤ 5, x + 2y ≤ 6, x ≥ 0, y ≥ 0 are
Choose the correct alternative:
The corner points of the feasible region are (4, 2), (5, 0), (4, 1) and (6, 0), then the point of minimum Z = 3.5x + 2y = 16 is at
State whether the following statement is True or False:
A convex set includes the points but not the segment joining the points
State whether the following statement is True or False:
If the corner points of the feasible region are `(0, 7/3)`, (2, 1), (3, 0) and (0, 0), then the maximum value of Z = 4x + 5y is 12
State whether the following statement is True or False:
Corner point method is most suitable method for solving the LPP graphically
State whether the following statement is True or False:
Of all the points of feasible region, the optimal value is obtained at the boundary of the feasible region
State whether the following statement is True or False:
The graphical solution set of the inequations 0 ≤ y, x ≥ 0 lies in second quadrant
A set of values of variables satisfying all the constraints of LPP is known as ______
The feasible region represented by the inequations x ≥ 0, y ≤ 0 lies in ______ quadrant.
A company manufactures two types of ladies dresses C and D. The raw material and labour available per day is given in the table.
Resources | Dress C(x) | Dress D(y) | Max. availability |
Raw material | 5 | 4 | 60 |
Labour | 5 | 3 | 50 |
P is the profit, if P = 50x + 100y, solve this LPP to find x and y to get the maximum profit
A wholesale dealer deals in two kinds of mixtures A and B of nuts. Each kg of mixture A contains 60 grams of almonds, 30 grams of cashew and 30 grams of hazel nuts. Each kg of mixture B contains 30 grams of almonds, 60 grams of cashew and 180 grams of hazel nuts. A dealer is contemplating to use mixtures A and B to make a bag which will contain at least 240 grams of almonds, 300 grams of cashew and 540 grams of hazel nuts. Mixture A costs ₹ 8 and B costs ₹ 12 per kg. How many kgs of each mixture should he use to minimize the cost of the kgs
Maximize Z = 2x + 3y subject to constraints
x + 4y ≤ 8, 3x + 2y ≤ 14, x ≥ 0, y ≥ 0.
Maximize Z = 400x + 500y subject to constraints
x + 2y ≤ 80, 2x + y ≤ 90, x ≥ 0, y ≥ 0
Minimize Z = 24x + 40y subject to constraints
6x + 8y ≥ 96, 7x + 12y ≥ 168, x ≥ 0, y ≥ 0
Minimize Z = x + 4y subject to constraints
x + 3y ≥ 3, 2x + y ≥ 2, x ≥ 0, y ≥ 0
Minimize Z = 2x + 3y subject to constraints
x + y ≥ 6, 2x + y ≥ 7, x + 4y ≥ 8, x ≥ 0, y ≥ 0
Solve the LPP graphically:
Minimize Z = 4x + 5y
Subject to the constraints 5x + y ≥ 10, x + y ≥ 6, x + 4y ≥ 12, x, y ≥ 0
Solution: Convert the constraints into equations and find the intercept made by each one of it.
Inequations | Equations | X intercept | Y intercept | Region |
5x + y ≥ 10 | 5x + y = 10 | ( ___, 0) | (0, 10) | Away from origin |
x + y ≥ 6 | x + y = 6 | (6, 0) | (0, ___ ) | Away from origin |
x + 4y ≥ 12 | x + 4y = 12 | (12, 0) | (0, 3) | Away from origin |
x, y ≥ 0 | x = 0, y = 0 | x = 0 | y = 0 | 1^{st} quadrant |
∵ Origin has not satisfied the inequations.
∴ Solution of the inequations is away from origin.
The feasible region is unbounded area which is satisfied by all constraints.
In the figure, ABCD represents
The set of the feasible solution where
A(12, 0), B( ___, ___ ), C ( ___, ___ ) and D(0, 10).
The coordinates of B are obtained by solving equations
x + 4y = 12 and x + y = 6
The coordinates of C are obtained by solving equations
5x + y = 10 and x + y = 6
Hence the optimum solution lies at the extreme points.
The optimal solution is in the following table:
Point | Coordinates | Z = 4x + 5y | Values | Remark |
A | (12, 0) | 4(12) + 5(0) | 48 | |
B | ( ___, ___ ) | 4( ___) + 5(___ ) | ______ | ______ |
C | ( ___, ___ ) | 4( ___) + 5(___ ) | ______ | |
D | (0, 10) | 4(0) + 5(10) | 50 |
∴ Z is minimum at ___ ( ___, ___ ) with the value ___
A linear function z = ax + by, where a and b are constants, which has to be maximised or minimised according to a set of given condition is called a:-
Maximised value of z in z = 3x + 4y, subject to constraints : x + y ≤ 4, x ≥ 0. y ≥ 0
If z = 200x + 500y .....(i)
Subject to the constraints:
x + 2y ≥ 10 .......(ii)
3x + 4y ≤ 24 ......(iii)
x, 0, y ≥ 0 ......(iv)
At which point minimum value of Z is attained.