हिंदी

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

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.

योग

उत्तर

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 [English] Class 12
अध्याय 12 Linear Programming
Exercise 12.1 | Q 9 | पृष्ठ ५१४

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

Two tailors, A and B, earn Rs 300 and Rs 400 per day respectively. A can stitch 6 shirts and 4 pairs of trousers while B can stitch 10 shirts and 4 pairs of trousers per day. To find how many days should each of them work and if it is desired to produce at least 60 shirts and 32 pairs of trousers at a minimum labour cost, formulate this as an LPP


Solve the following Linear Programming Problems graphically:

Maximise Z = 5x + 3y

subject to 3x + 5y ≤ 15, 5x + 2y ≤ 10, 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:

Minimise Z = x + 2y

subject to 2x + y ≥ 3, x + 2y ≥ 6, x, y ≥ 0.


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

Maximise Z = x + y, subject to x – y ≤ –1, –x + y ≤ 0, x, y ≥ 0.


A farmer mixes two brands P and Q of cattle feed. Brand P, costing Rs 250 per bag contains 3 units of nutritional element A, 2.5 units of element B and 2 units of element C. Brand Q costing Rs 200 per bag contains 1.5 units of nutritional elements A, 11.25 units of element B, and 3 units of element C. The minimum requirements of nutrients A, B and C are 18 units, 45 units and 24 units respectively. Determine the number of bags of each brand which should be mixed in order to produce a mixture having a minimum cost per bag? What is the minimum cost of the mixture per bag?


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?

 


To maintain his health a person must fulfil certain minimum daily requirements for several kinds of nutrients. Assuming that there are only three kinds of nutrients-calcium, protein and calories and the person's diet consists of only two food items, I and II, whose price and nutrient contents are shown in the table below:
 

  Food I
(per lb)
  Food II
(per lb)
    Minimum daily requirement
for the nutrient
 Calcium 10   5     20
Protein 5   4     20
 Calories 2   6     13
 Price (Rs) 60   100      


What combination of two food items will satisfy the daily requirement and entail the least cost? Formulate this as a LPP.


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


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.


A man rides his motorcycle at the speed of 50 km/hour. He has to spend Rs 2 per km on petrol. If he rides it at a faster speed of 80 km/hour, the petrol cost increases to Rs 3 per km. He has atmost Rs 120 to spend on petrol and one hour’s time. He wishes to find the maximum distance that he can travel. Express this problem as a linear programming problem


Refer to quastion 12. What will be the minimum cost?


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

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


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


Refer to Question 32, Maximum of F – Minimum of F = ______.


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 corner point of a feasible region is a point in the region which is the ______ of two boundary lines.


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


Based on the given shaded region as the feasible region in the graph, at which point(s) is the objective function Z = 3x + 9y maximum?


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:


A linear programming problem is one that is concerned with ____________.


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


If two corner points of the feasible region are both optimal solutions of the same type, i.e., both produce the same maximum or minimum.


In a LPP, the objective function is always ____________.


Maximize Z = 3x + 5y, subject to x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0.


Maximize Z = 7x + 11y, subject to 3x + 5y ≤ 26, 5x + 3y ≤ 30, x ≥ 0, y ≥ 0.


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


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×