рдорд░рд╛рдареА

The corner points of the shaded unbounded feasible region of an LPP are (0, 4), (0.6, 1.6) and (3, 0) as shown in the figure. The minimum value of the objective function Z = 4x + 6y occurs at ______.

Advertisements
Advertisements

рдкреНрд░рд╢реНрди

The corner points of the shaded unbounded feasible region of an LPP are (0, 4), (0.6, 1.6) and (3, 0) as shown in the figure. The minimum value of the objective function Z = 4x + 6y occurs at ______.

рдкрд░реНрдпрд╛рдп

  • (0.6, 1.6) only

  • (3, 0) only

  • (0.6, 1.6) and (3, 0) only

  • at every point of the line-segment joining the points (0.6, 1.6) and (3, 0)

MCQ
рд░рд┐рдХрд╛рдореНрдпрд╛ рдЬрд╛рдЧрд╛ рднрд░рд╛
Advertisements

рдЙрддреНрддрд░

The corner points of the shaded unbounded feasible region of an LPP are (0, 4), (0.6, 1.6) and (3, 0) as shown in the figure. The minimum value of the objective function Z = 4x + 6y occurs at at every point of the line-segment joining the points (0.6, 1.6) and (3, 0).

Explanation:

The minimum value of the objective function occurs at two adjacent corner points (0.6, 1.6) and (3, 0) and there is no point in the half plane 4ЁЭСе + 6ЁЭСж < 12 in common with the feasible region. So, the minimum value occurs at every point of the line-segment joining the two points.

shaalaa.com
  рдпрд╛ рдкреНрд░рд╢реНрдирд╛рдд рдХрд┐рдВрд╡рд╛ рдЙрддреНрддрд░рд╛рдд рдХрд╛рд╣реА рддреНрд░реБрдЯреА рдЖрд╣реЗ рдХрд╛?
2022-2023 (March) Sample

рд╡реНрд╣рд┐рдбрд┐рдУ рдЯреНрдпреВрдЯреЛрд░рд┐рдпрд▓VIEW ALL [1]

рд╕рдВрдмрдВрдзрд┐рдд рдкреНрд░рд╢реНтАНрди

A dealer in rural area wishes to purchase a number of sewing machines. He has only Rs 5,760 to invest and has space for at most 20 items for storage. An electronic sewing machine cost him Rs 360 and a manually operated sewing machine Rs 240. He can sell an electronic sewing machine at a profit of Rs 22 and a manually operated sewing machine at a profit of Rs 18. Assuming that he can sell all the items that he can buy, how should he invest his money in order to maximize his profit? Make it as a LPP and solve it graphically.


Solve the following L.P.P graphically:

Maximize: Z = 10x + 25y
Subject to: x ≤ 3, y ≤ 3, x + y ≤ 5, 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.


Solve the following LPP graphically :
Maximise Z = 105x + 90y
subject to the constraints
x + y ≤ 50
2x + y ≤ 80
x ≥ 0, y ≥ 0.


Minimize Z = 18x + 10y
Subject to 

\[4x + y \geq 20\]
\[2x + 3y \geq 30\]
\[ x, y \geq 0\]


Maximize Z = 4x + 3y
subject to

\[3x + 4y \leq 24\]
\[8x + 6y \leq 48\]
\[ x \leq 5\]
\[ y \leq 6\]
\[ 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 = 4x + 3y
Subject to 

\[3x + 4y \leq 24\]
\[8x + 6y \leq 48\]
\[ x \leq 5\]
\[ y \leq 6\]
\[ x, y \geq 0\]


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


A diet of two foods F1 and F2 contains nutrients thiamine, phosphorous and iron. The amount of each nutrient in each of the food (in milligrams per 25 gms) is given in the following table:


Nutrients
Food
 
F1 F2
Thiamine 0.25 0.10

 
Phosphorous 0.75 1.50
Iron 1.60 0.80

The minimum requirement of the nutrients in the diet are 1.00 mg of thiamine, 7.50 mg of phosphorous and 10.00 mg of iron. The cost of F1 is 20 paise per 25 gms while the cost of F2 is 15 paise per 25 gms. Find the minimum cost of diet.


A diet for a sick person must contain at least 4000 units of vitamins, 50 units of minerals and 1400 of calories. Two foods A and B, are available at a cost of Rs 4 and Rs 3 per unit respectively. If one unit of A contains 200 units of vitamin, 1 unit of mineral and 40 calories and one unit of food B contains 100 units of vitamin, 2 units of minerals and 40 calories, find what combination of foods should be used to have the least cost?


A hospital dietician wishes to find the cheapest combination of two foods, A and B, that contains at least 0.5 milligram of thiamin and at least 600 calories. Each unit of Acontains 0.12 milligram of thiamin and 100 calories, while each unit of B contains 0.10 milligram of thiamin and 150 calories. If each food costs 10 paise per unit, how many units of each should be combined at a minimum cost?


A diet is to contain at least 80 units of vitamin A and 100 units of minerals. Two foods F1and F2 are available. Food F1 costs Rs 4 per unit and F2 costs Rs 6 per unit one unit of food F1 contains 3 units of vitamin A and 4 units of minerals. One unit of food F2contains 6 units of vitamin A and 3 units of minerals. Formulate this as a linear programming problem and find graphically the minimum cost for diet that consists of mixture of these foods and also meets the mineral nutritional requirements


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.


A chemical company produces two compounds, A and B. The following table gives the units of ingredients, C and D per kg of compounds A and B as well as minimum requirements of C and D and costs per kg of A and B. Find the quantities of A and B which would give a supply of C and D at a minimum cost.

  Compound Minimum requirement
A B  
Ingredient C
Ingredient D
1
3
2
1
80
75
Cost (in Rs) per kg 4 6 -

A firm manufactures two types of products A and B and sells them at a profit of Rs 5 per unit of type A and Rs 3 per unit of type B. Each product is processed on two machines M1 and M2. One unit of type A requires one minute of processing time on M1 and two minutes of processing time on M2, whereas one unit of type B requires one minute of processing time on M1 and one minute on M2. Machines M1 and M2 are respectively available for at most 5 hours and 6 hours in a day. Find out how many units of each type of product should the firm produce a day in order to maximize the profit. 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?


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


 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 medical company has factories at two places, A and B. From these places, supply is made to each of its three agencies situated at PQ 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 company manufactures two types of cardigans: type A and type B. It costs тВ╣ 360 to make a type A cardigan and тВ╣ 120 to make a type B cardigan. The company can make at most 300 cardigans and spend at most тВ╣ 72000 a day. The number of cardigans of type B cannot exceed the number of cardigans of type A by more than 200. The company makes a profit of тВ╣ 100 for each cardigan of type A and тВ╣ 50 for every cardigan of type B. 

Formulate this problem as a linear programming problem to maximize the profit to the company. Solve it graphically and find the maximum profit.


Find the graphical solution for the system of linear inequation 2x + y ≤ 2, x − y ≤ 1


Find the solution set of inequalities 0 ≤ x ≤ 5, 0 ≤ 2y ≤ 7


The minimum value of z = 2x + 9y subject to constraints x + y ≥ 1, 2x + 3y ≤ 6, x ≥ 0, y ≥ 0 is ______.


For the LPP, maximize z = x + 4y subject to the constraints x + 2y ≤ 2, x + 2y ≥ 8, x, y ≥ 0 ______.


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,


Solve the following linear programming problem graphically:

Minimize: Z = 5x + 10y

Subject to constraints:

x + 2y ≤ 120, x + y ≥ 60, x – 2y ≥ 0, x ≥ 0, y ≥ 0.


Solve the following Linear Programming Problem graphically:

Maximize: z = – x + 2y,

Subject to the constraints: x ≥ 3, x + y ≥ 5, x + 2y ≥ 6, 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.

The solution set of constraints x + 2y ≥ 11, 3x + 4y  ≤  30, 2x + 5y ≤ 30 and x ≥ 0, y ≥ 0, includes the point ______.


Share
Notifications

Englishрд╣рд┐рдВрджреАрдорд░рд╛рдареА


      Forgot password?
Use app×