Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.1

Balbharati Maharashtra State Board 12th Commerce Maths Solution Book Pdf Chapter 7 Assignment Problem and Sequencing Ex 7.1 Questions and Answers.

Maharashtra State Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.1

Question 1.
A job production unit has four jobs A, B, C, D which can be manufactured on each of the four machine P, Q, R and S. The processing cost of each job for each machine is given in the following table:
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.1 Q1
Find the optimal assignment to minimize the total processing cost.
Solution:
The cost matrix is given by
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.1 Q1.1
Subtracting row minimum from all the elements in that row we get
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.1 Q1.2
Subtracting column minimum from all the elements in that column we get the same matrix.
As all the rows and columns have single zeros the allotment can be done as follows.
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.1 Q1.3
As per the table, the job allotments are
P → II, Q → IV, R → I, S → III
The total minimum cost = 25 + 21 + 19 + 34 = ₹ 99

Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.1

Question 2.
Five wagons are available at stations 1, 2, 3, 4, and 5. These are required at 5 stations I, II, III, IV, and V. The mileage between various stations are given in the table below. How should the wagons be transported so as to minimize the mileage covered?
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.1 Q2
Solution:
The mileage matrix is given by
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.1 Q2.1
Subtracting row minimum from all elements in that row we get
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.1 Q2.2
Subtracting column minimum from all elements in that column we get
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.1 Q2.3
Draw minimum lines covering all the zeros
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.1 Q2.4
The number of lines covering all the zeros (3) is less than the order of the matrix (5). Hence an assignment is not possible. The modification is required. The minimum uncovered value 1 is subtracted from uncovered values and added to the values at the intersection. The numbers on the lines remain the same we get
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.1 Q2.5
Drawing a minimum number of lines covering all the zeros.
No. of lines covering all the zeros (4) is less than the order of the matrix (5).
Hence assignment is not possible.
Again modification is required. The minimum uncovered value 3 is subtracted from the uncovered values and added to the values at the intersection.
The numbers on the lines remain the same we get
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.1 Q2.6
No. of lines covering all the zeros (5) are equal to the order of the matrix so the assignment is possible.
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.1 Q2.7
According to the table the assignment is
1 → I, 2 → II, 3 → IV, 4 → II, 5 → V
Total minimum mileage = 10 + 6 + 4 + 9 + 10 = 39 units

Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.1

Question 3.
Five different machines can do any of the five required jobs, with different profits five required jobs, with different profits resulting from each assignment as shown below:
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.1 Q3
Find the optimal assignment schedule.
Solution:
This profit matrix has to be reduced to cost matrix by subtracting all the values of the matrix from the largest value (62) we get
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.1 Q3.2
Subtracting row minimum value from all the elements in that column we get
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.1 Q3.3
Subtracting column minimum from all the elements in that column we get
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.1 Q3.4
Drawing minimum lines covering all zeros we get
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.1 Q3.5
No. of lines (4) is less than the order of the matrix (5). Hence assignment is not possible. The modification is required. The minimum uncovered value (4) is subtracted from the uncovered value and added to the values at the intersection. The values on the lines remain the same, we get
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.1 Q3.6
No. of lines (5) are equal to the order of the matrix (5). So assignments are possible
1 → C, 2 → E, 3 → A, 4 → D, 5 → B
For the minimum profit look at the corresponding in the profit matrix given.
Maximum profit = 40 + 36 + 40 + 36 + 62 = 214 units

Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.1

Question 4.
Four new machines M1, M2, M3, and M4 are to be installed in a machine shop. There are five vacant places A, B, C, D, and E available. Because of limited space, machine M2 cannot be placed at C and M1 cannot be placed at A. The cost matrix is given below.
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.1 Q4
Find the optimal assignment schedule.
Solution:
This is a restricted assignment so we assign a very high cost ‘∞’ to the prohibited all.
Also as it is an unbalanced problem we add a dummy row M5 with all values as ‘0’, we get
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.1 Q4.1
Subtracting row minimum from all the elements in that row, we get
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.1 Q4.2
Subtracting column minimum from all the elements in that column we get the same matrix.
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.1 Q4.3
As minimum no. of lines covering all zeros (5) is equal to the order of the matrix, Assignment is possible
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.1 Q4.4
The assignments are given by
M1 → A, M2 → B, M3 → E, M4 → D, M5 → C
As M5 is dummy no machine is installed at C
For minimum cost taking the corresponding values in the cost matrix we get
Minimum cost = 4 + 4 + 2 + 2 = 12 units

Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.1

Question 5.
A company has a team of four salesmen and there is four districts where the company wants to start its business. After taking into account the capabilities of salesmen and the nature of districts, the company estimates that the profit per day in rupees for each salesman in each district is as below:
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.1 Q5
Find the assignments of a salesman to various districts which will yield maximum profit.
Solution:
The profit matrix has to be reduced to the cost matrix. Subtracting all the values from the maximum value (16) we get
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.1 Q5.1
Subtracting row minimum from all values in that row we get
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.1 Q5.2
Subtracting column minimum from each column we get the same matrix
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.1 Q5.3
As minimum no. of lines covering all zeros (4) is equal to the order of the matrix (4) Assignment is possible
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.1 Q5.4
∴ A → 1, B → 3, C → 2, D → 4
For maximum profit, we take the corresponding values in the profit matrix. We get
Maximum profit = 16 + 15 + 15 + 15 = ₹ 61

Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.1

Question 6.
In the modification of a plant layout of a factory four new machines M1, M2, M3, and M4 are to be installed in a machine shop. There are five vacant places A, B, C, D, and E available. Because of limited space, machine M2 can not be placed at C and M3 can not be placed at A the cost of locating a machine at a place (in hundred rupees) is as follows.
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.1 Q6
Find the optimal assignment schedule.
Solution:
This is an unbalanced problem so we add a dummy row M5 with all values as ‘0’.
Also, this is on restricted assignment problem. So we assign a very high-cost W to the prohibited cells we have
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.1 Q6.1
Subtracting row minimum from all values in that row we get
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.1 Q6.2
Subtracting column minimum from all values in that column we get the same matrix
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.1 Q6.3
As minimum no. of lines covering all zeros (5) is equal to the order of the matrix (5) assignment is possible.
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.1 Q6.4
The assignment is
M1 → A, M2 → B, M3 → E, M4 → D, M5 → C
As M5 is dummy, no machine is installed at C.
The minimum cost is found by taking the corresponding values in the cost matrix
Minimum cost = 9 + 9 + 7 + 7 + 0 = 32 (in hundred ₹)

Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2

Balbharati Maharashtra State Board 12th Commerce Maths Solution Book Pdf Chapter 7 Assignment Problem and Sequencing Ex 7.2 Questions and Answers.

Maharashtra State Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2

Question 1.
A machine operator has to perform two operations, turning and threading on 6 different jobs. The time required to perform these operations (in minutes) for each job is known. Determine the order in which the jobs should be processed in order to minimize the total time required to complete all the jobs. Also, find the total processing time and idle times for turning and threading operations.
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q1
Solution:
Let turning to be A and threading be B.
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q1.1
∴ Observe Min{A, B} = 1 for job 6 on B.
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q1.2
Then the problem reduces to
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q1.3
∴ Now Min {A, B} = 2 for job 4 on A
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q1.4
Then the problem reduce to
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q1.5
Now Min {A, B} = 3 for job 1 on A and job 5 on B
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q1.6
Then the problem reduces to
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q1.7
Now Min {A, B) = 5 for job 3 on A
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q1.8
Only job 2 is left so the optimal sequence is
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q1.9
Worktable is given by
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q1.10
Total elapsed time = 43 minutes
Idle time for A (turning) = 43 – 42 = 1 min
Idle time for B (threshing) = 2 + 4 = 6 min

Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2

Question 2.
A company has three jobs on hand, Each of these must be processed through two departments, in the AB where
Department A: Press shop and
Department B: Finishing
The table below gives the number of days required by each job each department
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q2
Find the sequence in which the three jobs should be processed so as to take minimum time to finish all the three jobs. Also find idle time for both the departments.
Solution:
Observe Min {A, B} = 3 for job II on B.
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q2.1
Then the problem is reduced to
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q2.2
Now Min {A, B} = 4 for job III at B
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q2.3
Now only job I in left
∴ the optimal sequence is given by
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q2.4
The work table is
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q2.5
Total elapsed time = 23 days
Idle time for A = 23 – 19 = 4 days
Idle time for B = 8 days

Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2

Question 3.
An insurance company receives three types of policy application bundles daily from its head office for data entry and filing. The time (in minutes) required for each type for these two operations is given in the following table:
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q3
Find the sequence that minimizes the total time required to complete the entire task. Also, find the total elapsed time and idle times for each operation.
Solution:
Let Data entry be A and filing be B. So
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q3.1
Observe min {A, B} = 90 for policy 1 at A
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q3.2
Then the problem reduces to
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q3.3
Observe min {A, B} = 100 for policy 3 at B
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q3.4
Now only policy 2 is left
∴ The optimal sequence is
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q3.5
Worktable
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q3.6
So Total elapsed time = 490 min
Idle time for A (data entry) = 490 – 390 = 100 min
Idle time for B (filing) = 140 min.

Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2

Question 4.
There are five jobs, each of which must go through two machines in the order XY. Processing times (in hours) are given below. Determine the sequence for the jobs that will minimize the total elapsed time. Also, find the total elapse time and idle time for each machine.
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q4
Solution:
Observe min {x, y} = 2 for job B on x
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q4.1
The problem reduces to
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q4.2
Now min [x, y] = 4 for job A on x
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q4.3
The problem reduces to
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q4.4
Now min [x, y] = 6 for job D on x
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q4.5
The problem reduces to
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q4.7
Now min [x, y] = 8 for job E on y
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q4.6
Now only job C in left
∴ The optimal sequence is
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q4.8
Worktable
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q4.9
Total elapsed time = 60 hrs
Idle time for X = 60 – 56 = 4 hrs
Idle time for Y = 6 hrs

Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2

Question 5.
Find the sequence that minimizes the total elapsed time to complete the following jobs in the order AB. Find the total elapsed time and idle times for both machines.
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q5
Solution:
Observe min {A, B} = 5 for job VI for B and job VII for A
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q5.1
The problem reduces to
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q5.2
Now min {A, B] = 7 for job I on A
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q5.3
The problem reduces to
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q5.4
Now min {A, B] = 10 for job IV on A and B so we have two options.
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q5.5
Or
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q5.6
we take the 1st one.
The problem reduces to
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q5.7
Now min {A, B} = 14 for job V on A and job II and III for job B.
∴ We have
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q5.8
Or
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q5.9
We take the optimal sequence as.
VII – I – IV – V – III – II – VI
Worktable
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q5.10
Total elapsed time = 91 units
Idle time for A = 91 – 86 = 5 units
Idle time for B = 13 units

Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2

Question 6.
Find the optimal sequence that minimizes the total time required to complete the following jobs in the order ABC. The processing times are given in hrs.
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q6
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q6.1
Solution:
(i) Min A = 5, Max B = 5
As min A ≥ max B.
The problem can be converted into two machine problems.
Let G and H be two fictitious machines such that G = A + B and H = B + C we get
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q6.2
Now min {G, H} = 7 for job III & V for G and job I for H
∴ We have two options
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q6.3
Or
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q6.4
We take the first one
The problem reduces to
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q6.5
Min {G, H} = 9 for job IV on H
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q6.6
The problem reduces to
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q6.7
Now min {G, H} = 10 for job II for G and job VII for H
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q6.8
Now job VI is left
∴ The optimal sequence is
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q6.9
The work table is
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q6.10
Total elapsed time = 61 hrs
Idle time for A = 61 – 54 = 7 hrs
Idle time for B = 35 + [61 – 58] = 38 hrs
Idle time for C = 15 hrs

Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2

(ii) Min A = 5, Max B = 5
Min A ≥ Max B.
The problem can be converted into two machine problems.
Let G and H be two fictitious machines such that G = A + B and H = B + C we get
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q6.11
Now min {G, H} = 5 for job 1 for H.
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q6.12
The problem reduces to
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q6.13
Now min {G, H} = 8 for job 2 for G and job H also job 5 for G
∴ We have two options
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q6.14
Or
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q6.15
We take the first one
The problem reduces to
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q6.16
Now min {G, H} = 9 for job 3 for H
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q6.17
Now only job 4 is left
∴ The optimal sequence is
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q6.18
Worktable
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q6.20
Total elapsed time = 40 hrs
Idle time for A = 40 – 32 = 8 hrs
Idle time for B = 19 + [40 – 34] = 25 hrs
Idle time for C = 12 hrs

Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2

Question 7.
A publisher produces 5 books on Mathematics. The books have to go through composing, printing, and binding was done by 3 machines P, Q, E. The time schedule for the entire task in the proper unit is as follows.
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q7
Determine the optimum time required to finish the entire task.
Solution:
Min R = 6, Max Q = 6
As min R ≥ max Q.
The problem can be converted into a two-machine problem.
Let G and H be two fictitious machines such that G = P + Q and H = Q + R we get
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q7.1
Min {G, H} = 9 for books A, D, E for G.
∴ We have more than one option we take
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q7.2
The problem reduces to
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q7.3
Min {G, H} = 8 for book C on H
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q7.4
Now only B is left. So the optimal sequence is
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q7.5
Worktable
Maharashtra Board 12th Commerce Maths Solutions Chapter 7 Assignment Problem and Sequencing Ex 7.2 Q7.6
Total elapsed time = 51 units
Idle time for P = 51 – 32 = 19 units
Idle time for Q = 14 + [51 – 34] = 31 units
Idle time for R = 9 units

Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6

Balbharati Maharashtra State Board 12th Commerce Maths Solution Book Pdf Chapter 6 Linear Programming Miscellaneous Exercise 6 Questions and Answers.

Maharashtra State Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6

(I) Choose the correct alternative.

Question 1.
The value of objective function is maximized under linear constraints.
(a) at the centre of feasible region
(b) at (0, 0)
(c) at any vertex of feasible region.
(d) The vertex which is at maximum distance from (0, 0).
Answer:
(a) at the centre of feasible region

Question 2.
Which of the following is correct?
(a) Every LPP has on optional solution
(b) Every LPP has unique optional solution
(c) If LPP has two optional solutions then it has infinitely many solutions
(d) The set of all feasible solutions LPP may not be a convex set.
Answer:
(c) If LPP has two optional solutions then it has infinitely many solutions

Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6

Question 3.
Objective function of LPP is
(a) a constraint
(b) a function to be maximized or minimized
(c) a relation between the decision variables
(d) a feasible region.
Answer:
(b) a function to be maximized or minimized

Question 4.
The maximum value of z = 5x + 3y. subject to the constraints 3x + 5y = 15; 5x + 2y ≤ 10, x, y ≥ 0 is
(a) 235
(b) \(\frac{235}{9}\)
(c) \(\frac{235}{19}\)
(d) \(\frac{235}{3}\)
Answer:
(c) \(\frac{235}{19}\)

Question 5.
The maximum value of z = 10x + 6y. subject to the constraints 3x + y ≤ 12, 2x + 5y ≤ 34, x ≥ 0, y ≥ 0 is.
(a) 56
(b) 65
(c) 55
(d) 66
Answer:
(a) 56

Question 6.
The point at which the maximum value of z = x + y subject to the constraint x + 2y ≤ 70, 2x + y ≤ 15, x ≥ 0, y ≥ 0 is
(a) (36, 25)
(b) (20, 35)
(c) (35, 20)
(d) (40, 15)
Answer:
(d) (40, 15)

Question 7.
Of all the points of the feasible region the optimal value of z is obtained at a point
(a) Inside the feasible region
(b) at the boundary of the feasible region
(c) at vertex of feasible region
(d) on x -axis
Answer:
(c) at vertex of feasible region

Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6

Question 8.
Feasible region; the set of points which satisfy
(a) The objective function
(b) All of the given function
(c) Some of the given constraints
(d) Only non-negative constraints
Answer:
(b) All of the given function

Question 9.
Solution of LPP to minimize z = 2x + 3y subjected to x ≥ 0, y ≥ 0, 1 ≤ x + 2y ≤ 10 is
(a) x = 0, y = \(\frac{1}{2}\)
(b) x = \(\frac{1}{2}\), y = 0
(c) x = 1, y = -2
(d) x = y = \(\frac{1}{2}\)
Answer:
(a) x = 0, y = \(\frac{1}{2}\)

Question 10.
The corner points of the feasible region given by the inequation x + y ≤ 4, 2x + y ≤ 7, x ≥ 0, y ≥ 0, are
(a) (0, 0), (4, 0), (3, 1), (0, 4)
(b) (0, 0), (\(\frac{7}{2}\), 0), (3, 1), (0, 4)
(c) (0, 0), (\(\frac{7}{2}\), 0), (3, 1), (5, 7)
(d) (6, 0), (4, 0), (3, 1), (0, 7)
Answer:
(b) (0, 0), (\(\frac{7}{2}\), 0), (3, 1), (0, 4)

Question 11.
The corner point of the feasible region are (0, 0), (2, 0), (\(\frac{12}{7}\), \(\frac{3}{7}\)) and (0, 1) then the point of maximum z = 6.5x + y = 13
(a) (0, 0)
(b) (2, 0)
(c) (\(\frac{11}{7}\), \(\frac{3}{7}\))
(d) (0, 1)
Answer:
(b) (2, 0)

Question 12.
If the corner points of the feasible region are (0, 0), (3, 0), (2, 1) and (0, \(\frac{7}{3}\)) the maximum value of z = 4x + 5y is
(a) 12
(b) 13
(c) \(\frac{35}{2}\)
(d) 0
Answer:
(b) 13

Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6

Question 13.
If the comer points of the feasible region are (0, 10), (2, 2), and (4, 0) then the point of minimum z = 3x + 2y is.
(a) (2, 2)
(b) (0, 10)
(c) (4, 0)
(d) (2, 4)
Answer:
(a) (2, 2)

Question 14.
The half plane represented by 3x + 2y ≤ 0 contains the point.
(a) (1, \(\frac{5}{2}\))
(b) (2, 1)
(c) (0, 0)
(d) (5, 1)
Answer:
(c) (0, 0)

Question 15.
The half plane represented by 4x + 3y ≥ 14 contains the point
(a) (0, 0)
(b) (2, 2)
(c) (3, 4)
(d) (1, 1)
Answer:
(c) (3, 4)

(II) Fill in the blanks.

Question 1.
Graphical solution set of the in equations x ≥ 0, y ≥ 0 is in _________ quadrant.
Answer:
First

Question 2.
The region represented by the in equations x ≥ 0, y ≥ 0 lines in _________ quadrants.
Answer:
First

Question 3.
The optimal value of the objective function is attained at the _________ points of feasible region.
Answer:
End

Question 4.
The region represented by the inequality y ≤ 0 lies in _________ quadrants
Answer:
Third and Fourth

Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6

Question 5.
The constraint that a factory has to employ more women (y) than men (x) is given by _________
Answer:
y > x

Question 6.
A garage employs eight men to work in its showroom and repair shop. The constants that there must be not least 3 men in showroom and repair shop. The constrains that there must be at least 3 men in showroom and at least 2 men in repair shop are _________ and _________ respectively.
Answer:
x ≥ 3 and y ≥ 2

Question 7.
A train carries at least twice as many first class passengers (y) as second class passangers (x). The constraint is given by _________
Answer:
x ≥ 2y

Question 8.
A dishwashing machine hold up to 40 pieces of large crockery (x) this constraint is given by _________
Answer:
x ≤ 40

(III) State whether each of the following is True or False.

Question 1.
The region represented by the inequalities x ≥ 0, y ≥ 0 lies in first quadrant.
Answer:
True

Question 2.
The region represented by the inqualities x ≤ 0, y ≤ 0 lies in first quadrant.
Answer:
False

Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6

Question 3.
The optimum value of the objective function of LPP occurs at the center of the feasible region.
Answer:
False

Question 4.
Graphical solution set of x ≤ 0, y ≥ 0 in xy system lies in second quadrant.
Answer:
True

Question 5.
Saina wants to invest at most ₹ 24000 in bonds and fixed deposits. Mathematically this constraints is written as x + y ≤ 24000 where x is investment in bond and y is in fixed deposits.
Answer:
True

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

Question 7.
The feasible solution of LPP belongs to only quadrant I. The Feasible region of graph x + y ≤ 1 and 2x + 2y ≥ 6 exists.
Answer:
True

(IV) Solve the following problems.

Question 1.
Maximize z = 5x1 + 6x2, Subject to 2x1 + 3x2 ≤ 18, 2x1 + x2 ≤ 12, x ≥ 0, y ≥ 0
Solution:
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q1
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q1.1
OAED is the feasible region O(0, 0) A(0, 6) D (6, 0)
and E is the intersection of 2x1 + 3x2 = 18 and 2x1 + x2 = 12
For E, Solving, 2x1 + 3x2 = 18 …….(i)
2x1 + x2 = 12 ……(ii)
We get x1 = 4.5, x2 = 3
∴ E = (4.5, 3)
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q1.2
∴ Maximum value of z = 40.5 at E(4.5, 3)

Question 2.
Minimize z = 4x + 2y, Subject to 3x + y ≥ 27, x + y ≥ 21, x ≥ 0, y ≥ 0
Solution:
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q2.2
AED is the feasible region A(0, 27), D(21, 0)
and E is the point of intersection of 3x + y = 27 and x + y = 21
For E, Solving 3x + y = 27 ………(i)
x + y = 21 …….(ii)
We get x = 3, y = 18
∴ E(3, 18)
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q2
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q2.1
∴ Minimum value of z = 48 at (3, 18)

Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6

Question 3.
Maximize z = 6x + 10y, subject to 3x + 5y ≤ 10, 5x + 3y ≤ 15, x ≥ 0, y ≥ 0
Solution:
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q3
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q3.1
OAED is the feasible region;
O(0, 0), A (0, 2) D (3, 0) and E is the point of intersection of 3x + 5y = 10 and 5x + 3y = 15
For E, Solving 3x + 5y = 10
5x + 3y = 15
We get, x = \(\frac{45}{16}\), y = \(\frac{5}{16}\)
∴ E(\(\frac{45}{16}\), \(\frac{5}{16}\))
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q3.2
Since the maximum value of z = 20 at two points i.e, at A(0, 2) and E(\(\frac{45}{16}\), \(\frac{5}{16}\)).
z is maximum at all points on segment AE.
Hence it has infinite number of solutions.

Question 4.
Minimize z = 2x + 3y, Subject to x – y ≤ 1, x + y ≥ 3, x ≥ 0, y ≥ 0
Solution:
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q4
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q4.1
Shaded portion CE is the feasible region
Where C = (0, 3) and E is the point of intersection of x – y = 1 and x + y = 3
For E, Solving x – y = 1 …….(i)
x + y = 3 ………(ii)
We get, x = 2, y = 1
∴ E(2, 1)
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q4.2
∴ Minimum value z = 7 at E(2, 1)

Question 5.
Maximize z = 4x1 + 3x2, Subject to 3x1 + x2 ≤ 15, 3x1 + 4x2 ≤ 24, x ≥ 0, y ≥ 0
Solution:
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q5
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q5.1
OCEB is the feasible region where O(0, 0), C(0, 6), B(5, 0)
E is the point of intersection of 3x1 + x2 = 15 and 3x1 + 4x2 = 24
For E, Solving 3x1 + x2 = 15 ……..(i)
3x1 + 4x2 = 24 …….(ii)
We get, x1 = 4, x2 = 3
∴ E(4, 3)
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q5.2
∴ Maximum value of z = 25 at (4, 3)

Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6

Question 6.
Maximize z = 60x + 50y, Subject to x + 2y ≤ 40, 3x + 2y ≤ 60, x ≥ 0, y ≥ 0
Solution:
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q6
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q6.1
OAED is the feasible region O(0, 0), A(0, 20), D(20, 0)
E is x + 2y = 40 and 3x + 2y = 60
For E, Solving x + 2y = 40
3x + 2y = 60
We get, x = 10, y = 15
∴ E = (10, 15)
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q6.2
∴ Maximum value of z = 1350 at E(10, 15).

Question 7.
Minimize z = 4x + 2y, Subject to 3x + y ≥ 27, x + y ≥ 21, x + 2y ≥ 30, x ≥ 0, y ≥ 0
Solution:
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q7
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q7.1
AGHF is the feasible region where A(0, 27) F(30, 0)
G is the point of intersection of 3x + y = 27 and x + y = 21
H is the point of intersection of x + y = 21 and x + 2y = 30
For G, Solving 3x + y = 27 …….(i)
x + y = 21 ………(ii)
We get, x = 3, y = 18
∴ G(3, 8)
For H, Solving x + y = 21 …….(i)
x + 2y = 30 ……..(ii)
We get, x = 12, y = 9
∴ G = (12, 9)
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q7.2
∴ Maximum value of z = 48 at G(3, 18)

Question 8.
A carpenter makes chairs and table profit 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.
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q8
Formulate and solve the following Linear programming problem using graphical method.
Solution:
Let z be the profit which can be made by selling x chair and y table.
∴ x ≥ 0, y ≥ 0
Total profit = 140x + 210y
According to the table, the constraints can be written as
3x + 3y ≤ 36
5x + 2y ≤ 50
2x + 6y ≤ 60
∴ The given LPP can be formulated as.
Maximize z = 140x + 210y
Subject to 3x + 3y ≤ 36, 5x + 2y ≤ 50, 2x + 6y ≤ 60, x ≥ 0, y ≥ 0.
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q8.1
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q8.2
OEGH is the feasible region
O(0, 0), D(10.4, 0), E(0, 10)
For G, Solving 3x + 3y = 36 ……..(i)
2x + 6y = 60 …….(ii)
∴ G = (3, 9)
For H, Solving 5x + 2y = 52 ………(i)
3x + 3y = 36 ……..(ii)
We get, x = \(\frac{28}{3}\), y = \(\frac{8}{3}\)
∴ H(\(\frac{28}{3}\), \(\frac{8}{3}\))
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q8.3
∴ z in maximum at (3, 9) and maximum profit = ₹ 2310.

Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6

Question 9.
A company manufactures bicycles and tricycles, each of which must be processed through two machines A and B Maximum availability of machines A and B are 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 manufactured in order to maximize the profit.
Solution:
Let x number of bicycle and y number of tricycle has to be manufactured and to be sold to get the profit (z)
∴ x ≥ 0, y ≥ 0
Total profit = 180x + 220y.
The given LPP can be tabulated as follows:
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q9
∴ The given LPP can be formulated as
Maximize z = 180x + 220y
Subject to 6x + 4y ≤ 120, 3x + 10y ≤ 180, x ≥ 0, y ≥ 0
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q9.1
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q9.2
OCEB is the feasible region where O(0, 0) C(0, 18) B(20, 0)
E is the point of intersection of 6x + 4y = 120 and 3x + 10y = 180
For E, Solving 6x + 4y = 120 ……..(i)
3x + 10y = 180 …….(ii)
We get, x = 10, y = 15
∴ E(10, 15)
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q9.3
∴ Maximum value of z is 5100 at E(10, 15)
Hence 10 bicycles and 15 tricycles should be produced to get maximum profit.

Question 10.
A factory produced two types of chemicals A and B. The following table gives the units of ingredients P and Q (per kg) of chemicals A and B as well as minimum requirements of P and Q and also cost per kg. Chemicals A and B:
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q10
Find the number of units of chemicals A and B should be produced sp as to minimize the cost.
Solution:
Let x be the no. of units of chemicals, A produced and y be the no. of units of chemical B produced.
Total cost is 4x + 6y
The LPP is. Minimise z = 4x + 6y
Subject to x + 2y ≥ 80, 3x + y ≥ 75, x ≥ 0, y ≥ 0.
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q10.1
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q10.2
The shaded region BEC in the feasible region B(80, 0) C(0, 75)
and E is the point of intersection of x + 2y = 80 and 3x + y = 75
For E, Solving x + 2y = 80 …….(i)
3x + y = 75 …….(ii)
We get, x = 14, y = 33
∴ E(14, 33)
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q10.3
∴ z is minimum at E(14, 33) and the minimum value of z = 254.
Hence 14 units of chemical A and 33 units of chemical B are produced to get a minimum cost of ₹ 254.

Question 11.
A company produces mixers and food processors. Profit on selling one mixer and one food processor is ₹ 2,000/- and ₹ 3,000/- 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:
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q11
How many mixes and food processors should be produced to maximize profit?
Solution:
Let x be the no. of mixers produced and y be the no.of food processors produced.
The profit is 2000x + 3000y
The LPP is Maximize 2 = 2000x + 3000y
Subject to 3x + 3y ≤ 36, 5x + 2y ≤ 50, 2x + 6y ≤ 60 x, y ≥ 0.
Let 3x + 3y = 36,
i.e. x + y = 12
x = 0, y = 12, (0, 12)
y = 0, x = 12, (12, 0)
5x + 2y = 50
x = 0, y = 25, (0, 25)
y = 0, x = 10, (10, 0)
Let 2x + 6y = 60, x + 3y = 30
x = 0, y = 10 (0, 10)
y = 0, x = 30 (30, 0)
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q11.1
The Shaded region OABCD is the feasible region.
O(0, 0) A (10, 0) D(0, 10)
B is the intersection of x + y = 12 and 5x + 2y = 50
Solving we get x = 8.67, y = 3.33
∴ B(8.67, 3.33)
C is the intersection of x + y = 12 and x + 3y = 30
Solving we get x = 3, y = 9
∴ C(3, 9)
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q11.2
∴ Maximum value of z is 330000 at C(3, 9)
Hence 3 mixers and 9 food processors should be produced to get a maximum profit of ₹ 33,000.

Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6

Question 12.
A chemical company produces a chemical containing three basic elements A, B, C so that it has at least 16 liters of A, 24 liters of B, and 18 liters of C. This chemical is made by mixing two compounds I and II. Each unit of compound I has 4 liters of A, 12 liters of B, 2 liters of C. Each unit of compound II has 2 liters of A, 2 liters of B and 6 liters of C. The cost per unit of compound is ₹ 800/- and that of compound II is ₹ 640/- Formulate the problem as L.P.P and solve it to minimize the cost.
Solution:
Let x be the no. of units of compound I used and y be the no of units of compound II used.
The data can be tabulated as
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q12
The LPP is minimize z = 800x + 640y
Subject to 4x + 2y ≥ 16, 12x + 2y ≥ 24, 2x + 6y ≥ 18, x, y ≥ 0.
Let 4x + 2 y = 16,
2x + y = 8
x = 0, y = 8, (0, 8)
y = 0, x = 4, (4, 0)
12x + 2y = 24,
6x + y = 12
x = 0, y = 12, (0, 12)
y = 0, x = 2, (2, 0)
2x + 6y = 18
x + 3y = 9
x = 0, y = 3, (0, 3)
y = 0, x = 9, (9, 0)
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q12.1
The Shaded region ABCD is the feasible region.
A(0, 12) D(9, 0)
B is the intersection of 6x + y = 12 and 2x + y = 8
Solving we get x = 1, y = 6
∴ B(1, 6)
C is the intersection of 2x + y = 8 and x + 3y = 9
Solving we get x = 3, y = 2
∴ C(3, 2)
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q12.2
∴ The minimum value of z = 3680 at (3, 2)
Hence 3 unit of compound I and 2 units of compound II should be used to get the minimum cost of ₹ 3680.

Question 13.
A person who makes two types of gift items A and B requires the services of a cutter and a finisher. Gift item A requires 4 hours of the cutter’s time and 2 hours of the finisher’s time. B required 2 hours of the cutter’s time and 4 hours of finisher‘s 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 gift items produced, determine how many gift items of each type should he make every month to obtain the best returns?
Solution:
Let x be the no. of gift A produced and y be the no. of gift B produced.
The data can be tabulated as
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q13
The LLP is maximize z = 75x + 125y
Subject to 4x + 2y ≤ 208, 2x + 4y ≤ 152, x, y ≥ 0
Let 4x + 2y = 208, 2x + 4y = 152,
2x + y = 104, x + 2y = 76,
x = 0, y = 104; (0, 104), x = 0, y = 38; (0, 38)
y = 0, x = 52; (52, 0), y = 0, x = 76; (76, 0)
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q13.1
The shaded region OABC is the feasible region.
O(0,0) A (52, 0) C(0, 38)
B is the intersection of 2x + y = 104 and x + 2y = 76
Solving we get x = 44, y = 16
∴ B(44, 16)
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q13.2
∴ Maximum value of z = 5300 at B(44, 16)
Hence he should produce 44 gifts of type A & 16 of type B to get a maximum profit of ₹ 5300.

Question 14.
A firm manufactures two products A and B on which profit is earned per unit ₹ 3/- and ₹ 4/- respectively. Each product is processed on two machines M1 and M2. Product A requires one minute of processing time on Mx and two minutes of processing time on M2. B requires one minute of processing time on M1 and one minute processing time on M2 Machine M1 is available for use for 450 minutes while M2 is available for 600 minutes during any working day. Final the number of units of products A and B to be manufactured to get the maximum profit.
Solution:
Let x denote the number of units of product A and y denote the number of units of product B.
The total profit in ₹ 3x + 4y,
The given statements can be tabulated as
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q14
The constraints are x + y ≤ 450, 2x + y ≤ 600, x ≥ 0, y ≥ 0
∴ The LPP can be formulated as
Maximize z = 3x + 4y
Subject to x + y ≤ 450, 2x + y ≤ 600, x ≥ 0, y ≥ 0.
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q14.1
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q14.2
OAED in the feasible region O(0, 0) A(0, 450) D(300, 0)
E is the intersection of x + y = 450 and 2x + y = 600
For E, Solving x + y = 450 ……..(i)
2x + y = 600 ……..(ii)
Solving x = 150, y = 300
∴ E(150, 300)
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q14.3
∴ Maximum value of z = 1800 at (0, 450)

Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6

Question 15.
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 required 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 they manufacture per month to maximize profit? How much is the maximum profit?
Solution:
Let x be the no. of electrical item A and y be the no. of electrical items to be manufactured per month to maximize the profit.
Total profit is ₹ 20x + 30y
The given condition can be tabulated as.
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q15
The given LPP can be formulated as
Maximize z = 20x + 30y
Subject of 3x + 2y ≤ 210, 2x + 4y ≤ 300, x ≥ 0, y ≥ 0.
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q15.1
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q15.2
BOCE is the feasible region
B(70, 0) O(0, 0) C(0, 75)
E is the intersection of 3x + 2y = 210 and 2x + 4y = 300
For E, Solving 3x + 2y = 210 ……….(i)
2x + 4y = 300 …….(ii)
We get x = 30, y = 60
∴ E(30, 60)
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Miscellaneous Exercise 6 IV Q15.3
∴ Maximum value of z = ₹ 2400 at (30, 60)
Hence 30 units of A and 60 units of B should be manufactured per month to get the maximum profit of ₹ 2400

Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.2

Balbharati Maharashtra State Board 12th Commerce Maths Solution Book Pdf Chapter 6 Linear Programming Ex 6.2 Questions and Answers.

Maharashtra State Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.2

Solve the following LPP by graphical method.

Question 1.
Maximize z = 11x + 8y, Subject to x ≤ 4 ,y ≤ 6 x + y ≤ 6, x ≥ 0, y ≥ 0.
Solution:
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.2 Q1
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.2 Q1.1
The feasible solution is AOBE
Where A(4, 0) O(0, 0) B(0, 6)
E is the point of intersection of x + y = 6 and x = 4.
∴ 4 + y = 6
∴ y = 2
∴ E = (4, 2)
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.2 Q1.2
∴ z is maximum at (4, 12) and the maximum value of z = 60

Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.2

Question 2.
Maximize z = 4x + 6y, Subject to 3x + 2y ≤ 12, x + y ≥ 4 x, y ≥ 0.
Solution:
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.2 Q2
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.2 Q2.1
From figure, ABC is the feasible region
Where A(0, 6) B(4, 0) C(0, 4)
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.2 Q2.2
Maximum value of z = 36 at A(0, 6)

Question 3.
Maximize z = 7x + 11y, Subject to 3x + 5y ≤ 26, 5x + 3y ≤ 30, x ≥ 0, y ≥ 0.
Solution:
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.2 Q3
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.2 Q3.1
∴ AODE is the feasible region where
A(0, 5.2) O(0, 0) D(6, 0) and E is the intersection of 3x + 5y = 26 and 5x + 3y = 30
For E,
Solving 3x + 5y = 26 ……(i)
5x + 3y = 30 ……(ii)
We get, x = 4.5, y = 2.5
∴ E = (4.5, 2.5)
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.2 Q3.2
∴ Maximum value of z = 59 at E(4.5, 2.5)

Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.2

Question 4.
Maximize z = 10x + 25y, Subject to 0 ≤ x ≤ 3, 0≤ y ≤ 3, x + y ≤ 5.
Solution:
The constraints can be written as, x ≤ 3, x ≥ 0, y ≥ 0, y ≤ 3, x + y ≤ 5
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.2 Q4
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.2 Q4.1
ABCDE is the feasible region where A(3, 0) B(0, 0) and C(0, 3) D is the intersection of y = 3 and x + 5y = 5 and E is the intersection of x = 3 and x + 7 = 5
For D,
Solving y = 3 ………(i)
x + y = 5 ……..(ii)
We get x = 2, y = 3
∴ D = (2, 3)
For E,
Solving x = 3 …….(i)
x + y = 5 ……….(ii)
We get x = 3, y = 2
∴ E = (3, 2)
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.2 Q4.2
∴ Maximum value of z = 90 at D(2, 3)

Question 5.
Maximize z = 3x + 5y, Subject to x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0.
Solution:
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.2 Q5
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.2 Q5.1
OAGHD is the feasible region where O(0, 0), A(0, 6), D(7, 0) G is the intersecting point of x + 4y = 24 and x + y = 9
H is the intersecting points of 3x + y = 21 and x + y = 9.
For G, Solving x + 4y = 24 …….(i)
x + y = 9 ………(ii)
We get, x = 4, y = 5
∴ G (4, 5)
For H, Solving x + y = 9 ………(i)
3x + y = 21 ……..(ii)
We get x = 6, y = 3
∴ H(6, 3)
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.2 Q5.2
∴ Maximum value of z = 37 at the point G(4, 5)

Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.2

Question 6.
Minimize z = 7x + y Subject to 5x + y ≥ 5, x + y ≥ 3, x ≥ 0, y ≥ 0
Solution:
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.2 Q6
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.2 Q6.1
AED is the feasible region where A(0, 5) D(3, 0) and E is the point of intersection of 5x + y = 5 and x + y = 3.
For E, Solving 5x + y = 5 ………(i)
x + y = 3 ……..(ii)
We get, x = \(\frac{1}{2}\), y = \(\frac{5}{2}\)
∴ E(\(\frac{1}{2}\), \(\frac{5}{2}\))
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.2 Q6.2
∴ Minimum value of z = 5 at A(0, 5)

Question 7.
Minimize z = 8x + 10y, Subject to 2x + y ≥ 7, 2x + 3y ≥ 15 ,y ≥ 2, x ≥ 0, y ≥ 0
Solution:
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.2 Q7
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.2 Q7.1
AEG is the feasible solution where A(0, 7)
F is the point of intersection of 2x + y = 7 and 2x + 3y = 15
G is the point of intersection of y = 2 and 2x + 3y = 15
For F, Solving 2x + y = 7 ……..(i)
2x + 3y = 15 ……..(ii)
We get x = \(\frac{3}{2}\), y = 4
∴ F = (\(\frac{3}{2}\), 4)
For G, Solving 2x + 3y = 15 ……..(i)
y = 2 …….(ii)
We get x = 4.5, y = 2
∴ G = (4.5, 2)
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.2 Q7.2
∴ Minimum value of z = 52 at F(\(\frac{3}{2}\), 4)

Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.2

Question 8.
Minimize z = 6x + 2y, Subject to x + 2y ≥ 3, x + 4y ≥ 4, 3x + y ≥ 3, x ≥ 0, y ≥ 0.
Solution:
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.2 Q8
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.2 Q8.1
DGHB is the feasible region where D(0, 3), B(4, 0)
G is the point of intersection of 3x + y = 3 and x + 2y = 3 and H is the point of intersection of x + 2y = 3 and x + 4y = 4
For G, Solving 3x + y = 3 ……(i)
x + 2y = 3 ………(ii)
W e get x = \(\frac{3}{5}\), y = \(\frac{6}{5}\)
∴ G(\(\frac{3}{5}\), \(\frac{6}{5}\))
For H, Solving x + 2y = 3 ……..(i)
x + 4y = 4 ………(ii)
We get, x = 2, y = \(\frac{1}{2}\)
∴ H(2, \(\frac{1}{2}\))
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.2 Q8.2
∴ Minimum value of z = 22.5 at H(2, \(\frac{1}{2}\))

Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.1

Balbharati Maharashtra State Board 12th Commerce Maths Solution Book Pdf Chapter 6 Linear Programming Ex 6.1 Questions and Answers.

Maharashtra State Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.1

Question 1.
A manufacturing firm produces two types of gadgets A and B, which are first processed in the foundry and then sent to a 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 is as follows.
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.1 Q1
Profit on the sale of A is ₹ 30 and B ₹ 20 Per unit Formulate the LPP to have maximum profit.
Solution:
Let the manufacturing firm produce x gadgets of type A and y gadgets of type B.
On selling x gadgets of type A the firm gets ₹ 30 and that on type B is ₹ 20.
∴ Total profit is z = ₹ 30x + 20y.
Since x and y are the numbers of gadgets, x ≥ 0, y ≥ 0
From the given table, the availability of man-hours of labour required in each shop and for the firm is given as 60 and 35.
∴ The inequation are 10x + 6y ≤ 60 and 5x + 4y ≤ 35.
Hence the given LPP can be formulated as Maximize z = 30x + 20y
Subject to 10x + 6y ≤ 60, 5x + 4y ≤ 35, x ≥ 0, y ≥ 0.

Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.1

Question 2.
In a cattle breeding farm, it is prescribed that the food ratio 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:
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.1 Q2
The cost of fodder 1 is ₹ 3 per unit and that of fodder 2 is ₹ 2 per unit. Formulate the LPP to minimize the cost.
Solution:
Let x unit of fodder 1 and y unit of fodder 2 be included in the ration of an animal
The cost of 1 unit of fodder 1 is ₹ 3 and the cost of 1 unit of fodder 2 is ₹ 2.
∴ The total cost is ₹ 3x + 2y.
The minimum requirement of the nutrients A, B, and C is given as 14 units, 22 units, and 1 unit.
∴ From the given table, the daily food ration will include (2x + 2y) unit of Nutrient A, (2x + 3y) unit of Nutrient B, and (x + y) of Nutrient C.
The total cost is 2 = ₹ 3x + 2y
Hence the given LPP can be formulated as Minimize z = 3x + 2y
subject to 2x + y ≥ 14, 2x + 3y ≥ 22, x + y ≥ 1, x ≥ 0, y ≥ 0.

Question 3.
A Company manufactures two types of chemicals A and B. Each chemical requires two types of raw materials P and Q. The table below shows a number of units of P and Q required to manufacture one unit of A and one unit of B.
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.1 Q3
The company gets profits of ₹ 350/- and ₹ 400/- by selling one unit of A and one unit of B respectively. Formulate the problem as LPP to maximize the profit.
Solution:
∴ Let the company manufactures x unit of chemical A and y unit of chemical B.
The availability of the raw materials for the production of chemicals A and B are given as 120 and 160 units.
The company gets ₹ 350 as profit on selling one unit of chemical A and ₹ 400 as profit on selling one unit of chemical B.
∴ Total profit is ₹ (350x + 400y).
The inequation can be written as.
3x + 2y ≤ 120
2x + 5y ≤ 160
and x & y cannot be negative
Hence the LPP can be formulated as follows,
Maximize z = 350x + 400y
Subject to 3x + 2y ≤ 120, 2x + 5y ≤ 160, x ≥ 0, y ≥ 0.

Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.1

Question 4.
A printing company prints two types of magazines A and B. The company earns ₹ 10 and ₹ 15 on magazines A and B per copy. These are processed on three machines I, II, III. Magazine A requires 2 hours on the machine I, 5 hours on machine II, and 2 hours on machine III. Magazine B requires 3 hours on machine 1, 2 hours on machine II and 6 hours on machine III. Machines I, II, III are available for 36, 50, 60 hours per week respective. Formulate the linear programming problem to maximize the profit.
Solution:
Let the company print x magazine of type A and y magazines of type B.
Then the total earnings of the company are ₹ 10x + 15y.
The given problem can be tabulated as follows.
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.1 Q4
From the table, the total time required for Machine I is (2x + 3y) hours, for machine II is (5x + 2y) hours, and for machine III is (2x + 6y) hours.
The machine I, II, and III are available for 36, 50, and 60 hours per work.
∴ The constraints are 2x + 3y ≤ 36, 5x + 2y ≤ 50 and 2x + 6y ≤ 60.
Since x and y cannot be negative, we have x ≥ 0, y ≥ 0.
Hence the given LPP can be formulated as
Maximize z = 10x + 15y
Subject to 2x + 3y ≤ 36, 5x + 2y ≤ 50, 2x + 6y ≤ 60, x ≥ 0, y ≥ 0.

Question 5.
Manufacture produces bulbs and tubes. Each of these must be processed through two machines M1 and M2. A package of bulbs requires 1 hour of work on machine M1 and 3 hours of work on M2. A package of tubes requires 2 hours on machine M1 and 4 hours on machine M2. He earns a profit of ₹ 13.5 per package of bulbs and ₹ 55 per package of tubes. Formulate the LPP to maximize the profit. He operates M1 for at most 10 hours and M2 for at most 12 hours a day.
Solution:
Let the manufacturer produce x packages of bulbs and y packages of tubes.
He earns a profit of ₹ 13.5 per packages of bulbs and ₹ 55 per package of tubes.
∴ His total profit = ₹ (13.5x + 55y).
The given problem can be tabulated as follows.
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.1 Q5
From the above table, the total time required for M1 is (x + 2y), and that of M2 is (3x + 4y).
M1 and M2 are available for at most 10 hrs per day and 12 hours per day.
∴ The constraint for the objective function is x + 2y ≤ 10, 3x + 4y ≤ 12
Hence the give LPP can be formulated as
Maximize z = 13.5x + 55y
Subject to x + 2y ≤ 10, 3x + 4y ≤ 12, x ≥ 0, y ≥ 0.

Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.1

Question 6.
A Company manufactures two types of fertilizers F1 and F2. Each type of fertilizer requires two raw materials A and B. The number of units of A and B required to manufacture one unit of fertilizer F1 and F2 and availability of the raw materials A and B per day are given in the table below
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.1 Q6
By selling one unit of F1 and one unit of F2, the company gets a profit of ₹ 500 and ₹ 750 respectively. Formulate the problem as LPP to maximize the profit.
Solution:
Let the company manufacture x units of Fertilizers F1 and y units of fertilizer F2.
The company gets a profit of ₹ 500 and ₹ 750 by selling a unit of F1 and F2.
∴ Total profit = ₹ (500x + 750y)
The availability of raw materials A and B per day is given as 40 and 70.
∴ From the given table the constraints can be written as 2x + 3y ≤ 40 and x + 4y ≤ 70.
Since x & y cannot be negative, x ≥ 0, y ≥ 0
Hence the given LPP can be formulated as
Maximize z = 500x + 750y
Subject to 2x + 3y ≤ 40, x + 4y ≤ 70, x ≥ 0, y ≥ 0.

Question 7.
A doctor has prescribed two different kinds of feeds A and B to form a weekly diet for a sick person. The minimum requirement of fats, carbohydrates, and proteins are 18, 28,14 units respectively. One unit of food A has 4 units of fat, 14 units of carbohydrates, and 8 units of protein. One unit of food B has 6 units of fat, 12 units of carbohydrates and 8 units of protein. The price of food A is ₹ 4.5 per unit and that of food B is ₹ 3.5 per unit. Form the LPP so that the sick person’s diet meets the requirements at minimum cost.
Solution:
Let x unit of food A and y unit of food B be consumed by a sick person.
The cost of food A in ₹ 4.5 per unit and food B is ₹ 3.5 per unit.
∴ Total cost = ₹ (4.5x + 3.5y)
The given conditions can be tabulated as follows.
Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.1 Q7
∴ The given LPP can be formulated as
Minimise z = 4.5x + 3.5y
Subject to 4x + 6y ≥ 18, 14x + 12y ≥ 28, 8x + 8y ≥ 14, x ≥ 0, y ≥ 0.

Question 8.
If John drives a car at a speed of 60 kms/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 to ₹ 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 LPP.
Solution:
Let John drive x km at a speed of 60 km/hr and y km at a speed of 90 km/hr.
∴ Time required to drive a distance of x km is \(\frac{x}{60}\) hours and the time require to drive at a distance of y km is \(\frac{y}{90}\) hours.
∴ Total time required \(\left(\frac{x}{60}+\frac{y}{90}\right)\) hours.
Since he wishes to drive maximum distance within an hour,
\(\frac{x}{60}+\frac{y}{90} \leq 1\)
He has to spend ₹ 5 per km at a speed of 60 km/hr and ₹ 8 per km at a speed of 90 km/hr.
He has ₹ 600 on petrol to spend, 5x + 8y ≤ 600
The total distance he wishes to travel is (x + y) hours.
∴ The given LPP can be formulated as
Maximize z = x + y
Subject to \(\frac{x}{60}+\frac{y}{90}\) ≤ 1, 5x + 8y ≤ 600, x ≥ 0, y ≥ 0.

Maharashtra Board 12th Commerce Maths Solutions Chapter 6 Linear Programming Ex 6.1

Question 9.
The company makes concrete bricks made up of cement and sand. The weight of a concrete brick has to be at least 5 kg. Cement costs ₹ 20 per kg. and sand costs ₹ 6 per kg. Strength considerations dictate that a concrete brick should contain a minimum of 4 kg of cement and not more than 2 kg of sand. Formulate the LPP for the cost to be minimum.
Solution:
Let the concrete brick contain x kg of cement and y kg of sand.
The cost of cement is ₹ 20 per kg and sand is ₹ 6 per kg.
∴ The total cost = ₹ (20x + 6y)
Since the weight of the concrete brick has to be at least 5 kg, therefore, x + y ≥ 5
Also, the concrete brick should contain a minimum of 4 kg of cement, i.e. x ≥ 4, and not more than 2 kg of sand, i.e, y ≤ 2.
∴ The LPP can be formulated as
Minimize z = 20x + 6y
Subject to x + y ≥ 5, x ≥ 4, y ≤ 2, x ≥ 0, y ≥ 0.

Maharashtra Board 12th Commerce Maths Solutions Chapter 1 Commission, Brokerage and Discount Ex 1.2

Balbharati Maharashtra State Board 12th Commerce Maths Digest Pdf Chapter 1 Commission, Brokerage and Discount Ex 1.2 Questions and Answers.

Maharashtra State Board 12th Commerce Maths Solutions Chapter 1 Commission, Brokerage and Discount Ex 1.2

Question 1.
What is the present worth of a sum of ₹ 10,920 due six months hence at 8% p.a simple interest?
Solution:
Given, SD = ₹ 10,920
n = \(\frac{6}{12}\) year = \(\frac{1}{2}\) year
r = 8%
We have,
Maharashtra Board 12th Commerce Maths Solutions Chapter 1 Commission, Brokerage and Discount Ex 1.2 Q1
Thus the present worth is ₹ 10,500

Question 2.
What is the sum due of ₹ 8,000 due 4 months at 12.5% simple interest?
Solution:
Given, PW = ₹ 8,000, n = \(\frac{4}{12}\) year = \(\frac{1}{3}\) year, r = 12.5%
We have,
Maharashtra Board 12th Commerce Maths Solutions Chapter 1 Commission, Brokerage and Discount Ex 1.2 Q2
Thus, the sum due is ₹ 8,333.33

Question 3.
The true discount on the sum due 8 months hence at 12% p.a. is ₹ 560. Find the sum due and present worth of the bill.
Solution:
Given, TD = ₹ 560, n = \(\frac{8}{12}\) year = \(\frac{2}{3}\) year, r = 12%
We have,
TD = \(\frac{\mathrm{PW} \times n \times r}{100}\)
∴ 560 = \(\frac{\mathrm{PW} \times 2 \times 12}{3 \times 100}\)
∴ PW = 560 × \(\frac{25}{2}\) = ₹ 7,000
Now, SD = PW + TD
= 7,000 + 560
= ₹ 7,560

Maharashtra Board 12th Commerce Maths Solutions Chapter 1 Commission, Brokerage and Discount Ex 1.2

Question 4.
The true discount on a sum is \(\frac{3}{8}\) of the sum due at 12% p.a. Find the period of the bill.
Solution:
Maharashtra Board 12th Commerce Maths Solutions Chapter 1 Commission, Brokerage and Discount Ex 1.2 Q4
8 × n × 12 = 3(100 + n × 12)
96n = 300 + 36n
60n = 300
∴ n = 5
∴ Period of the bill = 5 years.

Question 5.
20 copies of a book can be purchased for a certain sum payable at the end of 6 months and 21 copies for the same sum in ready cash. Find the rate of interest.
Solution:
Given, n = \(\frac{6}{12}\) year = \(\frac{1}{2}\) year
Let the sum payable be ₹ x
Let the rate of interest be r%
According to given condition,
PW of one book = \(\frac{x}{21}\)
SD of one book = \(\frac{x}{20}\)
Maharashtra Board 12th Commerce Maths Solutions Chapter 1 Commission, Brokerage and Discount Ex 1.2 Q5
Thus, the rate of interest is 10%.

Question 6.
Find the true discount, Banker’s discount, and Banker’s gain on a bill of ₹ 4,240 due 6 months hence at 9% p.a.
Solution:
Maharashtra Board 12th Commerce Maths Solutions Chapter 1 Commission, Brokerage and Discount Ex 1.2 Q6
And, Banker’s Gain (BG) = BD – TD
= 190.80 – 182.58
= ₹ 8.22

Question 7.
The true discount on a bill is ₹ 2,200 and bankers discount is ₹ 2,310. If the bill is due 10 months, hence, find the rate of interest.
Solution:
Given, TD = ₹ 2,200, BD = ₹ 2,310
n = \(\frac{10}{12}=\frac{5}{6}\) year
Maharashtra Board 12th Commerce Maths Solutions Chapter 1 Commission, Brokerage and Discount Ex 1.2 Q7
∴ \(\frac{r}{120}=\frac{1}{20}\)
∴ r = 6%
Thus, rate of interest is 6%

Maharashtra Board 12th Commerce Maths Solutions Chapter 1 Commission, Brokerage and Discount Ex 1.2

Question 8.
A bill of ₹ 6,395 drawn on 19th January 2015 for 8 months was discounted on 28th February 2015 at 8% p.a. interest. What is the banker’s discount? What is the cash value of the bill?
Solution:
Face value = ₹ 6,395
Date of drawing = 19/01/2015
Period of the bill = 8 months
Nominal Due date = 19/09/2015
Legal due date = 22/09/2015
Date of discounting = 28/02/2015
Now, the unexpired period = Legal due date – Date of discounting
= 22/09/2015 – 28/02/2015
= days (as shown below)
Maharashtra Board 12th Commerce Maths Solutions Chapter 1 Commission, Brokerage and Discount Ex 1.2 Q8
Cash Value = FV – BD
= 6,395 – 313.12
= ₹ 6,621.38

Question 9.
A bill of ₹ 8,000 drawn on 5th January 1998 for 8 months was discounted for ₹ 7,680 on a certain date. Find the date on which it was discounted at 10% p.a.
Solution:
Bankers discount (BD) = FV – cash value
= 8,000 – 7,680
= ₹ 320
Let the unexpired period be x days
∴ BD = \(\frac{\mathrm{FV} \times x \times r}{365 \times 100}\)
∴ 320 = \(\frac{8,000 \times x \times 10}{365 \times 100}\)
∴ x = 146 days
∴ The unexpired days = 146 days
Date of drawing = 05/01/1998
Period of bill = 8 months
Nominal due date = 05/09/1998
Legal due date = 08/09/1998
Thus, the date of discounting is 146 days before the legal due date
Maharashtra Board 12th Commerce Maths Solutions Chapter 1 Commission, Brokerage and Discount Ex 1.2 Q9
∴ Date of discounting of the bill is 15th April 1998

Question 10.
A bill drawn on 5th June for 6 months was discounted at the rate of 5% p.a. on 19th October. If the cash value of the bill is ₹ 43,500, find the face value of the bill.
Solution:
Date of drawing = 5th June
Period of bill = 6 months
Nominal due date = 5th December
Legal due date = 8th December
Date of discounting = 19th October
Rate of interest = 5% p.a.
Let the face value of the bill be ₹ x
The unexpired period
Maharashtra Board 12th Commerce Maths Solutions Chapter 1 Commission, Brokerage and Discount Ex 1.2 Q10

Question 11.
A bill was drawn on 14th April for ₹ 7,000 and was discounted on 6th July at 5% p.a. The Banker paid ₹ 6,930 for the bill. Find the period of the bill.
Solution:
Face value = ₹ 7,000, cash value = ₹ 6,930
∴ Banker’s discount = 7,000 – 6,930 = ₹ 70
Date of drawing = 14/04
Date of discounting = 06/07
Rate of interest = 5%
Let the unexpired period = x days
∴ BD = \(\frac{7,000 \times x \times 5}{365 \times 100}\)
∴ 70 = \(\frac{70 \times x}{73}\)
∴ x = 73 days
∴ Legal due date of the bill is 73 days after the date of discounting.
Maharashtra Board 12th Commerce Maths Solutions Chapter 1 Commission, Brokerage and Discount Ex 1.2 Q11
∴ Legal due date = 17/09
∴ Nominal due date = 14/09
∴ Period of the bill = 5 months

Maharashtra Board 12th Commerce Maths Solutions Chapter 1 Commission, Brokerage and Discount Ex 1.2

Question 12.
If the difference between true discount and banker’s discount on a sum due 4 months hence is ₹ 20. Find true discount, banker’s discount and amount of bill, the rate of simple interest charged is 5% p.a.
Solution:
Banker’s gain (BG) = Banker’s discount (BD) – True Discount (TD)
∴ BG = ₹ 20
Also, BG = \(\frac{\mathrm{TD} \times n \times r}{100}\)
∴ 20 = \(\frac{\mathrm{TD} \times 4 \times 5}{12 \times 100}\)
∴ 20 = \(\frac{\mathrm{TD}}{60}\)
∴ TD = ₹ 1200
Now, BD = BG + TD
= 20 + 1,200
= ₹ 1,220
Also, BD = \(\frac{\mathrm{FV} \times n \times r}{100}\)
∴ 1,220 = \(\frac{\mathrm{FV} \times 4 \times 5}{12 \times 100}\)
∴ FV = 1,200 × 60 = ₹ 73,200
∴ Amounting the bill = ₹ 73,200

Question 13.
A bill of ₹ 51,000 was drawn on 18th February 2010 for 9 months. It was encashed on 28th June 2010 at 5% p.a. Calculate the banker’s gain and true discount.
Solution:
Face Value = ₹ 51,000
Date of drawing = 18/02/2010
Period of the bill = 9 months
Nominal due date = 18/11/2010
Legal due date = 21/11/2010
Date of discounting = 28/06/2010
Unexpired period
Maharashtra Board 12th Commerce Maths Solutions Chapter 1 Commission, Brokerage and Discount Ex 1.2 Q13
∴ TD = ₹ 1,000
∴ BG = BD – TD
= 1,020 – 1,000
= ₹ 20

Question 14.
A certain sum due 3 months hence is \(\frac{21}{20}\) of the present worth, what is the rate of interest.
Solution:
Maharashtra Board 12th Commerce Maths Solutions Chapter 1 Commission, Brokerage and Discount Ex 1.2 Q14

Maharashtra Board 12th Commerce Maths Solutions Chapter 1 Commission, Brokerage and Discount Ex 1.2

Question 15.
A bill of a certain sum drawn on 28th February 2007 for 8 months was encashed on 26th March 2007 for ₹ 10,992 at 14% p.a. Find the face value of the bill.
Solution:
Date drawing = 28/02/2007
Period of the bill = 8 months
Nominal due date = 28/10/2007
Legal due date = 31/10/2007
Date of discounting = 26/03/2007
Cash value = ₹ 10,992
Rate of interest = 14%
Let face value of the bill = ₹ x
Bankers discount = Face value – Cash value = x – 10,992
Also, Banker s discount = \(\frac{F V \times n \times r}{365 \times 100}\)
Where n is the unexpired days
Maharashtra Board 12th Commerce Maths Solutions Chapter 1 Commission, Brokerage and Discount Ex 1.2 Q15
Thus face value of the bill = ₹ 12,000

Maharashtra Board 12th Commerce Maths Solutions Chapter 1 Commission, Brokerage and Discount Ex 1.1

Balbharati Maharashtra State Board 12th Commerce Maths Digest Pdf Chapter 1 Commission, Brokerage and Discount Ex 1.1 Questions and Answers.

Maharashtra State Board 12th Commerce Maths Solutions Chapter 1 Commission, Brokerage and Discount Ex 1.1

Question 1.
An agent charges a 12% commission on the sales. What does he earn if the total sale amounts to ₹ 48,000? What does the seller get?
Solution:
Rate of commission = 12%
Total sales = ₹ 48,000
Agent’s commission = \(\frac {12}{100}\) × 48,000
= ₹ 5,760
Amount received by the seller = Total sales – commission
= ₹ 8,000 – ₹ 5760
= ₹ 2,240

Question 2.
A salesman receives a 3% commission on sales up to ₹ 50,000 and a 4% commission on sales over ₹ 50,000. Find his total income on the sale of ₹ 2,00,000.
Solution:
Total sales = ₹ 2,00,000
Rate of commission upto ₹ 50,000 = 3%
= \(\frac{3}{100}\) × 50,000
= ₹ 1,500
Rate of commission on the sales over ₹ 50,000 = 4%
Sales over ₹ 50,000 is 2,00,000 – 50,000 = ₹ 1,50,000
Commission on sales over ₹ 50,000 = \(\frac{4}{100}\) × 1,50,000 = ₹ 6,000
His total income = ₹ 1,500 + ₹ 6,000 = ₹ 7,500

Maharashtra Board 12th Commerce Maths Solutions Chapter 1 Commission, Brokerage and Discount Ex 1.1

Question 3.
Ms. Saraswati was paid ₹ 88,000 as commission on the sale of computers at the rate of 12.5%. If the price of each computer was ₹ 32,000, how many computers did she sell?
Solution:
Total commission = ₹ 88,000
Rate of commission = 12.5%
Let the number of computers sold be x
since price of each computer = ₹ 32,000
Total sales = ₹ 32,000x
Total commission = 12.5% of total sales
88,000 = \(\frac{12.5}{100}\) × 32,000x
= \(\frac{125}{1000}\) × 32,000x
x = \(\frac{88,000}{125 \times 32}\)
x = 22

Question 4.
Anita is allowed 6.5% commission on the total sales made by her, plus, a bonus of \(\frac{1}{2}\)% on the sale over ₹ 20,000. If her total commission amounts to ₹ 3,400. Find the sales made by her.
Solution:
Let the total sales made by Anita be ₹ x
Rate of commission = 6.5% of total sales
= \(\frac{6.5}{100} \times x\)
= \(\frac{65 x}{1,000}\)
= \(\frac{13 x}{200}\)
Maharashtra Board 12th Commerce Maths Solutions Chapter 1 Commission, Brokerage and Discount Ex 1.1 Q4

Question 5.
Priya gets a salary of ₹ 15,000 per month and a commission of 8% on sales over ₹ 50,000. If she gets ₹ 17,400 in a certain month. Find the sales made by her in that month.
Solution:
Let the total sales made by Priya be ₹ x
Salary of Priya = ₹ 15,000
Commission = Total earning – salary
= ₹ 17,400 – ₹ 15,000
= ₹ 2,400
Commission = 8% on the sales over ₹ 50,000
2400 = \(\frac{8}{100}\) (x – 50000)
\(\frac{2,400 \times 100}{8}\) = x – 50,000
30,000 = x – 50,000
30,000 + 50,000 = x
∴ x = ₹ 80,000

Maharashtra Board 12th Commerce Maths Solutions Chapter 1 Commission, Brokerage and Discount Ex 1.1

Question 6.
The income of the broker remains unchanged though the rate of commission is increased from 4% to 5%. Find the percentage reduction in the value of the business.
Solution:
Let the original value of business be ₹ 100
Original rate of commission = 4%
∴ Original commission = \(\frac{4}{100}\) × 100 = ₹ 4
Let the new value of business be ₹ x
The new rate of commission = 5%
∴ New commission = \(\frac{5}{100}\) × x = \(\frac{x}{20}\)
Given, original income = New income
4 = \(\frac{x}{20}\)
∴ x = ₹ 80
Thus there is 20% reduction in the value of the business.

Question 7.
Mr. Pavan is paid a fixed weekly salary plus commission based on a percentage of sales made by him. If on the sale of ₹ 68,000 and ₹ 73,000 in two successive weeks, he received in all ₹ 9,880 and ₹ 10,180. Find his weekly salary and the rate of commission paid to him.
Solution:
Let the weekly salary of Mr. Pavan be ₹ x and the rate of commission paid to him be y%
Income = Weekly salary + Commission on the sales
∴ 9,880 = x + \(\frac{y}{100}\) × 68,000
i.e. 9,880 = x + 680y …….(1)
Also, 10,180 = x + \(\frac{y}{100}\) × 73,000
i.e 10,180 = x + 730y ………(2)
Subtracting (1) from (2), we get
50y = 300
∴ y = 6
Substituting y = 6 in equation (1)
9,880 = x + 680(6) ‘
∴ 9,880 – 4,080 = x
∴ x = 5,800
Weekly salary = ₹ 5,800
Rate of commission = 6%

Question 8.
Deepak’s salary was increased from ₹ 4,000 to ₹ 5,000. The sales being the same, due to a reduction in the rate of commission from 3% to 2%, his income remained unchanged. Find his sales.
Solution:
Let Deepak’s total sales be ₹ x
Original salary of Deepak = ₹ 4,000
Original rate of commission = 3%
His new salary = ₹ 5,000
New rate of commission = 2%
Original income = New income (given)
4000 + \(\frac{3 x}{100}\) = 5000 + \(\frac{2 x}{100}\)
\(\frac{3 x}{100}-\frac{2 x}{100}\) = 5,000 – 4,000
\(\frac{x}{100}\) = 1000
x = ₹ 1,00,000
∴ His total sales = ₹ 1,00,000

Maharashtra Board 12th Commerce Maths Solutions Chapter 1 Commission, Brokerage and Discount Ex 1.1

Question 9.
An agent is paid a commission of 7% on cash sales and 5% on credit sales made by him. If on the sale of ₹ 1,02,000 the agent claims a total commission of ₹ 6,420, find his cash sales and credit sales.
Solution:
Total Sales = ₹ 1,02,000
Let cash sales ₹ x
∴ Credit sales = ₹ (1,02,000 – x)
Agent’s commission on cash sales = 7%
= \(\frac{7}{100}\) × x
= \(\frac{7x}{100}\)
Commission on credit sales = 5%
= \(\frac{5}{100}\)(1,02,000 – x)
Given, Total commission = ₹ 6,420
∴ \(\frac{7x}{100}\) + \(\frac{5}{100}\)(1,02,000 – x) = 6420
∴ \(\frac{7x}{100}\) + 5100 – \(\frac{5x}{100}\) = 6,420
∴ \(\frac{2x}{100}\) = 6,420 – 5,100
∴ \(\frac{2x}{100}\) = 1320
∴ x = ₹ 66,000
∴ Cash sales = ₹ 66,000
∴ Credit sales = 1,02000 – 66,000 = ₹ 36,000

Question 10.
Three cars were sold through an agent for ₹ 2,40,000, ₹ 2,22,000 and ₹ 2,25,000 respectively. The rates of the commission were 17.5% on the first, 12.5% on the second. If the agent overall received 14% commission on the total sales, find the rate of commission paid on the third car.
Solution:
Total selling price of three cars = 2,40,000 + 2,22,000 + 2,25,000 = ₹ 6,87,000
Commission on total sales = 14%
= \(\frac{14}{100}\) × 6,87,000
= ₹ 96,180
Selling price of first car = ₹ 2,40,000
Rate of commission = 17.5% = \(\frac{17.5}{100}\) × 2,40,000
∴ Commission on first car = ₹ 42,000
Selling price of second car = ₹ 2,22,000
Rate of commission = 12.5% = \(\frac{12.5}{100}\) × 2,22,000
∴ Commission on second car = ₹ 27,750
Selling price of third car = ₹ 2,25,000
Let the rate of commission be x%
Commission on third car = \(\frac{x}{100}\) × 2,25,000
96,180 – (42,000 + 27,750) = \(\frac{x}{100}\) × 2,25,000
\(\frac{26,430 \times 100}{2,25,000}\) = x
∴ x = 11.75
∴ Rate of commission on the third car = 11.75%

Question 11.
Swatantra Distributors allows a 15% discount on the list price of the washing machines. Further 5% discount is giver for cash payment. Find the list price of the washing machine if it was sold for the net amount of ₹ 38,356.25.
Solution:
Let the list price of the washing machine be ₹ 100
Trade discount = 15% = \(\frac{15}{100}\) × 100 = ₹ 15
∴ Invoice price =100 – 15 = ₹ 85
Cash discount = 5% = \(\frac{5}{100}\) × 85 = ₹ 4.25
∴ Net price = 85 – 4.25 = ₹ 80.75
Thus if List price is 100 than Net price is 80.75
if List price is x than Net price is 38,356.25.
∴ x = \(\frac{38356.25 \times 100}{80.75}\)
∴ x = ₹ 47,500
The list price of the washing machine is ₹ 47,500

Maharashtra Board 12th Commerce Maths Solutions Chapter 1 Commission, Brokerage and Discount Ex 1.1

Question 12.
A bookseller received ₹ 1,530 as a 15% commission on the list price. Find the list price of the books.
Solution:
Let the list price of the books be ₹ x
Rate of commission = 15%
Book seller’s commission = ₹ 1,530
∴ \(\frac{15}{100}\) × x = 1,530
∴ x = \(\frac{1,530 \times 100}{15}\)
∴ x = ₹ 10,200

Question 13.
A retailer sold a suit for ₹ 8,832 after allowing an 8% discount on market price and a further 4% cash discount. If he made 38% profit, find the cost price and the market price of the suit.
Solution:
Let the marked price of the suit be ₹ 100
Trade discount = 8% = \(\frac{8}{100}\) × 100 = ₹ 8
Invoice price = 100 – 8 = ₹ 92
Cash discount = 4% = \(\frac{4}{100}\) × 92 = ₹ 3.68
∴ Net price = 92 – 3.68 = ₹ 88.32
Thus if list price is 100 then net price is 88.32, if list price is x then net price is 8,832
∴ x = \(\frac{8,832 \times 100}{88.32}\)
∴ x = ₹ 10,000
The retailer made 38% profit.
Let the CP of the suit be ₹ 100
∴ SP of the suit = 100 + 38 = ₹ 138
Thus if the SP of the suit is ₹ 138 then its CP is ₹ 100
If the SP of the suit is 88.32 then its
CP = \(\frac{88.32 \times 100}{138}\) = ₹ 6400

Question 14.
An agent charges 10% commission plus 2% delcredere. If he sells goods worth ₹ 37,200, find his total earnings.
Solution:
Total sales = ₹ 37,200
Rate of commission = 10%
Agents commission = \(\frac{4}{100}\) × 37200 = ₹ 3720
Rate of delcredere = 2%
Amount of delcredere = \(\frac{2}{100}\) × 37,200 = ₹ 744
Total earning of the agent = ₹ 3,720 + ₹ 744 = ₹ 4,464

Maharashtra Board 12th Commerce Maths Solutions Chapter 1 Commission, Brokerage and Discount Ex 1.1

Question 15.
A whole seller allows a 25% trade discount and 5% cash discount. What will be the net price of an article marked at ₹ 1600?
Solution:
Marked price of the article = ₹ 1,600
Trade discount = 25%
= \(\frac{25}{100}\) × 1,600
= ₹ 400
∴ Invoice price = 1,600 – 400 = ₹ 1,200
Cash discount = 5%
= \(\frac{5}{100}\) × 1,200
= ₹ 60
∴ Net price = 1,200 – 60 = ₹ 1,140

Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.4

Balbharati Maharashtra State Board 12th Commerce Maths Solution Book Pdf Chapter 8 Probability Distributions Ex 8.4 Questions and Answers.

Maharashtra State Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.4

Question 1.
If X has Poisson distribution with m = 1, then find P(X ≤ 1) given e-1 = 0.3678.
Solution:
∵ m = 1
∵ X follows Poisson Distribution
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.4 Q1
= e-m × 1 + e-m × 1
= e-1 + e-1
= 2 × e-1
= 2 × 0.3678
= 0.7356

Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.4

Question 2.
If X ~ P(\(\frac{1}{2}\)), then find P(X = 3) given e-0.5 = 0.6065.
Solution:
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.4 Q2

Question 3.
If X has Poisson distribution with parameter m and P(X = 2) = P(X = 3), then find P(X ≥ 2). Use e-3 = 0.0497
Solution:
∵ X follows Poisson Distribution
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.4 Q3

Question 4.
The number of complaints which a bank manager receives per day follows a Poisson distribution with parameter m = 4. Find the probability that the manager receives (i) only two complaints on a given day, (ii) at most two complaints on a given day. Use e-4 = 0.0183.
Solution:
∵ m = 1
∵ X ~ P(m = 4)
∴ p(x) = \(\frac{e^{-m} \cdot m^{x}}{x !}\)
X = No. of complaints recieved
(i) P(Only two complaints on a given day)
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.4 Q4

(ii) P(Atmost two complaints on a given day)
P(X ≤ 2) = p(0) + p(1) + p(2)
= \(\frac{e^{-4} \times 4^{0}}{0 !}+\frac{e^{-4} \times 4^{1}}{1 !}\) + 0.1464
= e-4 + e-4 × 4 + 0.1464
= e-4 [1 + 4] + 0.1464
= 0.0183 × 5 + 0.1464
= 0.0915 + 0.1464
= 0.2379

Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.4

Question 5.
A car firm has 2 cars, which are hired out day by day. The number of cars hired on a day follows a Poisson distribution with a mean of 1.5. Find the probability that
(i) no car is used on a given day.
(ii) some demand is refused on a given day, given e-1.5 = 0.2231.
Solution:
Let X = No. of demands for a car on any day
∴ No. of cars hired
n = 2
m = 1.5
∵ X ~ P(m = 1.5)
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.4 Q5

Question 6.
Defects on plywood sheets occur at random with an average of one defect per 50 sq. ft. Find the probability that such a sheet has (i) no defect, (ii) at least one defect. Use e-1 = 0.3678.
Solution:
∵ X = No. of defects on a plywood sheet
∵ m = -1
∵ X ~ P(m = -1)
∴ p(x) = \(\frac{e^{-m} \cdot m^{x}}{x !}\)
(i) P(No defect)
P(X = 0) = \(\frac{e^{-1} \times 1^{0}}{0 !}\)
= e-1
= 0.3678

(ii) P(At least one defect)
P(X ≥ 1) = 1 – P(X < 1)
= 1 – p(0)
= 1 – 0.3678
= 0.6322

Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.4

Question 7.
It is known that, in a certain area of a large city, the average number of rats per bungalow is five. Assuming that the number of rats follows Poisson distribution, find the probability that a randomly selected bungalow has
(i) exactly 5 rats
(ii) more than 5 rats
(iii) between 5 and 7 rats, inclusive. Given e-5 = 0.0067.
Solution:
X = No. of rats
∵ m = 5
∴ X ~ P(m = 5)
∴ p(x) = \(\frac{e^{-m} \cdot m^{x}}{x !}\)
(i) P(Exactly five rats)
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.4 Q7

(ii) P(More than five rats)
P(X > 5) = 1 – P(X ≤ 5)
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.4 Q7.1

(iii) P(between 5 and 7 rats, inclusive)
P(5 ≤ x ≤ 7) = p(5) + p(6) + p(7)
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.4 Q7.2
= 0.0067 × 3125 × 0.02
= 0.0067 × 62.5
= 0.42

Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.3

Balbharati Maharashtra State Board 12th Commerce Maths Solution Book Pdf Chapter 8 Probability Distributions Ex 8.3 Questions and Answers.

Maharashtra State Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.3

Question 1.
A die is thrown 4 times. If ‘getting an odd number’ is a success, find the probability of (i) 2 successes (ii) at least 3 successes (iii) at most 2 successes.
Solution:
X: Getting an odd no.
p: Probability of getting an odd no.
A die is thrown 4 times
∴ n = 4
∵ p = \(\frac{3}{6}=\frac{1}{2}\)
∴ q = 1 – p = 1 – \(\frac{1}{2}\) = \(\frac{1}{2}\)
∵ X ~ B(3, \(\frac{1}{2}\))
∴ p(x) = \({ }^{n} \mathrm{C}_{x} p^{x} q^{n-x}\)
(i) P(Two Successes)
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.3 Q1
(ii) P(Atleast 3 Successes)
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.3 Q1.1
(iii) P(Atmost 2 Successes)
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.3 Q1.2

Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.3

Question 2.
A pair of dice is thrown 3 times. If getting a doublet is considered a success, find the probability of two successes.
Solution:
n: No. of times die is thrown = 3
X: No. of doublets
p: Probability of getting doublets
Getting a doublet means, same no. is obtained on 2 throws of a die
There are 36 outcomes
No. of doublets are (1, 1), (2, 2), (3, 3), (4, 4), (5, 5), (6, 6)
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.3 Q2

Question 3.
There are 10% defective items in a large bulk of items. What is the probability that a sample of 4 items will include not more than one defective item?
Solution:
n: No of sample items = 4
X: No of defective items
p: Probability of getting defective items
∴ p = 0.1
∴ q = 1 – p = 1 – 0.1 = 0.9
X ~ B(4, 0.1)
∴ p(x) = \({ }^{n} \mathrm{C}_{x} p^{x} \mathrm{q}^{n-x}\)
P(Not include more than 1 defective)
P(X ≤ 1) = p(0) + p(1)
= 4C0 (0.1)0 (0.9)4 + 4C1 (0.1)1 (0.9)4-1
= 1 × 1 × (0.9)4 + 4 × 0.1 × (0.9)3
= (0.9)3 [0.9 + 0.4]
= (0.9)3 × 1.3
= 0.977

Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.3

Question 4.
Five cards are drawn successively with replacement from a well-shuffled deck of 52 cards. Find the probability that (i) all the five cards are spades, (ii) only 3 cards are spades, (iii) none is a spade.
Solution:
X: No. of spade cards
Number of cards drawn
∴ n = 5
p: Probability of getting spade card
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.3 Q4
(i) P(All five cards are spades)
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.3 Q4.1
(ii) P(Only 3 cards are spades)
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.3 Q4.2
(iii) P(None is a spade)
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.3 Q4.3

Question 5.
The probability that a bulb produced by a factory will use fuse after 200 days of use is 0.2. Let X denote the number of bulbs (out of 5) that fuse after 200 days of use. Find the probability of (i) X = 0, (ii) X ≤ 1, (iii) X > 1, (iv) X ≥ 1.
Solution:
X : No. of bulbs fuse after 200 days of use
p : Probability of getting fuse bulbs
No. of bulbs in a sample
∴ n = 5
∴ p = 0.2
∴ q = 1 – p = 1 – 0.2 = 0.8
∵ X ~ B(5, 0.2)
∴ p(x) = \({ }^{n} \mathrm{C}_{x} p^{x} q^{n-x}\)
(i) P(X = 0) = 5C0 (0.2)0 (0.8)5-0
= 1 × 1 × (0.8)5
= (0.8)5

(ii) P(X ≤ 1) = p(0) + p(1)
= 5C0 (0.2)0 (0.8)5-0 + 5C1 (0.2)1 (0.8)5-1
= 1 × 1 × (0.8)5 + 5 × 0.2 × (0.8)4
= (0.8)4 [0.8 + 1]
= 1.8 × (0.8)4

(iii) P(X > 1) = 1 – [p(0) + p(1)]
= 1 – 1.8 × (0.8)4

(iv) P(X ≥ 1) = 1 – p(0)
= 1 – (0.8)5

Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.3

Question 6.
10 balls are marked with digits 0 to 9. If four balls are selected with replacement. What is the probability that none is marked 0?
Solution:
X : No. of balls drawn marked with the digit 0
n : No. of balls drawn
∴ n = 4
p : Probability of balls marked with 0.
∴ p = \(\frac{1}{10}\)
∴ q = 1 – p = 1 – \(\frac{1}{10}\) = \(\frac{9}{10}\)
p(x) = \({ }^{n} C_{x} p^{x} q^{n-x}\)
P(None of the ball is marked with digit 0)
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.3 Q6

Question 7.
In a multiple-choice test with three possible answers for each of the five questions, what is the probability of a candidate getting four or more correct answers by random choice?
Solution:
n: No. of Questions
∴ n = 5
X: No. of correct answers by guessing
p: Probability of getting correct answers
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.3 Q7

Question 8.
Find the probability of throwing at most 2 sixes in 6 throws of a single die.
Solution:
X : No. of sixes in 6 throws
n : No. of times dice thrown
∴ n = 6
p : Probability of getting six
∴ p = \(\frac{1}{6}\)
∴ q = 1 – p = 1 – \(\frac{1}{6}\) = \(\frac{5}{6}\)
∵ X ~ B(6, \(\frac{1}{6}\))
∴ p(x) = \({ }^{n} \mathrm{C}_{x} p^{x} q^{n-x}\)
P(At most 2 sixes)
P(X ≤ 2) = p(0) + p(1) + p(2)
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.3 Q8

Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.3

Question 9.
Given that X ~ B(n, p),
(i) if n = 10 and p = 0.4, find E(X) and Var(X).
(ii) if p = 0.6 and E(X) = 6, find n and Var(X).
(iii) if n = 25, E(X) = 10, find p and Var(X).
(iv) if n = 10, E(X) = 8, find Var(X).
Solution:
∵ X ~ B (n, p), E(X) = np, V(X) = npq, q = 1 – p
(i) E(X) = np = 10 × 0.4 = 4
∵ q = 1 – p = 1 – 0.4 = 0.6
V(X) = npq = 10 × 0.4 × 0.6 = 2.4

(ii) ∵ p = 0.6
∴ q = 1 – p = 1 – 0.6 = 0.4
E(X) = np
∴ 6 = n × 0.6
∴ n = 10
∴ V(X) = npq = 10 × 0.6 × 0.4 = 2.4

(iii) E(X) = np
∴ 10 = 25 × p
∴ p = 0.4
∴ q = 1, p = 1 – 0.4 = 0.6
∴ S.D.(X) = √V(X)
= \(\sqrt{n p q}\)
= \(\sqrt{25 \times 0.4 \times 0.6}\)
= √6
= 2.4494

(iv) ∵ E(X) = np
∴ 8 = 10p
∴ p = 0.8
∴ q = 1 – p = 1 – 0.8 = 0.2
∵ V(X) = npq = 10 × 0.8 × 0.2 = 1.6

Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.2

Balbharati Maharashtra State Board 12th Commerce Maths Solution Book Pdf Chapter 8 Probability Distributions Ex 8.2 Questions and Answers.

Maharashtra State Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.2

Question 1.
Check whether each of the following is p.d.f.
(i) \(f(x)= \begin{cases}x & \text { for } 0 \leq x \leq 1 \\ 2-x & \text { for } 1<x \leq 2\end{cases}\)
Solution:
Given function is
f(x) = x, 0 ≤ x ≤ 1
Each f(x) ≥ 0, as x ≥ 0.
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.2 Q1(i)
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.2 Q1(i).1
∴ The given function is a p.d.f. of x.

(ii) f(x) = 2 for 0 < x < 1
Solution:
Given function is
f(x) = 2 for 0 < x < 1 Each f(x) > 0,
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.2 Q1(ii)
∴ The given function is not a p.d.f.

Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.2

Question 2.
The following is the p.d.f. of a r.v. X.
\(f(x)= \begin{cases}\frac{x}{8} & \text { for } 0<x<4 \\ 0 & \text { otherwise }\end{cases}\)
Find (i) P(X < 1.5), (ii) P(1 < X < 2), (iii) P(X > 2)
Solution:
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.2 Q2
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.2 Q2.1

Question 3.
It is felt that error in measurement of reaction temperature (in Celsius) in an experiment is a continuous r.v. with p.d.f.
\(f(x)= \begin{cases}\frac{x^{3}}{64} & \text { for } 0 \leq x \leq 4 \\ 0 & \text { otherwise }\end{cases}\)
(i) Verify whether f(x) is a p.d.f.
(ii) Find P(0 < X ≤ 1).
(iii) Find the probability that X is between 1 and 3.
Solution:
(i) f(x) is p.d.f. of r.v. X if
(a) f(x) ≥ 0, ∀ x ∈ R
(b) \(\int_{0}^{4} f(x) d x\) = 1
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.2 Q3
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.2 Q3.1

Question 4.
Find k, if the following function represents the p.d.f. of a r.v. X.
(i) \(f(x)= \begin{cases}k x & \text { for } 0<x<2 \\ 0 & \text { otherwise }\end{cases}\)
Also find P[\(\frac{1}{4}\) < X < \(\frac{1}{2}\)]
Solution:
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.2 Q4(i)
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.2 Q4(i).1

(ii) \(f(x)= \begin{cases}k x(1-x) & \text { for } 0<x<1 \\ 0 & \text { otherwise }\end{cases}\)
Also find (a) P[\(\frac{1}{4}\) < X < \(\frac{1}{2}\)], (b) P[X < \(\frac{1}{2}\)]
Solution:
We know that
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.2 Q4(ii)
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.2 Q4(ii).1
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.2 Q4(ii).2

Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.2

Question 5.
Let X be the amount of time for which a book is taken out of the library by a randomly selected student and suppose that X has p.d.f.
\(f(x)= \begin{cases}0.5 x & \text { for } 0 \leq x \leq 2 \\ 0 & \text { otherwise }\end{cases}\)
Calculate (i) P(X ≤ 1), (ii) P(0.5 ≤ X ≤ 1.5), (iii) P(X ≥ 1.5).
Solution:
Given p.d.f. of X is f(x) = 0.5x for 0 ≤ x ≤ 2
∴ Its c.d.f. F(x) is given by
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.2 Q5

(i) P(X < 1) = F(1)
= 0.25(1)2
= 0.25

(ii) P(0.5 < X < 1.5) = F(1.5) – F(0.5)
= 0.25(1.5)2 – 0.25(0.5)2
= 0.25[2.25 – 0.25]
= 0.25(2)
= 0.5

(iii) P(X ≥ 1.5) = 1 – P(X ≤ 1.5)
= 1 – F(1.5)
= 1 – 0.25(1.5)2
= 1 – 0.25(2.25)
= 1 – 0.5625
= 0.4375

Question 6.
Suppose X is the waiting time (in minutes) for a bus and its p.d.f. is given by
\(f(x)=\left\{\begin{array}{cl}
\frac{1}{5} & \text { for } 0 \leq x \leq 5 \\
0 & \text { otherwise }
\end{array}\right.\)
Find the probability that (i) waiting time is between 1 and 3 minutes, (ii) waiting time is more than 4 minutes.
Solution:
p.d.f. of r.v. X is given by
f(x) = \(\frac{1}{5}\) for 0 ≤ x ≤ 5
This is a constant function.
(i) Probability that waiting time X is between 1 and 3 minutes
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.2 Q6
(ii) Probability that waiting time X is more than 4 minutes
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.2 Q6.1

Question 7.
Suppose error involved in making a certain measurement is a continuous r.v. X with p.d.f.
\(f(x)= \begin{cases}k\left(4-x^{2}\right) & \text { for }-2 \leq x \leq 2 \\ 0 & \text { otherwise }\end{cases}\)
Compute (i) P(X > 0), (ii) P(-1 < X < 1), (iii) P(X < -0.5 or X > 0.5)
Solution:
Since given f(x) is a p.d.f. of r.v. X
Since -2 ≤ x ≤ 2
∴ x2 ≤ 4
∴ 4 – x2 ≥ 0
∴ k(4 – x2) ≥ 0
∴ k ≥ 0 [∵ f(x) ≥ 0]
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.2 Q7
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.2 Q7.1
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.2 Q7.2
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.2 Q7.3

Question 8.
Following is the p.d.f. of a continuous r.v. X.
\(f(x)= \begin{cases}\frac{x}{8} & \text { for } 0<x<4 \\ 0 & \text { otherwise }\end{cases}\)
(i) Find an expression for the c.d.f. of X.
(ii) Find F(x) at x = 0.5, 1.7, and 5.
Solution:
The p.d.f. of a continuous r.v. X is
\(f(x)= \begin{cases}\frac{x}{8} & \text { for } 0<x<4 \\ 0 & \text { otherwise }\end{cases}\)
(i) c.d.f. of continuous r.v. X is given by
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.2 Q8

(ii) F(0.5) = \(\frac{(0.5)^{2}}{16}=\frac{0.25}{16}=\frac{1}{64}\) = 0.015
F(1.7) = \(\frac{(1.7)^{2}}{16}=\frac{2.89}{16}\) = 0.18
For any of x greater than or equal to 4, F(x) = 1
∴ F(5) = 1

Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.2

Question 9.
The p.d.f. of a continuous r.v. X is
\(f(x)=\left\{\begin{array}{cl}
\frac{3 x^{2}}{8} & \text { for } 0<x<2 \\
0 & \text { otherwise }
\end{array}\right.\)
Determine the c.d.f. of X and hence find (i) P(X < 1), (ii) P(X < -2), (iii) P(X > 0), (iv) P(1 < X < 2).
Solution:
The p.d.f. of a continuous r.v. X is
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.2 Q9
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.2 Q9.1

Question 10.
If a r.v. X has p.d.f.
\(f(x)= \begin{cases}\frac{c}{x} & \text { for } 1<x<3, c>0 \\ 0 & \text { otherwise }\end{cases}\)
Find c, E(X) and V(X). Also find f(x).
Solution:
The p.d.f. of r.v. X is
f(x) = \(\frac{c}{x}\), 1 < x < 3, c > 0
For p.d.f. of X, we have
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.2 Q10
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.2 Q10.1
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.2 Q10.2
Maharashtra Board 12th Commerce Maths Solutions Chapter 8 Probability Distributions Ex 8.2 Q10.3