हिंदी

The graph of the inequality 3X − 4Y ≤ 12, X ≤ 1, X ≥ 0, Y ≥ 0 lies in fully in

Advertisements
Advertisements

प्रश्न

The graph of the inequality 3X − 4Y ≤ 12, X ≤ 1, X ≥ 0, Y ≥ 0 lies in fully in

विकल्प

  • I quadrant

  • II quadrant

  • III quadrant

  • IV quadrant

MCQ
Advertisements

उत्तर

I quadrant

shaalaa.com
  क्या इस प्रश्न या उत्तर में कोई त्रुटि है?
अध्याय 1.7: Linear Programming Problems - MCQ

वीडियो ट्यूटोरियलVIEW ALL [1]

संबंधित प्रश्न

Solve the following LPP by using graphical method.

Maximize : Z = 6x + 4y

Subject to x ≤ 2, x + y ≤  3, -2x + y ≤  1, x ≥  0, y ≥ 0.

Also find maximum value of Z.


Minimum and maximum z = 5x + 2y subject to the following constraints:

x-2y ≤ 2

3x+2y ≤ 12

-3x+2y ≤ 3

x ≥ 0,y ≥ 0


A manufacturer produces two products A and B. Both the products are processed on two different machines. The available capacity of first machine is 12 hours and that of second machine is 9 hours per day. Each unit of product A requires 3 hours on both machines and each unit of product B requires 2 hours on first machine and 1 hour on second machine. Each unit of product A is sold at Rs 7 profit and  B at a profit of Rs 4. Find the production level per day for maximum profit graphically.


A manufacturing company makes two types of teaching aids A and B of Mathematics for class XII. Each type of A requires 9 labour hours for fabricating and 1 labour hour for finishing. Each type of B requires 12 labour hours for fabricating and 3 labour hours for finishing. For fabricating and finishing, the maximum labour hours available per week are 180 and 30, respectively. The company makes a profit of Rs 80 on each piece of type A and Rs 120 on each piece of type B. How many pieces of type A and type B should be manufactured per week to get maximum profit? Make it as an LPP and solve graphically. What is the maximum profit per week?


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.


Solve the following LPP by graphical method:

Minimize Z = 7x + y subject to 5x + y ≥ 5, x + y ≥ 3, x ≥ 0, y ≥ 0


In order to supplement daily diet, a person wishes to take X and Y tablets. The contents (in milligrams per tablet) of iron, calcium and vitamins in X and Y are given as below :

Tablets  Iron Calcium Vitamin
x 6 3 2
y 2 3 4

The person needs to supplement at least 18 milligrams of iron, 21 milligrams of calcium and 16 milligrams of vitamins. The price of each tablet of X and Y is Rs 2 and Rs 1 respectively. How many tablets of each type should the person take in order to satisfy the above requirement at the minimum cost? Make an LPP and solve graphically.


Maximize Z = 15x + 10y
Subject to 

\[3x + 2y \leq 80\]
\[2x + 3y \leq 70\]
\[ x, y \geq 0\]

 


Maximize Z = 10x + 6y
Subject to

\[3x + y \leq 12\]
\[2x + 5y \leq 34\]
\[ x, y \geq 0\]


Maximize Z = 3x + 4y
Subject to

\[2x + 2y \leq 80\]
\[2x + 4y \leq 120\]


Maximize Z = 7x + 10y
Subject to 

\[x + y \leq 30000\]
\[ y \leq 12000\]
\[ x \geq 6000\]
\[ x \geq y\]
\[ x, y \geq 0\]

 


Minimize Z = 5x + 3y
Subject to 

\[2x + y \geq 10\]
\[x + 3y \geq 15\]
\[ x \leq 10\]
\[ y \leq 8\]
\[ x, y \geq 0\]

 


Maximize Z = 2x + 3y
Subject to

\[x + y \geq 1\]
\[10x + y \geq 5\]
\[x + 10y \geq 1\]
\[ x, y \geq 0\]


Maximize Z = −x1 + 2x2
Subject to

\[- x_1 + 3 x_2 \leq 10\]
\[ x_1 + x_2 \leq 6\]
\[ x_1 - x_2 \leq 2\]
\[ x_1 , x_2 \geq 0\]

 


Maximize Z = x + y
Subject to

\[- 2x + y \leq 1\]
\[ x \leq 2\]
\[ x + y \leq 3\]
\[ x, y \geq 0\]


Maximize Z = 3x1 + 4x2, if possible,
Subject to the constraints 

\[x_1 - x_2 \leq - 1\]

\[ - x_1 + x_2 \leq 0\]

\[ x_1 , x_2 \geq 0\]


Maximize Z = 3x + 3y, if possible,
Subject to the constraints

\[x - y \leq 1\]
\[x + y \geq 3\]
\[ x, y \geq 0\]


A fruit grower can use two types of fertilizer in his garden, brand P and Q. The amounts (in kg) of nirogen, phosphoric acid, potash, and chlorine in a bag of each brand are given in the table. Tests indicates that the garden needs at least 240 kg of phosphoric acid, at least 270 kg of potash and at most 310 kg of chlorine.
 

kg per bag
  Brand P Brand P
Nitrogen 3 3.5
Phosphoric acid 1 2
Potash 3 1.5
Chlorine 1.5 2


If the grower wants to minimize the amount of nitrogen added to the garden, how many bags of each brand should be used? What is the minimum amount of nitrogen added in the garden?


Two tailors, A and B earn Rs 15 and Rs 20 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?


A manufacturer of Furniture makes two products : chairs and tables. processing of these products is done on two machines A and B. A chair requires 2 hrs on machine A and 6 hrs on machine B. A table requires 4 hrs on machine A and 2 hrs on machine B. There are 16 hrs of time per day available on machine A and 30 hrs on machine B. Profit gained by the manufacturer from a chair and a table is Rs 3 and Rs 5 respectively. Find with the help of graph what should be the daily production of each of the two products so as to maximize his profit.


A furniture manufacturing company plans to make two products : chairs and tables. From its available resources which consists of 400 square feet to teak wood and 450 man hours. It is known that to make a chair requires 5 square feet of wood and 10 man-hours and yields a profit of Rs 45, while each table uses 20 square feet of wood and 25 man-hours and yields a profit of Rs 80. How many items of each product should be produced by the company so that the profit is maximum?


A factory uses three different resources for the manufacture of two different products, 20 units of the resources A, 12 units of B and 16 units of C being available. 1 unit of the first product requires 2, 2 and 4 units of the respective resources and 1 unit of the second product requires 4, 2 and 0 units of respective resources. It is known that the first product gives a profit of 2 monetary units per unit and the second 3. Formulate the linear programming problem. How many units of each product should be manufactured for maximizing the profit? Solve it graphically.


A manufacturer of patent medicines is preparing a production plan on medicines, A and B. There are sufficient raw materials available to make 20000 bottles of A and 40000 bottles of B, but there are only 45000 bottles into which either of the medicines can be put. Further, it takes 3 hours to prepare enough material to fill 1000 bottles of A, it takes 1 hour to prepare enough material to fill 1000 bottles of B and there are 66 hours available for this operation. The profit is Rs 8 per bottle for A and Rs 7 per bottle for B. How should the manufacturer schedule his production in order to maximize his profit?


A producer has 30 and 17 units of labour and capital respectively which he can use to produce two type of goods x and y. To produce one unit of x, 2 units of labour and 3 units of capital are required. Similarly, 3 units of labour and 1 unit of capital is required to produce one unit of y. If x and y are priced at Rs 100 and Rs 120 per unit respectively, how should be producer use his resources to maximize the total revenue? Solve the problem graphically.


A box manufacturer makes large and small boxes from a large piece of cardboard. The large boxes require 4 sq. metre per box while the small boxes require 3 sq. metre per box. The manufacturer is required to make at least three large boxes and at least twice as many small boxes as large boxes. If 60 sq. metre of cardboard is in stock, and if the profits on the large and small boxes are Rs 3 and Rs 2 per box, how many of each should be made in order to maximize the total profit?


A small firm manufactures gold rings and chains. The total number of rings and chains manufactured per day is at most 24. It takes 1 hour to make a ring and 30 minutes to make a chain. The maximum number of hours available per day is 16. If the profit on a ring is Rs 300 and that on a chain is Rs 190, find the number of rings and chains that should be manufactured per day, so as to earn the maximum profit. Make it as an LPP and solve it graphically.


A merchant plans to sell two types of personal computers a desktop model and a portable model that will cost Rs 25,000 and Rs 40,000 respectively. He estimates that the total monthly demand of computers will not exceed 250 units. Determine the number of units of each type of computers which the merchant should stock to get maximum profit if he does not want to invest more than Rs 70 lakhs and his profit on the desktop model is Rs 4500 and on the portable model is Rs 5000. Make an LPP and solve it graphically.


A merchant plans to sell two types of personal computers a desktop model and a portable model that will cost Rs 25,000 and Rs 40,000 respectively. He estimates that the total monthly demand of computers will not exceed 250 units. Determine the number of units of each type of computers which the merchant should stock to get maximum profit if he does not want to invest more than Rs 70 lakhs and his profit on the desktop model is Rs 4500 and on the portable model is Rs 5000. 


A manufacturer makes two types of toys A and B. Three machines are needed for this purpose and the time (in minutes) required for each toy on the machines is given below:
 

Types of Toys Machines
  I II III
A 12 18 6
B 6 0 9
 
Each machine is available for a maximum of 6 hours per day. If the profit on each toy of type A is ₹7.50 and that on each toy of type B is ₹5, show that 15 toys of type A and 30 toys of type B should be manufactured in a day to get maximum profit.

A manufacturer produces two products A and B. Both the products are processed on two different machines. The available capacity of first machine is 12 hours and that of second machine is 9 hours per day. Each unit of product A requires 3 hours on both machines and each unit of product B requires 2 hours on first machine and 1 hour on second machine. Each unit of product A is sold at ₹7 profit and that of B at a profit of ₹4. Find the production level per day for maximum profit graphically.


Tow godowns, A and B, have grain storage capacity of 100 quintals and 50 quintals respectively. They supply to 3 ration shops, D, E and F, whose requirements are 60, 50 and 40 quintals respectively. The cost of transportation per quintal from the godowns to the shops are given in the following table:

  Transportation cost per quintal(in Rs.)
From-> A B
To
D 6.00 4.00
E 3.00 2.00
F 2.50 3.00

How should the supplies be transported in order that the transportation cost is minimum?


A medical company has factories at two places, A and B. From these places, supply is made to each of its three agencies situated at P, Q and R. The monthly requirements of the agencies are respectively 40, 40 and 50 packets of the medicines, while the production capacity of the factories, A and B, are 60 and 70 packets respectively. The transportation cost per packet from the factories to the agencies are given below:

Transportation Cost per packet(in Rs.)
From-> A B
To 
P 5 4
Q 4 2
R 3 5
 How many packets from each factory be transported to each agency so that the cost of transportation is minimum? Also find the minimum cost?

A farmer has a supply of chemical fertilizer of type A which contains 10% nitrogen and 6% phosphoric acid and of type B which contains 5% nitrogen and 10% phosphoric acid. After the soil test, it is found that at least 7 kg of nitrogen and the same quantity of phosphoric acid is required for a good crop. The fertilizer of type A costs ₹ 5.00 per kg and the type B costs ₹ 8.00 per kg. Using Linear programming, find how many kilograms of each type of fertilizer should be bought to meet the requirement and for the cost to be minimum. Find the feasible region in the graph.


From the details given below, calculate the five-year moving averages of the number of students who have studied in a school. Also, plot these and original data on the same graph paper.

Year 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002
Number of Students 332 317 357 392 402 405 410 427 405 438

The minimum value of z = 10x + 25y subject to 0 ≤ x ≤ 3, 0 ≤ y ≤ 3, x + y ≥ 5 is ______.


The maximum value of z = 6x + 8y subject to x - y ≥ 0, x + 3y ≤ 12, x ≥ 0, y ≥ 0 is ______.


For the function z = 19x + 9y to be maximum under the constraints 2x + 3y ≤ 134, x + 5y ≤ 200, x ≥ 0, y ≥ 0; the values of x and y are ______.


The region XOY - plane which is represented by the inequalities -5 ≤ x ≤ 5, -5 ≤ y ≤ 5 is ______ 


The constraints of an LPP are 7 ≤ x ≤ 12, 8 ≤ y ≤ 13. Determine the vertices of the feasible region formed by them.


In the Corner point method for solving a linear programming problem the second step after finding the feasible region of the linear programming problem and determining its corner points is ____________.


The comer point 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 x = Px + qx where P, q > 0 condition on P and Q so that the maximum of z occurs at both (3, 4) and (0, 5) is


Any point in the feasible region that gives the optional value (maximum or minimum) of the objective function is called:-


The maximum value of 2x + y subject to 3x + 5y ≤ 26 and 5x + 3y ≤ 30, x ≥ 0, y ≥ 0 is ______.


Solve the following linear programming problem graphically:

Maximize: Z = x + 2y

Subject to constraints:

x + 2y ≥ 100,

2x – y ≤ 0

2x + y ≤ 200,

x ≥ 0, y ≥ 0.


The feasible region corresponding to the linear constraints of a Linear Programming Problem is given below.


Which of the following is not a constraint to the given Linear Programming Problem?


Which statement defines a feasible solution?


Which point is an infeasible solution?


What does the Extreme Point Theorem state about the optimum solution of an LPP, if it exists?


For a bounded feasible region, where do the maximum and minimum values occur?


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×