हिंदी

Solve the following LPP graphically:Maximise Z = 2x + 3y, subject to x + y ≤ 4, x ≥ 0, y ≥ 0 - Mathematics

Advertisements
Advertisements

प्रश्न

Solve the following LPP graphically:
Maximise Z = 2x + 3y, subject to x + y ≤ 4, x ≥ 0, y ≥ 0

सारिणी
आलेख

उत्तर

The shaded region (OAB) in the Figure is the feasible region determined by the system of constraints x ≥ 0, y ≥ 0 and x + y ≤ 4.

The feasible region OAB is bounded

So, maximum value will occur at a corner point of the feasible region.

Corner Points are O(0, 0), A (4, 0) and B (0, 4)

Evaluate Z at each of these corner point.

Corner Point Value of Z  
0,(0, 0) 2 (0) + 3 (0) = 0  
A(4, 0) 2 (4) + 3 (0) = 8  
B(0, 4) 2 (0) + 3 (4) = 12 ← Maximum


Hence, the maximum value of Z is 12 at the point (0, 4)

shaalaa.com
  क्या इस प्रश्न या उत्तर में कोई त्रुटि है?
अध्याय 12: Linear Programming - Solved Examples [पृष्ठ २४४]

APPEARS IN

एनसीईआरटी एक्झांप्लर Mathematics [English] Class 12
अध्याय 12 Linear Programming
Solved Examples | Q 3 | पृष्ठ २४४

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

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

A rubber company is engaged in producing three types of tyres AB and C. Each type requires processing in two plants, Plant I and Plant II. The capacities of the two plants, in number of tyres per day, are as follows:

Plant A B C
I 50 100 100
II 60 60 200

The monthly demand for tyre AB and C is 2500, 3000 and 7000 respectively. If plant I costs Rs 2500 per day, and plant II costs Rs 3500 per day to operate, how many days should each be run per month to minimize cost while meeting the demand? Formulate the problem as LPP.


A manufacturer can produce two products, A and B, during a given time period. Each of these products requires four different manufacturing operations: grinding, turning, assembling and testing. The manufacturing requirements in hours per unit of products A and B are given below.

  A B
Grinding 1 2
Turning 3 1
Assembling 6 3
Testing 5 4


The available capacities of these operations in hours for the given time period are: grinding 30; turning 60, assembling 200; testing 200. The contribution to profit is Rs 20 for each unit of A and Rs 30 for each unit of B. The firm can sell all that it produces at the prevailing market price. Determine the optimum amount of A and B to produce during the given time period. Formulate this as a LPP.


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 Rs 25 Rs 30  
Labour cost per unit Rs 16 Rs 20  
Raw material cost per unit Rs 4 Rs 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.


An airline agrees to charter planes for a group. The group needs at least 160 first class seats and at least 300 tourist class seats. The airline must use at least two of its model 314 planes which have 20 first class and 30 tourist class seats. The airline will also use some of its model 535 planes which have 20 first class seats and 60 tourist class seats. Each flight of a model 314 plane costs the company Rs 100,000 and each flight of a model 535 plane costs Rs 150,000. How many of each type of plane should be used to minimize the flight cost? Formulate this as a LPP.


The solution set of the inequation 2x + y > 5 is


Let X1 and X2 are optimal solutions of a LPP, then


The maximum value of Z = 4x + 2y subjected to the constraints 2x + 3y ≤ 18, x + y ≥ 10 ; xy ≥ 0 is


The maximum value of Z = 4x + 3y subjected to the constraints 3x + 2y ≥ 160, 5x + 2y ≥ 200, x + 2y ≥ 80; xy ≥ 0 is


If the constraints in a linear programming problem are changed


A company manufactures two types of toys A and B. A toy of type A requires 5 minutes for cutting and 10 minutes for assembling. A toy of type B requires 8 minutes for cutting and 8 minutes for assembling. There are 3 hours available for cutting and 4 hours available for assembling the toys in a day. The profit is ₹ 50 each on a toy of type A and ₹ 60 each on a toy of type B. How many toys of each type should the company manufacture in a day to maximize the profit? Use linear programming to find the solution. 


Feasible region is the set of points which satisfy ______.


The optimum value of the objective function of LPP occurs at the center of the feasible region.


Choose the correct alternative:

The constraint that in a college there are more scholarship holders in FYJC class (X) than in SYJC class (Y) is given by


A doctor prescribed 2 types of vitamin tablets, T1 and T2 for Mr. Dhawan. The tablet T1 contains 400 units of vitamin and T2 contains 250 units of vitamin. If his requirement of vitamin is at least 4000 units, then the inequation for his requirement will be ______


Ganesh owns a godown used to store electronic gadgets like refrigerator (x) and microwave (y). If the godown can accommodate at most 75 gadgets, then this can be expressed as a constraint by ______


Determine the maximum value of Z = 4x + 3y if the feasible region for an LPP is shown in figure


Determine the minimum value of Z = 3x + 2y (if any), if the feasible region for an LPP is shown in Figue.


A manufacturing company makes two types of television sets; one is black and white and the other is colour. The company has resources to make at most 300 sets a week. It takes Rs 1800 to make a black and white set and Rs 2700 to make a coloured set. The company can spend not more than Rs 648000 a week to make television sets. If it makes a profit of Rs 510 per black and white set and Rs 675 per coloured set, how many sets of each type should be produced so that the company has maximum profit? Formulate this problem as a LPP given that the objective is to maximise the profit.


Feasible region (shaded) for a LPP is shown in the Figure Minimum of Z = 4x + 3y occurs at the point ______.


The common region determined by all the linear constraints of a LPP is called the ______ region.


Conditions under which the object function is to be maximum or minimum are called ______.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×