English

State whether the following statement is True or False: The graphical solution set of the inequations 0 ≤ y, x ≥ 0 lies in second quadrant - Mathematics and Statistics

Advertisements
Advertisements

Question

State whether the following statement is True or False:

The graphical solution set of the inequations 0 ≤ y, x ≥ 0 lies in second quadrant

Options

  • True

  • False

MCQ
True or False
Advertisements

Solution

False

shaalaa.com
  Is there an error in this question or solution?
Chapter 2.6: Linear Programming - Q.2 (B)

APPEARS IN

RELATED QUESTIONS

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 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.

 


 


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

\[3\frac{1}{2}\] hours altogether to his mathematics assignment. Moreover, the first two sets of problems involve numerical calculations and he knows that he cannot stand more than 
\[2\frac{1}{2}\]  hours work on this type of problem. Under these circumstances, how many problems in each of these categories shall he do in order to get maximum possible credit for his efforts? Formulate this as a LPP.

 


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.


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 LPP by graphical method:

Maximize z = 11x + 8y, subject to x ≤ 4, y ≤ 6, x + y ≤ 6, x ≥ 0, y ≥ 0


Solve the following L.P.P. by graphical method :

Maximize : Z = 7x + 11y subject to 3x + 5y ≤ 26, 5x + 3y ≤ 30, x ≥ 0, y ≥ 0.


Choose the correct alternative :

The point at which the maximum value of z = x + y subject to the constraints x + 2y ≤ 70, 2x + y ≤ 95, x ≥ 0, y ≥ 0 is


Fill in the blank :

Graphical solution set of the in equations x ≥ 0, y ≥ 0 is in _______ quadrant


Fill in the blank :

The region represented by the in equations x ≤ 0, y ≤ 0 lines in _______ quadrants.


The region represented by the inequality y ≤ 0 lies in _______ quadrants.


Graphical solution set of x ≤ 0, y ≥ 0 in xy system lies in second quadrant.


Solve the following problem :

Minimize Z = 2x + 3y Subject to x – y ≤ 1, x + y ≥ 3, x ≥ 0, y ≥ 0


Choose the correct alternative:

If LPP has optimal solution at two point, then


Choose the correct alternative:

The maximum value of Z = 3x + 5y subjected to the constraints x + y ≤ 2, 4x + 3y ≤ 12, x ≥ 0, y ≥ 0 is


Choose the correct alternative:

The point at which the maximum value of Z = 4x + 6y subject to the constraints 3x + 2y ≤ 12, x + y ≥ 4, x ≥ 0, y ≥ 0 is obtained at the point


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 point (6, 4) does not belong to the feasible region bounded by 8x + 5y ≤ 60, 4x + 5y ≤ 40, 0 ≤ x, y


Smita is a diet conscious house wife, wishes to ensure certain minimum intake of vitamins A, B and C for the family. The minimum daily needs of vitamins A, B, and C for the family are 30, 20, and 16 units respectively. For the supply of the minimum vitamin requirements Smita relies on 2 types of foods F1 and F2. F1 provides 7, 5 and 2 units of A, B, C vitamins per 10 grams and F2 provides 2, 4 and 8 units of A, B and C vitamins per 10 grams. F1 costs ₹ 3 and F2 costs ₹ 2 per 10 grams. How many grams of each F1 and F2 should buy every day to keep her food bill minimum


A chemist has a compound to be made using 3 basic elements X, Y, Z so that it has at least 10 litres of X, 12 litres of Y and 20 litres of Z. He makes this compound by mixing two compounds (I) and (II). Each unit compound (I) had 4 litres of X, 3 litres of Y. Each unit compound (II) had 1 litre of X, 2 litres of Y and 4 litres of Z. The unit costs of compounds (I) and (II) are ₹ 400 and ₹ 600 respectively. Find the number of units of each compound to be produced so as to minimize the cost


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


Solve the following LPP graphically:

Maximize Z = 9x + 13y subject to constraints

2x + 3y ≤ 18, 2x + y ≤ 10, x ≥ 0, y ≥ 0

Solution: Convert the constraints into equations and find the intercept made by each one of it.

Inequation Equation X intercept Y intercept Region
2x + 3y ≤ 18 2x + 3y = 18 (9, 0) (0, ___) Towards origin
2x + y ≤ 10 2x + y = 10 ( ___, 0) (0, 10) Towards origin
x ≥ 0, y ≥ 0 x = 0, y = 0 X axis Y axis ______

The feasible region is OAPC, where O(0, 0), A(0, 6),

P( ___, ___ ), C(5, 0)

The optimal solution is in the following table:

Point Coordinates Z = 9x + 13y Values Remark
O (0, 0) 9(0) + 13(0) 0  
A (0, 6) 9(0) + 13(6) ______  
P ( ___,___ ) 9( ___ ) + 13( ___ ) ______ ______
C (5, 0) 9(5) + 13(0) ______  

∴ Z is maximum at __( ___, ___ ) with the value ___.


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 1st 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 ___


Shraddho wants to invest at most ₹ 25,000/- in saving certificates and fixed deposits. She wants to invest at least ₹ 10,000/- in saving certificate and at least ₹ 15,000/- in fixed deposits. The rate of interest on saving certificate is 5% and that on fixed deposits is 7% per annum. Formulate the above problem as LPP to determine maximum income yearly.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×