मराठी
महाराष्ट्र राज्य शिक्षण मंडळएचएससी वाणिज्य (इंग्रजी माध्यम) इयत्ता १२ वी

In a cattle breeding firm, it is prescribed that the food ration for one animal must contain 14, 22 and 1 unit of nutrients A, B and C respectively. Two different kinds of fodder are available. Each - Mathematics and Statistics

Advertisements
Advertisements

प्रश्न

In a cattle breeding firm, it is prescribed that the food ration for one animal must contain 14, 22, and 1 unit of nutrients A, B, and C respectively. Two different kinds of fodder are available. Each unit weight of these two contains the following amounts of these three nutrients:

Nutrient\Fodder Fodder 1 Fodder2
Nutrient A 2 1
Nutrient B 2 3
Nutrient C 1 1

The cost of fodder 1 is ₹ 3 per unit and that of fodder ₹ 2 per unit. Formulate the L.P.P. to minimize the cost.

तक्ता
बेरीज
Advertisements

उत्तर

Let x units of fodder 1 and y units of fodder 2 be included in the food ration of an animal.

The cost of fodder 1 is ₹ 3 per unit and that of fodder 2 is ₹ 2 per unit.

∴ Total cost = ₹ (3x + 2y)

The minimum requirement of nutrients A, B, C for an animal are 14, 22 and 1 unit respectively.

We construct the given table with the minimum requirement column as follows:

Nutrient\Fodder Fodder 1
(x)
Fodder 2
(y)
Minimum requirement
Nutrient A 2 1 14
Nutrient B 2 3 22
Nutrient C 1 1 1

From the table, the food ration of an animal must contain (2x + y) units of nutrient A, (2x + 3y) units of B and (x + y) units of C.

∴ The constraints are :

2x + y ≥ 14

2x + 3y ≥ 22

x + y ≥ 1

Since x and y cannot be negative, we have x ≥ 0, y ≥ 0

∴ The given problem can be formulated as follows:

Minimize Z = 3x + 2y

Subject to 2x + y ≥ 14,

2x + 3y ≥ 22,

x + y ≥ 1,

x ≥ 0,

y ≥ 0.

shaalaa.com
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
पाठ 6: Linear Programming - Exercise 6.1 [पृष्ठ ९८]

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

Find the feasible solution of the following inequation:

3x + 4y ≥ 12, 4x + 7y ≤ 28, y ≥ 1, x ≥ 0.


Find the feasible solution of the following inequations:

x - 2y ≤ 2, x + y ≥ 3, - 2x + y ≤ 4, x ≥ 0, y ≥ 0


A company produces two types of articles A and B which requires silver and gold. Each unit of A requires 3 gm of silver and 1 gm of gold, while each unit of B requires 2 gm of silver and 2 gm of gold. The company has 6 gm of silver and 4 gm of gold. Construct the inequations and find feasible solution graphically.


A manufacturing firm produces two types of gadgets A and B, which are first processed in the foundry and then sent to the machine shop for finishing. The number of man-hours of labour required in each shop for production of A and B per unit and the number of man-hours available for the firm is as follows:

Gadgets Foundry Machine shop
A 10 5
B 6 4
Time available (hour) 60 35

Profit on the sale of A is ₹ 30 and B is ₹ 20 per units. Formulate the L.P.P. to have maximum profit.


Solve the following LPP by graphical method:

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


The maximum value of z = 10x + 6y subject to the constraints 3x + y ≤ 12, 2x + 5y ≤ 34, x, ≥ 0, y ≥ 0 is ______.


Solution of LPP to minimize z = 2x + 3y, such that x ≥ 0, y ≥ 0, 1 ≤ x + 2y ≤ 10 is ______.


The corner points of the feasible solution are (0, 0), (2, 0), `(12/7, 3/7)`, (0, 1). Then z = 7x + y is maximum at ______.


The half-plane represented by 3x + 2y < 8 contains the point ______.


Solve each of the following inequations graphically using XY-plane:

5y - 12 ≥ 0


A carpenter makes chairs and tables. Profits are ₹ 140 per chair and ₹ 210 per table. Both products are processed on three machines: Assembling, Finishing and Polishing. The time required for each product in hours and availability of each machine is given by the following table:

Product → Chair (x) Table (y) Available time (hours)
Machine ↓
Assembling 3 3 36
Finishing 5 2 50
Polishing 2 6 60

Formulate the above problem as LPP. Solve it graphically


Choose the correct alternative :

The corner points of the feasible region are (0, 0), (2, 0), `(12/7, 3/7)` and (0,1) then the point of maximum z = 7x + y


If the corner points of the feasible region are (0, 0), (3, 0), (2, 1) and `(0, 7/3)` the maximum value of z = 4x + 5y is ______.


The optimal value of the objective function is attained at the ______ points of the feasible region.


State whether the following is True or False :

The point (1, 2) is not a vertex of the feasible region bounded by 2x + 3y ≤ 6, 5x + 3y ≤ 15, x ≥ 0, y ≥ 0.


The feasible region is the set of point which satisfy.


Minimize z = 2x + 4y is subjected to 2x + y ≥ 3, x + 2y ≥ 6, x ≥ 0, y ≥ 0 show that the minimum value of z occurs at more than two points


x − y ≤ 1, x − y ≥ 0, x ≥ 0, y ≥ 0 are the constant for the objective function z = x + y. It is solvable for finding optimum value of z? Justify?


State whether the following statement is True or False:

Objective function of LPP is a relation between the decision variables


A company produces two types of pens A and B. Pen A is of superior quality and pen B is of lower quality. Profits on pens A and B are ₹ 5 and ₹ 3 per pen respectively. Raw materials required for each pen A is twice as that of pen B. The supply of raw material is sufficient only for 1000 pens per day. Pen A requires a special clip and only 400 such clips are available per day. For pen B, only 700 clips are available per day. Formulate this problem as a linear programming problem.


Solve the following linear programming problems by graphical method.

Minimize Z = 3x1 + 2x2 subject to the constraints 5x1 + x2 ≥ 10; x1 + x2 ≥ 6; x1 + 4x2 ≥ 12 and x1, x2 ≥ 0.


Solve the following linear programming problems by graphical method.

Minimize Z = 20x1 + 40x2 subject to the constraints 36x1 + 6x2 ≥ 108; 3x1 + 12x2 ≥ 36; 20x1 + 10x2 ≥ 100 and x1, x2 ≥ 0.


In the given graph the coordinates of M1 are


The maximum value of the objective function Z = 3x + 5y subject to the constraints x ≥ 0, y ≥ 0 and 2x + 5y ≤ 10 is:


Solve the following linear programming problem graphically.

Minimize Z = 200x1 + 500x2 subject to the constraints: x1 + 2x2 ≥ 10; 3x1 + 4x2 ≤ 24 and x1 ≥ 0, x2 ≥ 0.


Solve the following linear programming problem graphically.

Maximize Z = 3x1 + 5x2 subject to the constraints: x1 + x2 ≤ 6, x1 ≤ 4; x2 ≤ 5, and x1, x2 ≥ 0.


Solve the following linear programming problem graphically.

Maximize Z = 60x1 + 15x2 subject to the constraints: x1 + x2 ≤ 50; 3x1 + x2 ≤ 90 and x1, x2 ≥ 0.


The set of feasible solutions of LPP is a ______.


Shamli wants to invest ₹ 50, 000 in saving certificates and PPF. She wants to invest atleast ₹ 15,000 in saving certificates and at least ₹ 20,000 in PPF. The rate of interest on saving certificates is 8% p.a. and that on PPF is 9% p.a. Formulation of the above problem as LPP to determine maximum yearly income, is ______.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×