The value of objective function is maximum under linear constraintsA.

1.	The value of objective function is maximum under linear constraintsA. at the centre of feasible regionB. at (0, 0)C. at any vertex of feasible regionD. the vertex which is maximum distance from (0, 0)
Answer» Correct answer is C. Given that, The objective function will be maximum at ______ As per the steps while solving a Linear Programming Problem, we first determine the feasible region using the constraints and then, consider the vertices of the obtained convex polygon in the objective function to see the vertex at which the objective function obtains a maximum value. Then that vertex is determines the maximum value of the objective function. Hence, the maximum value of an objective function under linear constraints is at any vertex of the feasible region.

The value of objective function is maximum under linear constraintsA. at the centre of feasible regionB. at (0, 0)C. at any vertex of feasible regionD. the vertex which is maximum distance from (0, 0)

Answer»

Correct answer is C.

Given that,

The objective function will be maximum at ______

As per the steps while solving a Linear Programming Problem, we first determine the feasible region using the constraints and then, consider the vertices of the obtained convex polygon in the objective function to see the vertex at which the objective function obtains a maximum value. Then that vertex is determines the maximum value of the objective function.

Hence, the maximum value of an objective function under linear constraints is at any vertex of the feasible region.

Discussion

No Comment Found

Related InterviewSolutions

In a cattle breading firm, it is prescribed that the food ration for one animal must contain 14, 22 and 1 units of nutrients A, B and C respectively. Two different kinds of fodder are available. Each unit of these two contains the following amounts of these three nutrients :Nutrient ↓ Fodder →Fodder 1Fodder 2Nutrient A21Nutrient B23Nutrient C11The cost of fodder 1 is Rs 3 per unit and that of fodder Rs 2, Formulate the L.P.P. to minimize the cost.
Archana, a dietician wishes to mix two types of foods F1 and F2 in such a way that the vitamin contents of the mixture contains at least 6 units of vitamin A and 8 units of vitamin B. Food F1 contains 2 units/kg of vitamin A and 3 units/kg of vitamin B while food F2 contains 3 units/kg of vitamin A and 4 units/kg of Vitamin B. Food F1 costs Rs 50 per kg and food F2 costs Rs 75 per kg. Formulate the problem as L.P.P. to minimize the cost of the mixture.
The point at which the maximum value of x + y subject to the constraints x + 2y ≤ 70, 2x + y ≤ 95, x ≥ 0, y ≥ 0 is obtained at _______.(A) (30, 25) (B) (20, 35) (C) (35, 20) (D) (40, 15)
A firm owned by Sheshnag manufactures two types of products A and B and sell them at a profit of Rs 2 on type of A and 3 on type B. Each product is processed on machines M1 and M2. Type A requires one minute of processing time on M1 and two minutes on M2. Type B requires one minute of time on M1 and one minute on M2. The machine M1 is available for not more than 6 hours 40 minutes while M2 is available for 10 hours during any working day. Formulate the L.P.P. in order to find how many products of each type, should the firm produce each day so that profit is maximum.
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 AProduct BWeekly capacityDepartment 132130Department 246260Selling price per unitRs. 25Rs. 30Labour cost per unitRs. 16Rs. 20Raw material cost per unitRs. 4Rs. 4The 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.
The corner points of the feasible region determined by the following system of linear inequalities: 2x+y≤10,x+3y≤15,xy≥ 0 are (0,0) (5,0), (3,4) and (0,5)Let Z = px + qy, where p, q > 0.Condition on p and q so that the maximum of Z occurs at both (3, 4) and (0, 5) is(A) p = q (B) p = 2q (C) p = 3q (D) q = 3p
A corner point of a feasible region is a point in the region which is the _________ of two boundary lines.
In a LPP, the linear inequalities or restrictions on the variables are called _________.
The corner points of the feasible region determined by the following system of linear inequalities: 2x + y ≤ 10, x + 3y ≤ 15, x, y ≥ 0 are (0, 0), (5, 0), (3, 4) and (0, 5). Let Z = px + qy, where p, q >0 . Condition on p and q so that the maximum of Z occurs at both (3, 4) and (0, 5) is.(A) p = q (B) P = 2q (C) p = 3q (D) q = 3p
A feasible region of a system of linear inequalities is said to be _________ if it can be enclosed within a circle.