मराठी

The value of objective function is maximum under linear constraints ______. - Mathematics

Advertisements
Advertisements

प्रश्न

The value of objective function is maximum under linear constraints ______.

पर्याय

  • at the centre of feasible region

  •  at (0, 0)

  •  at any vertex of feasible region

  •  the vertex which is maximum distance from (0, 0)

MCQ
रिकाम्या जागा भरा

उत्तर

The value of objective function is maximum under linear constraints at any vertex of feasible region.

Explanation:

In linear programming problem we substitute the coordinates of vertices of feasible region in the objective function and then we obtain the maximum or minimum value. Therefore, the value of objective function is maximum under linear constraints at any vertex of feasible region.

shaalaa.com
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
पाठ 30: Linear programming - MCQ [पृष्ठ ६८]

APPEARS IN

आरडी शर्मा Mathematics [English] Class 12
पाठ 30 Linear programming
MCQ | Q 16 | पृष्ठ ६८

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

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

A retired person wants to invest an amount of Rs. 50, 000. His broker recommends investing in two type of bonds ‘A’ and ‘B’ yielding 10% and 9% return respectively on the invested amount. He decides to invest at least Rs. 20,000 in bond ‘A’ and at least Rs. 10,000 in bond ‘B’. He also wants to invest at least as much in bond ‘A’ as in bond ‘B’. Solve this linear programming problem graphically to maximise his returns.


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:

Maximize: z = 3x + 5y
Subject to:  x + 4y ≤ 24
                  3x + y ≤ 21
                  x + y ≤ 9
                  x ≥ 0, y ≥ 0


A dietician wishes to mix two kinds ·of food X· and Y in such a way that the  mixture contains at least 10 units of vitamin A, 12 units of vitamin B arid 8 units of vitamin C. The vitamin contents of one kg food is given below:

Food Vitamin A Vitamin.B Vitamin C
X 1 unit 2 unit 3 unit
Y 2 unit 2 unit 1 unit

Orie kg of food X costs Rs 24 and one kg of food Y costs Rs 36. Using Linear Programming, find the least cost of the total mixture. which will contain the required vitamins.


Maximize Z = 5x + 3y
Subject to

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


Maximize Z = 9x + 3y
Subject to 

\[2x + 3y \leq 13\]

\[ 3x + y \leq 5\]

\[ x, y \geq 0\]


Maximize Z = 15x + 10y
Subject to 

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

 


Maximize Z = 3x + 4y
Subject to

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


Show the solution zone of the following inequalities on a graph paper:

\[5x + y \geq 10\]

\[ x + y \geq 6\]

\[x + 4y \geq 12\]

\[x \geq 0, y \geq 0\]

Find x and y for which 3x + 2y is minimum subject to these inequalities. Use a graphical method.


Find the minimum value of 3x + 5y subject to the constraints
− 2x + y ≤ 4, x + y ≥ 3, x − 2y ≤ 2, xy ≥ 0.


Find graphically, the maximum value of Z = 2x + 5y, subject to constraints given below:

2x + 4y ≤ 8
3x + y ≤ 6
x + y ≤ 4 
x ≥ 0, ≥ 0   


Kellogg is a new cereal formed of a mixture of bran and rice that contains at least 88 grams of protein and at least 36 milligrams of iron. Knowing that bran contains 80 grams of protein and 40 milligrams of iron per kilogram, and that rice contains 100 grams of protein and 30 milligrams of iron per kilogram, find the minimum cost of producing this new cereal if bran costs Rs 5 per kg and rice costs Rs 4 per kg


A wholesale dealer deals in two kinds, A and B (say) of mixture of nuts. Each kg of mixture A contains 60 grams of almonds, 30 grams of  cashew nuts and 30 grams of hazel nuts. Each kg of mixture B contains 30 grams of almonds, 60 grams of cashew nuts and 180 grams of hazel nuts. The remainder of both mixtures is per nuts. The 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 nuts and 540 grams of hazel nuts. Mixture A costs Rs 8 per kg. and mixture B costs Rs 12 per kg. Assuming that mixtures A and B are uniform, use graphical method to determine the number of kg. of each mixture which he should use to minimise the cost of the bag.


If a young man drives his vehicle at 25 km/hr, he has to spend Rs 2 per km on petrol. If he drives it at a faster speed of 40 km/hr, the petrol cost increases to Rs 5/per km. He has Rs 100 to spend on petrol and travel within one hour. Express this as an LPP and solve the same.


A company produces two types of leather belts, say type A and B. Belt A is a superior quality and belt B is of a lower quality. Profits on each type of belt are Rs 2 and Rs 1.50 per belt, respectively. Each belt of type A requires twice as much time as required by a belt of type B. If all belts were of type B, the company could produce 1000 belts per day. But the supply of leather is sufficient only for 800 belts per day (both A and B combined). Belt A requires a fancy buckle and only 400 fancy buckles are available for this per day. For belt of type B, only 700 buckles are available per day.
How should the company manufacture the two types of belts in order to have a maximum overall profit?


A company manufactures two types of novelty Souvenirs made of plywood. Souvenirs of type A require 5 minutes each for cutting and 10 minutes each for assembling. Souvenirs of type B require 8 minutes each for cutting and 8 minutes each for assembling. There are 3 hours 20 minutes available for cutting and 4 hours available for assembling. The profit is 50 paise each for type A and 60 paise each for type B souvenirs. How many souvenirs of each type should the company manufacture in order to maximize the profit?


A manufacturer makes two products A and B. Product A sells at Rs 200 each and takes 1/2 hour to make. Product B sells at Rs 300 each and takes 1 hour to make. There is a permanent order for 14 of product A and 16 of product B. A working week consists of 40 hours of production and weekly turnover must not be less than Rs 10000. If the profit on each of product A is Rs 20 and on product B is Rs 30, then how many of each should be produced so that the profit is maximum. Also, find the maximum profit.


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?


There are two factories located one at place P and the other at place Q. From these locations, a certain commodity is to be delivered to each of the three depots situated at A, B and C. The weekly requirements of the depots are respectively 5, 5 and 4 units of the commodity while the production capacity of the factories at P and Q are respectively 8 and 6 units. The cost of transportation per unit is given below:
 

From \ To Cost (in ₹)
  A B C
P 160 100 150
Q 100 120 100


How many units should be transported from each factory to each depot in order that the transportation cost is minimum. What will be the minimum transportation cost?


 There are two types of fertilisers 'A' and 'B' . 'A' consists of 12% nitrogen and 5% phosphoric acid whereas 'B' consists of 4% nitrogen and 5% phosphoric acid. After testing the soil conditions, farmer finds that he needs at least 12 kg of nitrogen and 12 kg of phosphoric acid for his crops. If 'A' costs ₹10 per kg and 'B' cost ₹8 per kg, then graphically determine how much of each type of fertiliser should be used so that nutrient requiremnets are met at a minimum cost


A company manufactures two types of novelty souvenirs made of plywood. Souvenirs of type A
require 5 minutes each for cutting and 10 minutes each for assembling. Souvenirs of type B require 8 minutes each for cutting and 8 minutes each for assembling. There are 3 hours and 20 minutes available  for cutting and 4 hours available for assembling. The profit is Rs. 50 each for type A and Rs. 60 each  for type B souvenirs. How many souvenirs of each type should the company manufacture in order to  maximize profit? Formulate the above LPP and solve it graphically and also find the maximum profit. 


A company manufactures two types of products A and B. Each unit of A requires 3 grams of nickel and 1 gram of chromium, while each unit of B requires 1 gram of nickel and 2 grams of chromium. The firm can produce 9 grams of nickel and 8 grams of chromium. The profit is ₹ 40 on each unit of the product of type A and ₹ 50 on each unit of type B. How many units of each type should the company manufacture so as to earn a maximum profit? Use linear programming to find the solution.


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 = 3x + 10y subjected to the conditions 5x + 2y ≤ 10, 3x + 5y ≤ 15, x, y ≥ 0 is ______.


Maximise and Minimise Z = 3x – 4y subject to x – 2y ≤ 0, – 3x + y ≤ 4, x – y ≤ 6, x, y ≥ 0


Corner points of the feasible region determined by the system of linear constraints are (0, 3), (1, 1) and (3, 0). Let Z = px + qy, where p, q > 0. Condition on p and q so that the minimum of Z occurs at (3, 0) and (1, 1) is ______.


Let R be the feasible region (convex polygon) for a linear programming problem and let Z = ax + by be the objective function. When Z has an optimal value (maximum or minimum), where the variables x and y are subject to constraints described by linear inequalities,


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 maximum value of Z = 3x + 4y subjected to contraints x + y ≤ 40, x + 2y ≤ 60, x ≥ 0 and y ≥ 0 is ____________.


Minimise z = – 3x + 4y subject to x + 2y ≤ 8, 3x + 2y ≤ 12, x ≥ 0, y ≥ 0 What will be the minimum value of z ?


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


Solve the following Linear Programming Problem graphically:

Maximize Z = 400x + 300y subject to x + y ≤ 200, x ≤ 40, x ≥ 20, y ≥ 0


The constraints –x1 + x2 ≤ 1, –x1 + 3x2 ≤ 9, x1x2 ≥ 0 define on ______.


Solve the following Linear Programming Problem graphically:

Maximize: P = 70x + 40y

Subject to: 3x + 2y ≤ 9,

3x + y ≤ 9,

x ≥ 0,y ≥ 0.


Minimize z = x + 2y,

Subject to x + 2y ≥ 50, 2x – y ≤ 0, 2x + y ≤ 100, x ≥ 0, y ≥ 0.


Solve the following Linear Programming Problem graphically.

Maximise Z = 5x + 2y subject to:

x – 2y ≤ 2,

3x + 2y ≤ 12,

– 3x + 2y ≤ 3,

x ≥ 0, y ≥ 0


Aman has ₹ 1500 to purchase rice and wheat for his grocery shop. Each sack of rice and wheat costs ₹ 180 and Rupee ₹ 120 respectively. He can store a maximum number of 10 bags in his shop. He will earn a profit of ₹ 11 per bag of rice and ₹ 9 per bag of wheat.

  1. Formulate a Linear Programming Problem to maximise Aman’s profit.
  2. Calculate the maximum profit.

Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×