Advertisements
Advertisements
Question
In a LPP, the objective function is always ______.
Solution
In a LPP, the objective function is always linear.
APPEARS IN
RELATED QUESTIONS
Solve the following Linear Programming Problems graphically:
Maximise Z = 3x + 2y
subject to x + 2y ≤ 10, 3x + y ≤ 15, x, y ≥ 0.
Show that the minimum of Z occurs at more than two points.
Minimise and Maximise Z = x + 2y
subject to x + 2y ≥ 100, 2x – y ≤ 0, 2x + y ≤ 200; x, y ≥ 0.
Maximise Z = 3x + 4y, subject to the constraints: x + y ≤ 1, x ≥ 0, y ≥ 0
Minimise Z = 13x – 15y subject to the constraints: x + y ≤ 7, 2x – 3y + 6 ≥ 0, x ≥ 0, y ≥ 0
Feasible region (shaded) for a LPP is shown in Figure. Maximise Z = 5x + 7y.
The feasible region for a LPP is shown in Figure. Find the minimum value of Z = 11x + 7y
Refer to Exercise 7 above. Find the maximum value of Z.
Refer to quastion 12. What will be the minimum cost?
Refer to question 13. Solve the linear programming problem and determine the maximum profit to the manufacturer
Refer to question 14. How many sweaters of each type should the company make in a day to get a maximum profit? What is the maximum profit.
Refer to question 15. Determine the maximum distance that the man can travel.
In order to supplement daily diet, a person wishes to take some X and some wishes Y tablets. The contents of iron, calcium and vitamins in X and Y (in milligrams per tablet) are given as below:
| Tablets | Iron | Calcium | Vitamin |
| X | 6 | 3 | 2 |
| Y | 2 | 3 | 4 |
The person needs atleast 18 milligrams of iron, 21 milligrams of calcium and 16 milligrams of vitamin. The price of each tablet of X and Y is Rs 2 and Rs 1 respectively. How many tablets of each should the person take in order to satisfy the above requirement at the minimum cost?
The feasible region for an LPP is shown in the figure. Let F = 3x – 4y be the objective function. Maximum value of F is ______.
Refer to Question 30. Minimum value of F is ______.
Refer to Question 32, Maximum of F – Minimum of F = ______.
A feasible region of a system of linear inequalities is said to be ______ if it can be enclosed within a circle.
A corner point of a feasible region is a point in the region which is the ______ of two boundary lines.
If the feasible region for a LPP is unbounded, maximum or minimum of the objective function Z = ax + by may or may not exist.
Maximum value of the objective function Z = ax + by in a LPP always occurs at only one corner point of the feasible region.
In a LPP, the minimum value of the objective function Z = ax + by is always 0 if the origin is one of the corner point of the feasible region.
In the given graph, the feasible region for an LPP is shaded. The objective function Z = 2x – 3y will be minimum at:
A linear programming problem is as follows:
Minimize Z = 30x + 50y
Subject to the constraints: 3x + 5y ≥ 15, 2x + 3y ≤ 18, x ≥ 0, y ≥ 0
In the feasible region, the minimum value of Z occurs at:
In a linear programming problem, the constraints on the decision variables x and y are x − 3y ≥ 0, y ≥ 0, 0 ≤ x ≤ 3. The feasible region:
Objective function of a linear programming problem is ____________.
In Corner point method for solving a linear programming problem, one finds the feasible region of the linear programming problem, determines its corner points, and evaluates the objective function Z = ax + by at each corner point. Let M and m respectively be the largest and smallest values at corner points. In case feasible region is unbounded, M is the maximum value of the objective function if ____________.
The feasible region for an LPP is shown shaded in the figure. Let Z = 3x - 4y be the objective function. Minimum of Z occurs at ____________.
