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

Solve the following problem : A person makes two types of gift items A and B requiring the services of a cutter and a finisher. Gift item A requires 4 hours of cutter's time and 2 hours of finisher' - Mathematics and Statistics

Advertisements
Advertisements

प्रश्न

Solve the following problem :

A person makes two types of gift items A and B requiring the services of a cutter and a finisher. Gift item A requires 4 hours of cutter's time and 2 hours of finisher's time. B requires 2 hours of cutters time, 4 hours of finishers time. The cutter and finisher have 208 hours and 152 hours available times respectively every month. The profit of one gift item of type A is ₹ 75 and on gift item B is ₹ 125. Assuming that the person can sell all the items produced, determine how many gift items of each type should be make every month to obtain the best returns?

आलेख
बेरीज
Advertisements

उत्तर

Let x gift items of type A and y gift items of type B be produced by the person.
∴ Total profit Z = 75x + 125y
This is the objective function to be maximized.
The given information can be tabulated as shown below:

  Type A (x) Type B (y) Total time available (in hours)
Cutter 4 2 208
Finisher 2 4 152

∴ The constraints are 4x + 2y ≤ 208, 2x + 4y ≤ 152, x ≥ 0, y ≥ 0
∴ Given problem can be formulated as
Maximize Z = 75x + 125y
Subject to, 4x + 2y ≤ 208, 2x + 4y ≤ 152, x ≥ 0, y ≥ 0
To draw feasible region, construct table as follows:

Inequality 4x + 2y ≤ 208 2x + 4y ≤ 152
Corresponding equation (of line) 4x + 2y = 208 2x + 4y = 152
Intersection of line with X-axis (52, 0) (76, 0)
Intersection of line with Y-axis (0, 104) (0, 38)
Region Origin side Origin side

Shaded portion OABC is the feasible region,
whose vertices are O ≡ (0, 0),
A ≡ (52, 0), B and C ≡ (0, 38).
B is the point of intersection of the lines 4x + 2y = 208 i.e. 2x + y = 104 and 2x + 4y = 152

Solving the above equations, we get B ≡ (44, 16)
Here, the objective function is Z = 75x + 125y
∴ Z at O(0, 0) = 75(0) + 125(0) = 0
Z at A(52, 0) = 75(52) + 125(0) = 3900
Z at B(44, 16) = 75(44) + 125(16) = 5300
Z at C(0, 38) = 75(0) + 125(38) = 4750
∴ Z has maximum value 5300 at B(44, 16)
∴ Z is maximum, when x = 44, y = 16
Thus, a person should make 44 gift items of type A and 16 gift items of type B every month to obtain the best returns of ₹ 5300.

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

APPEARS IN

बालभारती Mathematics and Statistics 2 (Commerce) [English] Standard 12 Maharashtra State Board
पाठ 6 Linear Programming
Miscellaneous Exercise 6 | Q 4.13 | पृष्ठ १०५

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

The postmaster of a local post office wishes to hire extra helpers during the Deepawali season, because of a large increase in the volume of mail handling and delivery. Because of the limited office space and the budgetary conditions, the number of temporary helpers must not exceed 10. According to past experience, a man can handle 300 letters and 80 packages per day, on the average, and a woman can handle 400 letters and 50 packets per day. The postmaster believes that the daily volume of extra mail and packages will be no less than 3400 and 680 respectively. A man receives Rs 225 a day and a woman receives Rs 200 a day. How many men and women helpers should be hired to keep the pay-roll at a minimum ? Formulate an LPP and solve it graphically.


A company produces two types of goods A and B, that require gold and silver. Each unit of type A requires 3 g of silver and 1 g of golds while that of type B requires 1 g of silver and 2 g of gold. The company can procure a maximum of 9 g of silver and 8 g of gold. If each unit of type A brings a profit of Rs 40 and that of type B Rs 50, formulate LPP to maximize profit.


A farmer has a 100 acre farm. He can sell the tomatoes, lettuce, or radishes he can raise. The price he can obtain is Rs 1 per kilogram for tomatoes, Rs 0.75 a head for lettuce and Rs 2 per kilogram for radishes. The average yield per acre is 2000 kgs for radishes, 3000 heads of lettuce and 1000 kilograms of radishes. Fertilizer is available at Rs 0.50 per kg and the amount required per acre is 100 kgs each for tomatoes and lettuce and 50 kilograms for radishes. Labour required for sowing, cultivating and harvesting per acre is 5 man-days for tomatoes and radishes and 6 man-days for lettuce. A total of 400 man-days of labour are available at Rs 20 per man-day. Formulate this problem as a LPP to maximize the farmer's total profit.


Solve the following L.P.P. by graphical method :

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


Solve the following L.P.P. by graphical method :

Minimize : Z = 7x + y subject to 5x + y ≥ 5, x + y ≥ 3, x ≥ 0, y ≥ 0.


Solve the following L.P.P. by graphical method:

Minimize: Z = 6x + 2y subject to x + 2y ≥ 3, x + 4y ≥ 4, 3x + y ≥ 3, x ≥ 0, y ≥ 0.


Choose the correct alternative :

The maximum value of z = 5x + 3y. subject to the constraints


The region represented by the inequalities x ≥ 0, y ≥ 0 lies in first quadrant.


State whether the following is True or False :

The region represented by the inqualities x ≤ 0, y ≤ 0 lies in first quadrant.


Solve the following problem :

Minimize Z = 4x + 2y Subject to 3x + y ≥ 27, x + y ≥ 21, x ≥ 0, y ≥ 0


Solve the following problem :

Minimize Z = 2x + 3y Subject to x – y ≤ 1, x + y ≥ 3, x ≥ 0, y ≥ 0


Maximize Z = 60x + 50y Subject to x + 2y ≤ 40, 3x + 2y ≤ 60, x ≥ 0, y ≥ 0


Solve the following problem :

A company manufactures bicyles and tricycles, each of which must be processed through two machines A and B Maximum availability of machine A and B is respectively 120 and 180 hours. Manufacturing a bicycle requires 6 hours on machine A and 3 hours on machine B. Manufacturing a tricycle requires 4 hours on machine A and 10 hours on machine B. If profits are ₹ 180 for a bicycle and ₹ 220 on a tricycle, determine the number of bicycles and tricycles that should be manufacturing in order to maximize the profit.


Solve the following problem :

A Company produces mixers and processors Profit on selling one mixer and one food processor is ₹ 2000 and ₹ 3000 respectively. Both the products are processed through three machines A, B, C The time required in hours by each product and total time available in hours per week on each machine are as follows:

Machine/Product Mixer per unit Food processor per unit Available time
A 3 3 36
B 5 2 50
C 2 6 60

How many mixers and food processors should be produced to maximize the profit?


Solve the following problem :

A firm manufacturing two types of electrical items A and B, can make a profit of ₹ 20 per unit of A and ₹ 30 per unit of B. Both A and B make use of two essential components, a motor and a transformer. Each unit of A requires 3 motors and 2 transformers and each unit of B requires 2 motors and 4 transformers. The total supply of components per month is restricted to 210 motors and 300 transformers. How many units of A and B should be manufacture per month to maximize profit? How much is the maximum profit?


Choose the correct alternative:

The corner points of the feasible region are (0, 3), (3, 0), (8, 0), `(12/5, 38/5)` and (0, 10), then the point of maximum Z = 6x + 4y = 48 is at


Choose the correct alternative:

The corner points of the feasible region are (4, 2), (5, 0), (4, 1) and (6, 0), then the point of minimum Z = 3.5x + 2y = 16 is at


State whether the following statement is True or False:

The maximum value of Z = 5x + 3y subjected to constraints 3x + y ≤ 12, 2x + 3y ≤ 18, 0 ≤ x, y is 20


State whether the following statement is True or False:

A convex set includes the points but not the segment joining the points


State whether the following statement is True or False:

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


State whether the following statement is True or False:

The graphical solution set of the inequations 0 ≤ y, x ≥ 0 lies in second quadrant


A company manufactures 2 types of goods P and Q that requires copper and brass. Each unit of type P requires 2 grams of brass and 1 gram of copper while one unit of type Q requires 1 gram of brass and 2 grams of copper. The company has only 90 grams of brass and 80 grams of copper. Each unit of types P and Q brings profit of ₹ 400 and ₹ 500 respectively. Find the number of units of each type the company should produce to maximize its profit


Smita is a diet conscious house wife, wishes to ensure certain minimum intake of vitamins A, B and C for the family. The minimum daily needs of vitamins A, B, and C for the family are 30, 20, and 16 units respectively. For the supply of the minimum vitamin requirements Smita relies on 2 types of foods F1 and F2. F1 provides 7, 5 and 2 units of A, B, C vitamins per 10 grams and F2 provides 2, 4 and 8 units of A, B and C vitamins per 10 grams. F1 costs ₹ 3 and F2 costs ₹ 2 per 10 grams. How many grams of each F1 and F2 should buy every day to keep her food bill minimum


Amartya wants to invest ₹ 45,000 in Indira Vikas Patra (IVP) and in Public Provident fund (PPF). He wants to invest at least ₹ 10,000 in PPF and at least ₹ 5000 in IVP. If the rate of interest on PPF is 8% per annum and that on IVP is 7% per annum. Formulate the above problem as LPP to determine maximum yearly income.

Solution: Let x be the amount (in ₹) invested in IVP and y be the amount (in ₹) invested in PPF.

x ≥ 0, y ≥ 0

As per the given condition, x + y ______ 45000

He wants to invest at least ₹ 10,000 in PPF.

∴ y ______ 10000

Amartya wants to invest at least ₹ 5000 in IVP.

∴ x ______ 5000

Total interest (Z) = ______

The formulated LPP is

Maximize Z = ______ subject to 

______


Solve the following LPP graphically:

Maximize Z = 9x + 13y subject to constraints

2x + 3y ≤ 18, 2x + y ≤ 10, x ≥ 0, y ≥ 0

Solution: Convert the constraints into equations and find the intercept made by each one of it.

Inequation Equation X intercept Y intercept Region
2x + 3y ≤ 18 2x + 3y = 18 (9, 0) (0, ___) Towards origin
2x + y ≤ 10 2x + y = 10 ( ___, 0) (0, 10) Towards origin
x ≥ 0, y ≥ 0 x = 0, y = 0 X axis Y axis ______

The feasible region is OAPC, where O(0, 0), A(0, 6),

P( ___, ___ ), C(5, 0)

The optimal solution is in the following table:

Point Coordinates Z = 9x + 13y Values Remark
O (0, 0) 9(0) + 13(0) 0  
A (0, 6) 9(0) + 13(6) ______  
P ( ___,___ ) 9( ___ ) + 13( ___ ) ______ ______
C (5, 0) 9(5) + 13(0) ______  

∴ Z is maximum at __( ___, ___ ) with the value ___.


A linear function z = ax + by, where a and b are constants, which has to be maximised or minimised according to a set of given condition is called a:-


Maximised value of z in z = 3x + 4y, subject to constraints : x + y ≤ 4, x ≥ 0. y ≥ 0


If z = 200x + 500y  .....(i)

Subject to the constraints:

x + 2y ≥ 10  .......(ii)

3x + 4y ≤ 24  ......(iii)

x, 0, y ≥ 0  ......(iv)

At which point minimum value of Z is attained.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×