मराठी

Anil Wants to Invest at Most Rs 12000 in Saving Certificates and National Saving Bonds. , He Has to Invest at Least Rs 2000 in Saving Certificates and at Least Rs 4000 in National Saving Bonds

Advertisements
Advertisements

प्रश्न

Anil wants to invest at most Rs 12000 in Saving Certificates and National Saving Bonds. According to rules, he has to invest at least Rs 2000 in Saving Certificates and at least Rs 4000 in National Saving Bonds. If the rate of interest on saving certificate is 8% per annum and the rate of interest on National Saving Bond is 10% per annum, how much money should he invest to earn maximum yearly income? Find also his maximum yearly income.

बेरीज
Advertisements

उत्तर

Let Anil invests Rs x  in Saving certificates and Rs y in National Saving bonds.
Therefore , 

\[ x, y \geq 0\]  

Anil wants to invest at most Rs 12000 in Saving Certificates and National Saving Bonds.

\[x + y \leq 12000\]

According to rules, he has to invest at least Rs 2000 in Saving Certificates and at least Rs 4000 in National Saving Bonds.

\[x \geq 2000\]

\[y \geq 4000\]

If the rate of interest on saving certificate is 8% per annum and the rate of interest on National Saving Bond is 10% per annum.

Total earning from investment = Z = \[\frac{8x}{100} + \frac{10y}{100}\]  which is to be maximised.

Thus, the mathematical formulat​ion of the given linear programmimg problem is 

Max Z =\[\frac{8x}{100} + \frac{10y}{100}\]

subject to

\[x + y \leq 12000\]
\[x \geq 2000\]
\[y \geq 4000\]

\[x, y \geq 0\]

First we will convert inequations into equations as follows:
+ y =12000, x = 2000, = 4000, x = 0 and y = 0

Region represented by x y ≤ 12000:
The line x + y = 12000 meets the coordinate axes at A(12000, 0) and B(0, 12000) respectively. By joining these points we obtain the line x + y = 12000. Clearly (0,0) satisfies the inequation x y ≤ 12000. So,the region which contains the origin represents the solution set of the inequation x y ≤ 12000.

Region represented by x  ≥ 2000:
The line x  = 2000 is the line that passes through (2000, 0) and is parallel to Y axis.The region to the right of the line x  = 2000 will satisfy the inequation x  ≥ 2000.

Region represented by  ≥ 4000:
The line y = 4000 is the line that passes through (0, 4000) and is parallel to X axis.The region above the line y = 4000 will satisfy the inequation ≥ 4000.

Region represented by ≥ 0 and y ≥ 0:
Since, every point in the first quadrant satisfies these inequations. So, the first quadrant is the region represented by the inequations x ≥ 0, and y ≥ 0.

The feasible region determined by the system of constraints is

The corner points are E(2000, 10000), D(8000, 4000), C(2000, 4000) 

The values of Z at these corner points are as follows
 

Corner point Z=\[\frac{8x}{100} + \frac{10y}{100}\]
E 1160
D 1040
C 560


The maximum value of Z is 1160 which is attained at E(2000, 10000.
Thus, the maximum earning is Rs 1160 obtained when Rs 2000 were invested in Saving's certificates and Rs 10000 were invested in National Saving Bond.

shaalaa.com
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
पाठ 29: Linear programming - Exercise 30.4 [पृष्ठ ५३]

APPEARS IN

आर.डी. शर्मा Mathematics Volume 1 and 2 [English] Class 12
पाठ 29 Linear programming
Exercise 30.4 | Q 24 | पृष्ठ ५३

व्हिडिओ ट्यूटोरियलVIEW ALL [1]

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

Minimize: Z = 6x + 4y

Subject to the conditions:

3x + 2y ≥ 12,

x + y ≥ 5,

0 ≤ x ≤ 4,

0 ≤ y ≤ 4


A retired person wants to invest an amount of Rs. 50, 000. His broker recommends investing in two type of bonds ‘A’ and ‘B’ yielding 10% and 9% return respectively on the invested amount. He decides to invest at least Rs. 20,000 in bond ‘A’ and at least Rs. 10,000 in bond ‘B’. He also wants to invest at least as much in bond ‘A’ as in bond ‘B’. Solve this linear programming problem graphically to maximise his returns.


Minimum and maximum z = 5x + 2y subject to the following constraints:

x-2y ≤ 2

3x+2y ≤ 12

-3x+2y ≤ 3

x ≥ 0,y ≥ 0


Solve the following L. P. P. graphically:Linear Programming

Minimize Z = 6x + 2y

Subject to

5x + 9y ≤ 90

x + y ≥ 4

y ≤ 8

x ≥ 0, y ≥ 0


A dietician wishes to mix two kinds ·of food X· and Y in such a way that the  mixture contains at least 10 units of vitamin A, 12 units of vitamin B arid 8 units of vitamin C. The vitamin contents of one kg food is given below:

Food Vitamin A Vitamin.B Vitamin C
X 1 unit 2 unit 3 unit
Y 2 unit 2 unit 1 unit

Orie kg of food X costs Rs 24 and one kg of food Y costs Rs 36. Using Linear Programming, find the least cost of the total mixture. which will contain the required vitamins.


Maximize Z = 50x + 30y
Subject to 

\[2x + y \leq 18\]
\[3x + 2y \leq 34\]
\[ x, y \geq 0\]


Maximize Z = 2x + 3y
Subject to

\[x + y \geq 1\]
\[10x + y \geq 5\]
\[x + 10y \geq 1\]
\[ x, y \geq 0\]


Maximize Z = x + y
Subject to

\[- 2x + y \leq 1\]
\[ x \leq 2\]
\[ x + y \leq 3\]
\[ x, y \geq 0\]


A dietician mixes together two kinds of food in such a way that the mixture contains at least 6 units of vitamin A, 7 units of vitamin B, 11 units of vitamin and 9 units of vitamin D. The vitamin contents of 1 kg of food X and 1 kg of food Y are given below:

  Vitamin
A
Vitamin
B

Vitamin
C

Vitamin
D
Food X
Food Y
1
2
1
1
1
3
2
1

One kg food X costs Rs 5, whereas one kg of food Y costs Rs 8. Find the least cost of the mixture which will produce the desired diet.


A manufacturer has three machines installed in his factory. machines I and II are capable of being operated for at most 12 hours whereas Machine III must operate at least for 5 hours a day. He produces only two items, each requiring the use of three machines. The number of hours required for producing one unit each of the items on the three machines is given in the following table:

Item Number of hours required by the machine

A
B
I II III
1
2
2
1
1
5/4

He makes a profit of Rs 6.00 on item A and Rs 4.00 on item B. Assuming that he can sell all that he produces, how many of each item should he produces so as to maximize his profit? Determine his maximum profit. Formulate this LPP mathematically and then solve it.


A factory manufactures two types of screws, A and B, each type requiring the use of two machines - an automatic and a hand-operated. It takes 4 minute on the automatic and 6 minutes on the hand-operated machines to manufacture a package of screws 'A', while it takes 6 minutes on the automatic and 3 minutes on the hand-operated machine to manufacture a package of screws 'B'. Each machine is available for at most 4 hours on any day. The manufacturer can sell a package of screws 'A' at a profit of 70 P and screws 'B' at a profit of Rs 1. Assuming that he can sell all the screws he can manufacture, how many packages of each type should the factory owner produce in a day in order to maximize his profit? Determine the maximum profit.


A factory owner purchases two types of machines, A and B, for his factory. The requirements and limitations for the machines are as follows:

  Area occupied by the
machine
Labour force for each
machine
Daily output in
units
Machine A
Machine B
1000 sq. m
1200 sq. m
12 men
8 men
60
40

He has an area of 7600 sq. m available and 72 skilled men who can operate the machines.
How many machines of each type should he buy to maximize the daily output?


A manufacturer produces two types of steel trunks. He has two machines A and B. For completing, the first types of the trunk requires 3 hours on machine A and 3 hours on machine B, whereas the second type of the trunk requires 3 hours on machine A and 2 hours on machine B. Machines A and B can work at most for 18 hours and 15 hours per day respectively. He earns a profit of Rs 30 and Rs 25 per trunk of the first type and the second type respectively. How many trunks of each type must he make each day to make maximum profit?


A manufacturer of patent medicines is preparing a production plan on medicines, A and B. There are sufficient raw materials available to make 20000 bottles of A and 40000 bottles of B, but there are only 45000 bottles into which either of the medicines can be put. Further, it takes 3 hours to prepare enough material to fill 1000 bottles of A, it takes 1 hour to prepare enough material to fill 1000 bottles of B and there are 66 hours available for this operation. The profit is Rs 8 per bottle for A and Rs 7 per bottle for B. How should the manufacturer schedule his production in order to maximize his profit?


An aeroplane can carry a maximum of 200 passengers. A profit of Rs 400 is made on each first class ticket and a profit of Rs 600 is made on each economy class ticket. The airline reserves at least 20 seats of first class. However, at least 4 times as many passengers prefer to travel by economy class to the first class. Determine how many each type of tickets must be sold in order to maximize the profit for the airline. What is the maximum profit.


A small firm manufacturers items A and B. The total number of items A and B that it can manufacture in a day is at the most 24. Item A takes one hour to make while item B takes only half an hour. The maximum time available per day is 16 hours. If the profit on one unit of item A be Rs 300 and one unit of item B be Rs 160, how many of each type of item be produced to maximize the profit? Solve the problem graphically.


A company manufactures two articles A and B. There are two departments through which these articles are processed: (i) assembly and (ii) finishing departments. The maximum capacity of the first department is 60 hours a week and that of other department is 48 hours per week. The product of each unit of article A requires 4 hours in assembly and 2 hours in finishing and that of each unit of B requires 2 hours in assembly and 4 hours in finishing. If the profit is Rs 6 for each unit of A and Rs 8 for each unit of B, find the number of units of A and B to be produced per week in order to have maximum profit.


A manufacturer makes two products, A and B. Product A sells at Rs 200 each and takes 1/2 hour to make. Product B sells at Rs 300 each and takes 1 hour to make. There is a permanent order for 14 units of product A and 16 units of product B. A working week consists of 40 hours of production and the weekly turn over must not be less than Rs 10000. If the profit on each of product A is Rs 20 and an product B is Rs 30, then how many of each should be produced so that the profit is maximum? Also find the maximum profit.

 


A factory makes tennis rackets and cricket bats. A tennis racket takes 1.5 hours of machine time and 3 hours of craftman's time in its making while a cricket bat takes 3 hours of machine time and 1 hour of craftman's time. In a day, the factory has the availability of not more than 42 hours of machine time and 24 hours of craftman's time. If the profit on a racket and on a bat is Rs 20 and Rs 10 respectively, find the number of tennis rackets and cricket bats that the factory must manufacture to earn the maximum profit. Make it as an LPP and solve it graphically.


 There are two types of fertilisers 'A' and 'B' . 'A' consists of 12% nitrogen and 5% phosphoric acid whereas 'B' consists of 4% nitrogen and 5% phosphoric acid. After testing the soil conditions, farmer finds that he needs at least 12 kg of nitrogen and 12 kg of phosphoric acid for his crops. If 'A' costs ₹10 per kg and 'B' cost ₹8 per kg, then graphically determine how much of each type of fertiliser should be used so that nutrient requiremnets are met at a minimum cost


A company manufactures two types of novelty souvenirs made of plywood. Souvenirs of type A
require 5 minutes each for cutting and 10 minutes each for assembling. Souvenirs of type B require 8 minutes each for cutting and 8 minutes each for assembling. There are 3 hours and 20 minutes available  for cutting and 4 hours available for assembling. The profit is Rs. 50 each for type A and Rs. 60 each  for type B souvenirs. How many souvenirs of each type should the company manufacture in order to  maximize profit? Formulate the above LPP and solve it graphically and also find the maximum profit. 


The graph of the inequality 3X − 4Y ≤ 12, X ≤ 1, X ≥ 0, Y ≥ 0 lies in fully in


The minimum value of z = 10x + 25y subject to 0 ≤ x ≤ 3, 0 ≤ y ≤ 3, x + y ≥ 5 is ______.


The maximum value of Z = 5x + 4y, Subject to y ≤ 2x, x ≤ 2y, x + y ≤ 3, x ≥ 0, y ≥ 0 is ______.


For the function z = 19x + 9y to be maximum under the constraints 2x + 3y ≤ 134, x + 5y ≤ 200, x ≥ 0, y ≥ 0; the values of x and y are ______.


The feasible region of an LPP is shown in the figure. If z = 3x + 9y, then the minimum value of z occurs at ______.


Maximise and Minimise Z = 3x – 4y subject to x – 2y ≤ 0, – 3x + y ≤ 4, x – y ≤ 6, x, y ≥ 0


Let R be the feasible region (convex polygon) for a linear programming problem and let Z = ax + by be the objective function. When Z has an optimal value (maximum or minimum), where the variables x and y are subject to constraints described by linear inequalities,


The feasible region (shaded) for a L.P.P is shown in the figure. The maximum Z = 5x + 7y is ____________.


Which of the statements describe the solution set for `-2(x + 8) = - 2x + 20`?


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


The shaded part of given figure indicates in feasible region, then the constraints are:


The objective function Z = x1 + x2, subject to the constraints are x1 + x2 ≤ 10, – 2x1 + 3x2 ≤ 15, x1 ≤ 6, x1, x2 ≥ 0, has maximum value ______ of the feasible region.


The objective function Z = ax + by of an LPP has maximum vaiue 42 at (4, 6) and minimum value 19 at (3, 2). Which of the following is true?


Draw the rough graph and shade the feasible region for the inequalities x + y ≥ 2, 2x + y ≤ 8, x ≥ 0, y ≥ 0.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×