English

The Maximum Value of Z = 4x + 2y Subjected to the Constraints 2x + 3y ≤ 18, X + Y ≥ 10; X, Y ≥ 0 is (A) 36 (B) 40 (C) 20 (D) None of These

Advertisements
Advertisements

Question

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

Options

  •  36

  • 40

  •  20

  •  none of these

     
MCQ
Sum
Advertisements

Solution

 none of these
We need to maximize the function Z = 4x + 2y
Converting the given inequations into equations, we obtain

\[2x + 3y = 18, x + y = 10, x = 0\text{ and } y = 0\]

Region represented by 2x + 3y ≤ 18 :
The line 2x + 3y = 18 meets the coordinate axes at A(9, 0) and B(0, 6) respectively. By joining these points we obtain the line 2x + 3y = 18.
Clearly (0,0) satisfies the inequation 2x + 3y ≤ 18. So,the region in xy plane which contain the origin represents the solution set of the inequation 2x + 3y ≤ 18.

Region represented by x y ≥ 10:
The line x y = 10 meets the coordinate axes at \[C\left( 10, 0 \right)\] and D(0, 10) respectively. By joining these points we obtain the line x y =10.

Clearly (0,0) does not satisfies the inequation x y ≥ 10. So,the region which does not contain the origin represents the solution set of the inequation x y ≥ 10.

Region represented by x ≥ 0 and y ≥ 0:
Since, every point in the first quadrant satisfies these inequations . So, the first quadrant is the region represented by the inequations x ≥ 0 and ≥ 0.

We observe that feasible region of the given LPP does not exist.

shaalaa.com
  Is there an error in this question or solution?
Chapter 29: Linear programming - MCQ [Page 67]

APPEARS IN

R.D. Sharma Mathematics Volume 1 and 2 [English] Class 12
Chapter 29 Linear programming
MCQ | Q 5 | Page 67

Video TutorialsVIEW ALL [1]

RELATED QUESTIONS

A company is making two products A and B. The cost of producing one unit of products A and B are Rs 60 and Rs 80 respectively. As per the agreement, the company has to supply at least 200 units of product B to its regular customers. One unit of product  A  requires one machine hour whereas product B has machine hours available abundantly within the company. Total machine hours available for product A are 400 hours. One unit of each product A and B requires one labour hour each and total of 500 labour hours are available. The company wants to minimize the cost of production by satisfying the given requirements. Formulate the problem as a LPP.


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.


An automobile manufacturer makes automobiles and trucks in a factory that is divided into two shops. Shop A, which performs the basic assembly operation, must work 5 man-days on each truck but only 2 man-days on each automobile. Shop B, which performs finishing operations, must work 3 man-days for each automobile or truck that it produces. Because of men and machine limitations, shop A has 180 man-days per week available while shop B has 135 man-days per week. If the manufacturer makes a profit of Rs 30000 on each truck and Rs 2000 on each automobile, how many of each should he produce to maximize his profit? 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.


A firm has to transport at least 1200 packages daily using large vans which carry 200 packages each and small vans which can take 80 packages each. The cost of engaging each large van is ₹400 and each small van is ₹200. Not more than ₹3000 is to be spent daily on the job and the number of large vans cannot exceed the number of small vans. Formulate this problem as a LPP given that the objective is to minimize cost


Objective function of a LPP is


Which of the following sets are convex?


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


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


The objective function Z = 4x + 3y can be maximised subjected to the constraints 3x + 4y ≤ 24, 8x + 6y ≤ 48, x ≤ 5, y ≤ 6; xy ≥ 0


If the constraints in a linear programming problem are changed


Which of the following is not a convex set?


State whether the following is True or False:

The optimum value of the objective function of LPP occurs at the centre 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


State whether the following statement is True or False:

The half-plane represented by 3x + 4y ≥ 12 includes the point (4, 3)


Tyco Cycles Ltd manufactures bicycles (x) and tricycles (y). The profit earned from the sales of each bicycle and a tricycle are ₹ 400 and ₹ 200 respectively, then the total profit earned by the manufacturer will be given as ______


By spending almost ₹ 250, Rakhi bought some kg grapes (x) and some dozens of bananas (y), then as a constraint this information can be expressed by ______


Heramb requires at most 400 calories from his breakfast. Every morning he likes to take oats and milk. If each bowl of oats and a glass of milk provides him 80 calories and 50 calories respectively, then as a constraint this information can be expressed as ______


Ms. Mohana want to invest at least ₹ 55000 in Mutual funds and fixed deposits. Mathematically this information can be written as ______


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


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.


Minimise Z = 3x + 5y subject to the constraints:
x + 2y ≥ 10
x + y ≥ 6
3x + y ≥ 8
x, y ≥ 0


The corner points of the feasible region determined by the system of linear constraints are (0, 10), (5, 5), (15, 15), (0, 20). Let Z = px + qy, where p, q > 0. Condition on p and q so that the maximum of Z occurs at both the points (15, 15) and (0, 20) is ______.


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


In maximization problem, optimal solution occurring at corner point yields the ____________.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×