English

The Objective Function Z = 4x + 3y Can Be Maximised Subjected to the Constraints 3x + 4y ≤ 24, 8x + 6y ≤ 48, X ≤ 5, Y ≤ 6; X, Y ≥ 0 (A) at Only One Point (B) at Two Points Only - Mathematics

Advertisements
Advertisements

Question

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

Options

  •  at only one point

  • at two points only

  •  at an infinite number of points

  •  none of these

     
MCQ

Solution

 at an infinite number of points
 We need to maximize Z = 4x + 3y
First, we will convert the given inequations into equations, we obtain the following equations :
3x + 4y = 24 , 8x + 6y = 48 , x = 5 , y = 6, = 0 and y = 0.

The line 3x + 4y = 24 meets the coordinate axis at A(8, 0) and B(0,6). Join these points to obtain the line 3x + 4y = 24.
Clearly, (0, 0) satisfies the inequation 3x + 4y ≤ 24 . So, the region in xy-plane that contains the origin represents the solution set of the given equation.
The line 8x + 6y = 48 meets the coordinate axis at C(6, 0) and D(0,8). Join these points to obtain the line 8x + 6y = 48.
Clearly, (0, 0) satisfies the inequation 8x + 6y  ≤ 48. So, the region in xy-plane that contains the origin represents the solution set of the given equation.

x = 5 is the line passing through = 5 parallel to the Y axis.
y = 6 is the line passing through = 6 parallel to the X axis.

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. 

These lines are drawn using a suitable scale.
GRAPH

The corner points of the feasible region are O(0, 0) , \[G\left( 5, 0 \right)\] , \[F\left( 5, \frac{4}{3} \right)\] , \[E\left( \frac{24}{7}, \frac{24}{7} \right)\] and \[B\left( 0, 6 \right)\]

The values of Z at these corner points are as follows.

Corner point Z = 4x + 3y
O(0, 0) 4× 0 + 3 × 0 = 0
 
\[G\left( 5, 0 \right)\]
4 × 5 + 3 × 0 = 20
 
\[F\left( 5, \frac{4}{3} \right)\]
4 × 5 + 3 × \[\frac{4}{3}\] = 24
\[E\left( \frac{24}{7}, \frac{24}{7} \right)\]
4 × \[\frac{24}{7}\]+ 3 ×\[\frac{24}{7}\] =\[\frac{196}{7}\] = 24
 
\[B\left( 0, 6 \right)\]
4 × 0 + 3 × 6 = 18

We see that the maximum value of the objective function Z is 24 which is at \[F\left( 5, \frac{4}{3} \right)\] and  \[E\left( \frac{24}{7}, \frac{24}{7} \right)\] Thus, the optimal value of Z is 24.

As, we know that if a LPP has two optimal solution, then there are an infinite number of optimal solutions.
Therefore, the given objective function can be subjected at an infinite number of points.

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

APPEARS IN

RD Sharma Mathematics [English] Class 12
Chapter 30 Linear programming
MCQ | Q 9 | Page 67

Video TutorialsVIEW ALL [1]

RELATED QUESTIONS

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.


Vitamins A and B are found in two different foods F1 and F2. One unit of food F1contains 2 units of vitamin A and 3 units of vitamin B. One unit of food F2 contains 4 units of vitamin A and 2 units of vitamin B. One unit of food F1 and F2 cost Rs 50 and 25 respectively. The minimum daily requirements for a person of vitamin A and B is 40 and 50 units respectively. Assuming that any thing in excess of daily minimum requirement of vitamin A and B is not harmful, find out the optimum mixture of food F1 and F2 at the minimum cost which meets the daily minimum requirement of vitamin A and B. 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.


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.


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


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


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 + 2y subjected to the constraints 2x + 3y ≤ 18, x + y ≥ 10 ; xy ≥ 0 is


The optimal value of the objective function is attained at the points


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 ______.


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


Choose the correct alternative:

How does a constraint, “A washing machine can hold up to 8 kilograms of cloths (X)” can be given?


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 ______


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 ______


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 minimum value of Z = 3x + 2y (if any), if the feasible region for an LPP is shown in Figue.


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


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.


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


A type of problems which seek to maximise (or, minimise) profit (or cost) form a general class of problems called.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×