Self Studies

Linear Programm...

TIME LEFT -
  • Question 1
    1 / -0

    Corner points of the feasible region for an LPP are (0, 2), (3, 0), (6, 0), (6, 8) and (0, 5). Let F = 4x + 6y be the objective function. Maximum of F – Minimum of F =

  • Question 2
    1 / -0

    Corner points of the feasible region determined by the system of linear constraints are (0, 3), (1, 1) and (3, 0). Let Z = px+qy, where p, q > 0. Condition on p and q so that the minimum of Z occurs at (3, 0) and (1, 1) is

  • Question 3
    1 / -0

    In a LPP, the linear inequalities or restrictions on the variables are called

Submit Test
Self Studies
User
Question Analysis
  • Answered - 0

  • Unanswered - 3

  • 1
  • 2
  • 3
Submit Test
Self Studies Get latest Exam Updates
& Study Material Alerts!
No, Thanks
Self Studies
Click on Allow to receive notifications
Allow Notification
Self Studies
Self Studies Self Studies
To enable notifications follow this 2 steps:
  • First Click on Secure Icon Self Studies
  • Second click on the toggle icon
Allow Notification
Get latest Exam Updates & FREE Study Material Alerts!
Self Studies ×
Open Now