The feasible solution of LPP ……….....

The feasible solution of LPP ………..

A

satisfy all the constraints

B

satisfy some of the constraints

C

always corner points of feasible solution

D

always optimal value of objective function

Text Solution

Verified by Experts

The correct Answer is:

A

Topper's Solved these Questions

LINEAR PROGRAMMING
KUMAR PRAKASHAN|Exercise PRACTICE PAPER - 12|14 Videos
LINEAR PROGRAMMING
KUMAR PRAKASHAN|Exercise PRACTICE WORK|25 Videos
LINEAR PROGRAMMING
KUMAR PRAKASHAN|Exercise SOLUTIONS OF NCERT EXEMPLAR PROBLEMS|44 Videos
INVERSE TRIGONOMETRIC FUNCTIONS
KUMAR PRAKASHAN|Exercise PRACTICE PAPER - 2 (SECTION - D)|2 Videos
MATRICES
KUMAR PRAKASHAN|Exercise Practice Paper - 3 (Section - D)|1 Videos

Similar Questions

Explore conceptually related problems

The feasible solution for a LPP is shown in Figure Let z = -3x - 4y objective function. Minimum of Z occurs at

The feasible solution for a LPP is shown in Figure Let z = -3x - 4y objective function. Maximum of Z occurs at

If the feasible region for a LPP is …………, then the optimal value of the objective function z = ax + by may or may not exist.

The feasible region for a LPP is shown in Figure. Find the minimum value of z=11x+7y .

The feasible region for a LPP is shown in Figure. Evaluate z = 4x + y at each of the corner points at this region. Find the minimum value of z, if exists.

If the feasible region for a LPP is unbounded, maximum or minimum of the objective function Z = ax + by may or may not exist.

Corner points of the feasible region for an LPP are (0, 2), (3, 0), (6, 0), (6, 8) and (0, 5). Let F = 4x + 6y be the objective function. The Minimum value of F occurs at ………..

Corner points of the feasible region for an LPP are (0, 2), (3, 0), (6, 0), (6, 8) and (0, 5). Let F = 4x + 6y be the objective function. (Maximum of F)-(Minimum of F) =

The feasible region for an LLP is always a …….. polygon.

The feasible region for an LLP is shown in the Figure. Let z = 3x - 4y be the objective function. Maximum value of z is

KUMAR PRAKASHAN-LINEAR PROGRAMMING-MULTIPLE CHOICE QUESTIONS

The region represented by the inequation x-y le -1, x-y le 0, x le 0, ...
Text Solution
|
Let x and y are optimal solution of a LPP, then …
Text Solution
|
The feasible solution of LPP ………..
Text Solution
|
Which of the following statement is correct ?
Text Solution
|
Consider a LPP given by minimise Z = 6x + 10y. Subject to x ge 6, y ge...
Text Solution
|
Objective function of a LPP is …………
Text Solution
|
The maximum value of Z = x + 4y subject to the constraints 3x+6y le 6,...
Text Solution
|
The corner points of the feasible region determined by some inequality...
Text Solution
|
Objective function of a LPP is …………
Text Solution
|
The corner points of the feasible region are A(3, 3), B(20, 3), C(20, ...
Text Solution
|
Cake-A requires 200g of flour and 25g of fat Cake-B requires 100 g of ...
Text Solution
|
The shaded region in the given figure is a graph of ……………
Text Solution
|
The point at which the maximum value of Z = 3x + 2y subject to the con...
Text Solution
|
The solution of linear programming problem, maximize Z=3x(1)+5x(2) sub...
Text Solution
|
The maximum value of Z = x + 3y subject to the constraints 2x+y le 20,...
Text Solution
|
The solution set of the constraints x+2y ge 11, 3x+4y le 30, 2x+5y le ...
Text Solution
|
The feasible region of the inequality x+y le 1" and "x-y le 1 lies in ...
Text Solution
|
The following five inequalities form the feasible region. 2x-y le 8, x...
Text Solution
|
The position of the points O(0, 0) and P(2, -1) is ………, in the region ...
Text Solution
|
The constraints x+y le 4, 3x+3y ge 18, x ge 0, y ge 0 defines on ………
Text Solution
|