Please wait...

Mathematics Test - 24
Menu grid icon
Red alarm icon Time Left -
  • Question 1/10
    5 / -1
    What is the interpretation of the shaded region in a Linear Programming Problems?
  • Question 2/10
    5 / -1

    In the problem Z = 3x1 + 2x2

    Subject to 2x1 + x2 ≤ 20         ---(i)

    x1 ≤ 10        ---(ii)

    x1, x2 ≥ 0     ---(iii)

    constraint (iii) is known as

  • Question 3/10
    5 / -1
    Simplex method of solving linear programming problem uses
  • Question 4/10
    5 / -1

    Consider the following LPP:

    Maximize z = 60X1 + 50X2

    Subject to X1 + 2X2 ≤ 40,

    3X1 + 2X2 ≤ 60

    where, X1 and X2 ≥ 0

  • Question 5/10
    5 / -1
    While solving a linear programming model, if a redundant constraint is added, then what will be its effect on existing solution?
  • Question 6/10
    5 / -1

    Consider the following Linear Programming Problem (LPP).

    Maximise Z = x1 + 2x2

    Subject to:

    x1 ≤ 2

    x2 ≤ 2

    x1 + x2 ≤ 2

    x1, x2 ≥ 0 (i.e. +ve decision variables)

    What is the optimal solution  to the above LPP?

  • Question 7/10
    5 / -1

    A manufacturing unit produces two products Pl and P2. For each piece of P1 and P2, the table below provides quantities of materials M1, M2, and M3 required, and also the profit earned. The maximum quantity available per day for M1, M2 and M3 is also provided. Then which of the following mathematical formulation is correct for this L.P.P.?

     

    M1

    M2

    M3

    Profit per piece (Rs.)

    P1 ( x1)

    2

    2

    0

    150

    P2 (x2.)

    3

    1

    2

    100

    Maximum quantity available per day

    70

    50

    40

     

    Where the number of the products of P! and P2 types are x1  and x2.

  • Question 8/10
    5 / -1

    Max z = x1 + x2 subject to constraints:

    x1 + x2 ≤ 1

    -3x1 + x2 ≥ 3

    x1, x2 ≥ 0

    For the above LPP, the solution is
  • Question 9/10
    5 / -1

    Consider the following Linear Programming Problem (LPP):

    Maximize Z = 3x1 + 2x2 Subject to       

    x1 ≤ 4

    x2 ≤ 6

    3x1 + 2x2 ≤ 18

    x1 ≥ 0, x2 ≥ 0

  • Question 10/10
    5 / -1

    An objective function is given by

    Z(x1, x2) = 3x1 + 9x2

    The constraints are:

    x1 + x2 ≤ 8; x1 + 2x2 ≤ 4; x1 ≥ 0; x2 ≥ 0

    What will be the maximum value of the objective function?

Close button icon
User Profile
-

Answered - 0

Un-answered - 10

  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 7
  • 8
  • 9
  • 10
Mockers logo Get latest Exam Updates
& Study Material Alerts!
No, Thanks
Arrow pointer icon
Click on Allow to receive notifications
Notification bell icon ×
Open Now