हिंदी

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

Advertisements
Advertisements

प्रश्न

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?

 

Advertisements

उत्तर

Let the mixture contain x kg of food X and y kg of food Y.

The mathematical formulation of the given problem is as follows.

Minimize z = 16x + 20y … (1)

subject to the constraints,

The feasible region determined by the system of constraints is as follows.

The corner points of the feasible region are A (10, 0), B (2, 4), C (1, 5), and D (0, 8).

The values of z at these corner points are as follows.

Corner point z = 16x + 20  
A (10, 0) 160  
B (2, 4) 112 → Minimum
C (1, 5) 116  
D (0, 8) 160  

As the feasible region is unbounded, therefore, 112 may or may not be the minimum value of z.

For this, we draw a graph of the inequality, 16x + 20y < 112 or 4x + 5y < 28, and check whether the resulting half plane has points in common with the feasible region or not.

It can be seen that the feasible region has no common point with 4x + 5y < 28

Therefore, the minimum value of z is 112 at (2, 4).

Thus, the mixture should contain 2 kg of food X and 4 kg of food Y. The minimum cost of the mixture is Rs 112

 

shaalaa.com
  क्या इस प्रश्न या उत्तर में कोई त्रुटि है?
अध्याय 12: Linear Programming - Exercise 12.3 [पृष्ठ ५२६]

APPEARS IN

एनसीईआरटी Mathematics Part 1 and 2 [English] Class 12
अध्याय 12 Linear Programming
Exercise 12.3 | Q 3 | पृष्ठ ५२६

वीडियो ट्यूटोरियल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:

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.


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.


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?


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


Maximise Z = 3x + 4y, subject to the constraints: x + y ≤ 1, x ≥ 0, y ≥ 0


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. Evaluate Z = 4x + y at each of the corner points of this region. Find the minimum value of Z, if it exists.


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


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 27. Maximum of Z occurs at ______.


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


In a LPP, the linear inequalities or restrictions on the variables are called ____________.


A feasible region of a system of linear inequalities is said to be ______ if it can be enclosed within a circle.


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


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


Z = 7x + y, subject to 5x + y ≥ 5, x + y ≥ 3, x ≥ 0, y ≥ 0. The minimum value of Z occurs at ____________.


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


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


Which statement best describes a Linear Programming Problem (LPP)?


Which expression has the general form of an objective function with constants \(a\) and \(b\)?


What are constraints in a Linear Programming Problem?


Which inequality is one of the given resource constraints in the formulation with objective function \[Z=250x+75y\]?


Which other constraint must be satisfied together with \[5x+y\leq 100\] in the profit-maximization formulation?


Which set gives the complete non-negative restrictions for the profit-maximization formulation?


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×