English

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

Advertisements
Advertisements

Question

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

Options

  • (0, 2) only

  • (3, 0) only

  • The midpoint of the line segment joining the points (0, 2) and (3, 0) only

  • Any point on the line segment joining the points (0, 2) and (3, 0).

MCQ
Fill in the Blanks
Advertisements

Solution

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 any point on the line segment joining the points (0, 2) and (3, 0).

Explanation:

Corner points Value of F = 4x + 6y  
(0, 2) Z = 4(0) + 6(2) = 12 ← Minimum
(3, 0) Z = 4(3) + 6(0) = 12 ← Minimum
(6, 0) Z = 4(6) + 6(0) = 24  
(6, 8) Z = 4(6) + 6(8) = 72 ← Maximum
(0, 5) Z = 4(0) + 6(5) = 30  

The minimum value of F occurs at any point on the line segment joining the points (0, 2) and (3, 0).

shaalaa.com
  Is there an error in this question or solution?
Chapter 12: Linear Programming - Exercise [Page 256]

APPEARS IN

NCERT Exemplar Mathematics Exemplar [English] Class 12
Chapter 12 Linear Programming
Exercise | Q 32 | Page 256

RELATED QUESTIONS

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


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?


If the feasible region for a linear programming problem is bounded, then the objective function Z = ax + by has both a maximum and a minimum value on R.


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


Determine the maximum value of Z = 3x + 4y if the feasible region (shaded) for a LPP is shown in Figure


The feasible region for a LPP is shown in Figure. Find the minimum value of Z = 11x + 7y


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


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.


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.


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 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 32, Maximum of F – Minimum of F = ______.


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?


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:


The maximum value of the object function Z = 5x + 10 y subject to the constraints x + 2y ≤ 120, x + y ≥ 60, x - 2y ≥ 0, x ≥ 0, y ≥ 0 is ____________.


A maximum or a minimum may not exist for a linear programming problem if ____________.


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.


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 = 4x + 6y, subject to 3x + 2y ≤ 12, x + y ≥ 4, x, y ≥ 0.


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


Z = 6x + 21 y, subject to x + 2y ≥ 3, x + 4y ≥ 4, 3x + y ≥ 3, x ≥ 0, y ≥ 0. The minimum value of Z occurs at ____________.


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×