JEE Questions for Maths Miscellaneous Quiz 16 - MCQExams.com

Mohan wants to invest the total amount of Rs. 15,000 in saving certificates and national saving bonds. According to rules, he has to invest at least Rs. 2000 in saving certificates and Rs. 2500 in national saving bonds. The interest rate is 8% on saving certificate and 10% on national saving bonds per annum. He invest x in saving certificates and y in national saving bonds. Then the objective function for this problem is

  • Maths-Miscellaneous-43322.png
  • 2)
    Maths-Miscellaneous-43323.png

  • Maths-Miscellaneous-43324.png

  • Maths-Miscellaneous-43325.png
A film produces two types of products A and B. The profit on both is 2 per item. Every product requires processing on machines M1 and M2. For A, machines M1 and M2 takes 1 minute and 2 minute respectively and for B, machines M1 and M2 takes the rime 1 minute each. The machines M1, M2 are not available more

  • Maths-Miscellaneous-43327.png
  • 2)
    Maths-Miscellaneous-43328.png

  • Maths-Miscellaneous-43329.png

  • Maths-Miscellaneous-43330.png

Maths-Miscellaneous-43332.png

  • Maths-Miscellaneous-43333.png
  • 2)
    Maths-Miscellaneous-43334.png

  • Maths-Miscellaneous-43335.png

  • Maths-Miscellaneous-43336.png
The objective function in the above question is
  • 2x + y
  • x + 2y
  • 2x + 2y
  • 8x + by
The objective function for the above question is
  • 10x + 14y
  • 5x + 10y
  • 3x + 5y
  • 5y + 3x
The vertices of a feasible region of the above question are
  • (0, 18), (36, 0)
  • (0, 18), (10,
  • (10, 13), (8,
  • (10, 13), (8, 14), (12,
The maximum value of objective function in the above question is
  • 100
  • 92
  • 95
  • 94
A factory produces two products A and B. In the manufacturing of product A, the machine and the carpenter requires 3 hour each and in manufacturing of product B, the machine and carpenter requires 5 hour and 3 hour respectively The machine and carpenter work at most 80 hour and 50 hour per week respectively. The profit on A and B is Rs. 6 and 8 respectively. If profit is maximum by manufacturing x and y units of A and B type product respectively, then for the function 6x + 8y the constraints are

  • Maths-Miscellaneous-43340.png
  • 2)
    Maths-Miscellaneous-43341.png

  • Maths-Miscellaneous-43342.png

  • Maths-Miscellaneous-43343.png
A shopkeeper wants to purchase two articles A and B of cost price Rs. 4 and 3 respectively. He thought that he may earn 30 paise by selling article A and 10 paise by selling article B. He has not to purchase total article worth more than Rs. 24. If he purchases the number of articles of A and B, x and y respectively, then linear constraints are

  • Maths-Miscellaneous-43345.png
  • 2)
    Maths-Miscellaneous-43346.png

  • Maths-Miscellaneous-43347.png

  • Maths-Miscellaneous-43348.png
In the above question the iso-profit line is
  • 3x + y = 30
  • x + 3y = 20
  • 3x – y = 20
  • 4x + 3y = 24
The sum of two positive integers is at most 5. The difference between two times of second number and first number is at most 4. If the first number is x and second number y, then for maximizing the product of these two numbers, the mathematical formulation is

  • Maths-Miscellaneous-43351.png
  • 2)
    Maths-Miscellaneous-43352.png

  • Maths-Miscellaneous-43353.png
  • None of these

Maths-Miscellaneous-43355.png
  • 12
  • 24
  • 36
  • 40

Maths-Miscellaneous-43357.png
  • 2
  • 8
  • 10
  • 12

Maths-Miscellaneous-43359.png
  • There is a bounded solution
  • There is no solution
  • There are infinite solutions
  • None of the above

Maths-Miscellaneous-43361.png
  • 15
  • 36
  • 60
  • 40
A linear programming of linear functions deals with
  • Minimizing
  • Optimizing
  • Maximizing
  • None of these

Maths-Miscellaneous-43363.png
  • -10
  • -20
  • 0
  • 10

Maths-Miscellaneous-43365.png
  • (0, 0)
  • (1.5, 1.
  • (2,
  • (0,
The minimum value of objective function c = 2x + 2y in the given feasible region, is
Maths-Miscellaneous-43367.png
  • 134
  • 40
  • 38
  • 80

Maths-Miscellaneous-43369.png
  • 10
  • 12
  • 6
  • 5

Maths-Miscellaneous-43371.png
  • x = 0, y = 0, z = 0
  • x = 3, y =3, z = 6
  • There are infinitely solutions
  • None of the above

Maths-Miscellaneous-43372.png

  • Maths-Miscellaneous-43373.png
  • 2)
    Maths-Miscellaneous-43374.png

  • Maths-Miscellaneous-43375.png

  • Maths-Miscellaneous-43376.png

Maths-Miscellaneous-43378.png
  • x = 12,y = 18
  • x = 18, y = 12
  • x = 12,y = 12
  • x = 20, y = 10
An industry produces two types of models M1, M2. Each M1 model needs 4 hours for grinding and 2 hours for polishing, whereas each M2 model needs 2 hours for grinding and 5 hours for polishing. There are 2 grinders and 3 polishers in the industry. Each grinder can work for 40 hours a week whilc each polisher can work for 60 hours a week. Each M1 model earns a profit of 3 and each M2 model earns 4 profit. To ensure the maximum profit the production capacity allocated to two types of models in a week is
  • 2,35
  • 35,2
  • 10, 25
  • None of these

Maths-Miscellaneous-43381.png

  • Maths-Miscellaneous-43382.png
  • 2)
    Maths-Miscellaneous-43383.png

  • Maths-Miscellaneous-43384.png

  • Maths-Miscellaneous-43385.png

Maths-Miscellaneous-43387.png
  • 36
  • 40
  • 20
  • None of these

Maths-Miscellaneous-43389.png
  • b and d
  • b only
  • d only
  • a only

Maths-Miscellaneous-43390.png

  • Maths-Miscellaneous-43391.png
  • 2)
    Maths-Miscellaneous-43392.png

  • Maths-Miscellaneous-43393.png

  • Maths-Miscellaneous-43394.png

Maths-Miscellaneous-43396.png
  • (15, 10)
  • (10, 15)
  • (0, 18)
  • (20, 0)
Variables of the objective function of the linear programming problem are
  • Zero
  • Zero or positive
  • Negative
  • Zero or negative

Maths-Miscellaneous-43398.png
  • (12, 18)
  • (18, 12)
  • (15, 15)
  • None of these

Maths-Miscellaneous-43400.png
  • No feasible solution
  • Unique optimal solution
  • A finite number of optimal solutions
  • Infinite number of optimal solutions

Maths-Miscellaneous-43402.png
  • 130
  • 120
  • 40
  • 140

Maths-Miscellaneous-43404.png
  • 14
  • 20
  • 10
  • 16

Maths-Miscellaneous-43406.png
  • (20, 0)
  • (15, 5)
  • (0, 5)
  • (0, 20)
All points lying inside the triangle formed by the points (1, 3), (5,and (-1,satisfy

  • Maths-Miscellaneous-43408.png
  • 2)
    Maths-Miscellaneous-43409.png

  • Maths-Miscellaneous-43410.png
  • All of these
In LPP, ΔJ for all basic variables is equal to
  • 1
  • -1
  • 0
  • None of these
0:0:1


Answered Not Answered Not Visited Correct : 0 Incorrect : 0

Practice Maths Quiz Questions and Answers