हिंदी

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 = 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:

Maximise Z = 3x + 2y

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

Minimise and Maximise Z = x + 2y 

subject to x + 2y ≥ 100, 2x – y ≤ 0, 2x + y ≤ 200; x, y ≥ 0.


Refer to Example 9. How many packets of each food should be used to maximize the amount of vitamin A in the diet? What is the maximum amount of vitamin A in the diet?


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?

 


An aeroplane can carry a maximum of 200 passengers. A profit of Rs 1000 is made on each executive class ticket and a profit of Rs 600 is made on each economy class ticket. The airline reserves at least 20 seats for executive class. However, at least 4 times as many passengers prefer to travel by economy class than by the executive class. Determine how many tickets of each type must be sold in order to maximize the profit for the airline. What is the maximum profit?


The minimum value of the objective function Z = ax + by in a linear programming problem always occurs at only one corner point of the feasible region


Determine the maximum value of Z = 11x + 7y subject to the constraints : 2x + y ≤ 6, x ≤ 2, x ≥ 0, y ≥ 0.


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 13. Solve the linear programming problem and determine the maximum profit to the manufacturer


Refer to question 15. Determine the maximum distance that the man can travel.


Refer to question 15. Determine the maximum distance that the man can travel.


Maximise Z = x + y subject to x + 4y ≤ 8, 2x + 3y ≤ 12, 3x + y ≤ 9, x ≥ 0, y ≥ 0.


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


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


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?


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:


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 a LPP, the objective function is always ____________.


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


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


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


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×