मराठी

Show that the minimum of Z occurs at more than two points. Maximise Z = – x + 2y, Subject to the constraints: x ≥ 3, x + y ≥ 5, x + 2y ≥ 6, y ≥ 0.

Advertisements
Advertisements

प्रश्न

Show that the minimum of Z occurs at more than two points.

Maximise Z = – x + 2y, Subject to the constraints:

x ≥ 3, x + y ≥ 5, x + 2y ≥ 6, y ≥ 0.

बेरीज
Advertisements

उत्तर

The system of constraints is:

x ≥ 3                    ...(i)

x + y ≥ 5            ...(ii)

x + 2y ≥ 6        ...(iii)

and y ≥ 0          ...(iv)

Let l1 : x = 3

l2 : x + y = 5

l3 : x + 2y = 6

l4 : y = 0

The shaded region in the figure is the feasible region determined by the system of constraints (i) to (iv).

The corner points are C(6, 0), E(4, 1) and F(3, 2).

Applying the Corner Point Method, we have

Corner Point Corresponding values of Z
(6, 0) -6
(4, 1) -2
(3, 2) 1

It appears that Zmax = 1 at (3, 2).

But the feasible region is unbounded, therefore, we draw the graph of the inequality -x + 2y > 1.

Since the half-plane represented by - x + 2y > 1 has points common with the feasible region.

∴ Zmax ≠ 1.

Hence, Z has no maximum value.

shaalaa.com
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
पाठ 12: Linear Programming - Exercise 12.1 [पृष्ठ ५१४]

APPEARS IN

एनसीईआरटी Mathematics Part 1 and 2 [English] Class 12
पाठ 12 Linear Programming
Exercise 12.1 | Q 9 | पृष्ठ ५१४

व्हिडिओ ट्यूटोरियलVIEW ALL [2]

संबंधित प्रश्‍न

Solve the following Linear Programming Problems graphically:

Maximise Z = 3x + 4y

subject to the constraints : x + y ≤ 4, x ≥ 0, y ≥ 0.


Solve the following Linear Programming Problems graphically:

Minimise Z = – 3x + 4 y

subject to x + 2y ≤ 8, 3x + 2y ≤ 12, x ≥ 0, y ≥ 0.


Solve the following Linear Programming Problems graphically:

Minimise Z = 3x + 5y

such that x + 3y ≥ 3, x + y ≥ 2, x, y ≥ 0.


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 = 5x + 10 y

subject to x + 2y ≤ 120, x + y ≥ 60, x – 2y ≥ 0, x, y ≥ 0.


A dietician wishes to mix together two kinds of food X and Y in such a way that the mixture contains at least 10 units of vitamin A, 12 units of vitamin B and 8 units of vitamin C. The vitamin content of one kg food is given below:

Food Vitamin A Vitamin B Vitamin C
X 1 2 3
Y 2 2 1

One kg of food X costs Rs 16 and one kg of food Y costs Rs 20. Find the least cost of the mixture which will produce the required diet?

 


Maximise the function Z = 11x + 7y, subject to the constraints: x ≤ 3, y ≤ 2, 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.


Refer to Exercise 7 above. Find the maximum value of Z.


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


In figure, the feasible region (shaded) for a LPP is shown. Determine the maximum and minimum value of Z = x + 2y.


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.


A manufacturer produces two Models of bikes-Model X and Model Y. Model X takes a 6 man-hours to make per unit, while Model Y takes 10 man-hours per unit. There is a total of 450 man-hour available per week. Handling and Marketing costs are Rs 2000 and Rs 1000 per unit for Models X and Y respectively. The total funds available for these purposes are Rs 80,000 per week. Profits per unit for Models X and Y are Rs 1000 and Rs 500, respectively. How many bikes of each model should the manufacturer produce so as to yield a maximum profit? Find the maximum profit.


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

Refer to Question 27. Maximum of Z occurs at ______.


Refer to Question 27. (Maximum value of Z + Minimum value of Z) is equal to ______.


Refer to Question 30. Minimum value of F is ______.


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


In a LPP if the objective function Z = ax + by has the same maximum value on two corner points of the feasible region, then every point on the line segment joining these two points give the same ______ value.


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.


The feasible region for an LPP is always a ______ polygon.


In a LPP, the maximum value of the objective function Z = ax + by is always finite.


For an objective function Z = ax + by, where a, b > 0; the corner points of the feasible region determined by a set of constraints (linear inequalities) are (0, 20), (10, 10), (30, 30) and (0, 40). The condition on a and b such that the maximum Z occurs at both the points (30, 30) and (0, 40) is:


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:


In linear programming infeasible solutions


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. If M and m respectively be the largest and smallest values at corner points then ____________.


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 the feasible region is unbounded, m is the minimum value of the objective function.


Maximize Z = 4x + 6y, subject to 3x + 2y ≤ 12, x + y ≥ 4, x, y ≥ 0.


Maximize Z = 10 x1 + 25 x2, subject to 0 ≤ x1 ≤ 3, 0 ≤ x2 ≤ 3, x1 + x2 ≤ 5.


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


The feasible region for an LPP is shown shaded in the following figure. Minimum of Z = 4x + 3y occurs at the point.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×