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

A company manufactures two types of chemicals A and B. Each chemical requires two types of raw material P and Q. The table below shows number of units of P and Q required to manufacture one unit of A - Mathematics and Statistics

Advertisements
Advertisements

प्रश्न

A company manufactures two types of chemicals A and B. Each chemical requires two types of raw material P and Q. The table below shows number of units of P and Q required to manufacture one unit of A and one unit of B.

Raw Material \Chemical A B Availability
p 3 2 120
Q 2 5 160

The company gets profits of ₹ 350 and ₹ 400 by selling one unit of A and one unit of B respectively. Formulate the problem as L.P.P. to maximize the profit.

बेरीज
Advertisements

उत्तर

Let x units of chemical A and y units of chemical B are manufactured by the company.
Here, (3x + 2y) units of material P and (2x + 5y) units of material Q is required and 120 units of material P and 160 units of material Q are available.
∴ The constraints are :
3x + 2y ≤ 120,
2x + 5y ≤ 160
Since x and y cannot be negative, we have x ≥ 0, y ≥ 0
Now, Profit on one unit of chemical A is ₹ 350.
∴ Profit on x units of chemical A is 350x.
Profit on one unit of chemical B is ₹ 400.
∴ Profit on y units of chemical B is 400y.
∴ Total Profit, Z = 350x + 400y
This is the objective function to be maximized.
∴ Given problem can be formulated as,
Maximize Z = 350x + 400y
Subject to 3x + 2y ≤ 120, 2x + 5y ≤ 160, x ≥ 0, y ≥ 0.

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

APPEARS IN

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

Which of the following statements is correct?


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

Fodder → Fodder 1 Fodder 2
Nutrient ↓
Nutrients A 2 1
Nutrients B 2 3
Nutrients C 1 1

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


If John drives a car at a speed of 60 km/hour, he has to spend ₹ 5 per km on petrol. If he drives at a faster speed of 90 km/hour, the cost of petrol increases ₹ 8 per km. He has ₹ 600 to spend on petrol and wishes to travel the maximum distance within an hour. Formulate the above problem as L.P.P.


The point of which the maximum value of x + y subject to the constraints x + 2y ≤  70, 2x + y ≤ 95, x, ≥ 0, y ≥ 0 is is obtained at ______.


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


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


Solve the following LPP:

Maximize z = 6x + 10y subject to 3x + 5y ≤ 10, 5x + 3y ≤ 15, x ≥ 0, y ≥ 0.


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

4x - 18 ≥ 0


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

5y - 12 ≥ 0


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

y ≤ - 3.5


Solve the following LPP:

Maximize z =60x + 50y  subject to

x + 2y ≤ 40, 3x + 2y ≤ 60, x ≥ 0, y ≥ 0.


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

Gadgets Foundry  Machine Shop
A 10 5
B 6 4
Time available (hours) 60 35

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


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.


Choose the correct alternative :

Of all the points of the feasible region the optimal value of z is obtained at a point


Maximize z = 5x + 2y subject to 3x + 5y ≤ 15, 5x + 2y ≤ 10, x ≥ 0, y ≥ 0


Maximize z = 10x + 25y subject to x + y ≤ 5, 0 ≤ x ≤ 3, 0 ≤ y ≤ 3


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?


The variables involved in LPP are called ______


A company produces two types of products say type A and B. Profits on the two types of product are ₹ 30/- and ₹ 40/- per kg respectively. The data on resources required and availability of resources are given below.

  Requirements Capacity available per month
Product A Product B
Raw material (kgs) 60 120 12000
Machining hours/piece 8 5 600
Assembling (man hours) 3 4 500

Formulate this problem as a linear programming problem to maximize the profit.


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.


Maximize: z = 3x1 + 4x2 subject to 2x1 + x2 ≤ 40, 2x1 + 5x2 ≤ 180, x1, x2 ≥ 0. In the LPP, which one of the following is feasible comer point?


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 maximum value of Z = 3x + 5y, subject to 3x + 2y ≤ 18, x ≤ a, y ≤ 6, x, y ≥ 0 is ______.


The LPP to maximize Z = x + y, subject to x + y ≤ 1, 2x + 2y ≥ 6, x ≥ 0, y ≥ 0 has ________.


The values of θ satisfying sin7θ = sin4θ - sinθ and 0 < θ < `pi/2` are ______


The point which provides the solution of the linear programming problem, Max.(45x + 55y) subject to constraints x, y ≥ 0, 6x + 4y ≤ 120, 3x + 10y ≤ 180, is ______ 


Solution which satisfy all constraints is called ______ solution.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×