Directions: (1 - 5) |
Linear programming is a method for finding the optimal values (maximum or minimum) of quantities subject to the constraints when relationship is expressed as linear equations or inequations. |
Based on the above information, answer the following questions : |
The feasible region for an LPP is shown in the figure. Let \[Z=2x+5y\] be the objective function. Maximum of Z occurs at |
The corner points of the feasible region determined by the system of linear constraints are (0, 0), (0, 40), (20, 40), (60, 20), (60, 0). The objective function is Z = 4x + 3y. | |
Compare the quantity in Column A and Column B. | |
Column A | Column B |
Maximum of Z | 325 |
Directions: (6 - 10) |
Deepa rides her car at 25 km/hr. She has to spend Rs 2 per km on diesel and if she rides it at a faster speed of 40 km/her, the diesel cost increases to Rs 5 per km. She has Rs 100 to spend on diesel. Let she travels x kms with speed 25 km/h and y kms with speed 40 km/hr. The feasible region for the LPP is shown below : |
Based on the above information, answer the following questions : |
Directions: (11 - 15) |
Corner points of the feasible region for an LPP are (0, 3), (5, 0), (6, 8), (0, 8). Let \[Z\text{ }=4x-6y\] be the objective function. |
Based on the above information, answer the following questions: |
The feasible solution of LPP belongs to |
Directions: (16 - 20) |
Suppose a dealer in rural areas wishes to purpose a number of sewing machines. He has only Rs 5760 to invest and has space for at most 20 items for storage. |
An electronic sewing machine costs him Rs 360 and a manually operated sweing mechine Rs 240. He can sell an electronic sewing machine at a profit of Rs 22 and a mutually operated sewing machine at a profit of Rs 18. |
Based on the above information, answer the following questions : |
Let the constraints in the given problem is represented by the following inequalities: |
\[x\text{ }+\text{ }y\text{ }\le 20\] |
\[360x+240y\le 5760\] |
\[x,y\ge 0\] |
Then which of the following point lie in its feasible region? |
Suppose the following shaded region APDO, represent the feasible region corresponding to mathematical formulation of given problem. |
Then which of the following represent the coordinates of one of its corner points ? |
Directions: (21 - 25) |
Let R be the feasible region (convex polygon) for a linear programming problem and let \[Z=ax+by\] be objective function. When Z has an optimal value (Maximum or minimum), where the variables x and y are subject to constraints described by linear inequalities, this optimal value must occur at a corner point (vertex) of the feasible region. |
Based on the above information, answer the following questions: |
The feasible region for a LPP is shown in the figure. Let \[Z=3x-4y\] be the objective function Minimum of Z occur at |
The feasible region for a LPP is shown shaded in the figure. Let \[F=3x-4y\] be the objective function. |
Maximum value of F is |
You need to login to perform this action.
You will be redirected in
3 sec