Home
Class 12
MATHS
The feasible solution for a LPP is shown...

The feasible solution for a LPP is shown in Figure
Let z = -3x - 4y

objective function. Minimum of Z occurs at

A

(0, 0)

B

(0, 8)

C

(5, 0)

D

(4, 10)

Text Solution

Verified by Experts

The correct Answer is:
B
Promotional Banner

Topper's Solved these Questions

  • LINEAR PROGRAMMING

    KUMAR PRAKASHAN|Exercise MULTIPLE CHOICE QUESTIONS|42 Videos

  • LINEAR PROGRAMMING

    KUMAR PRAKASHAN|Exercise PRACTICE PAPER - 12|14 Videos

  • LINEAR PROGRAMMING

    KUMAR PRAKASHAN|Exercise TEXTBOOK ILLUSTRATIONS FOR PRACTICE WORK|11 Videos

  • INVERSE TRIGONOMETRIC FUNCTIONS

    KUMAR PRAKASHAN|Exercise PRACTICE PAPER - 2 (SECTION - D)|2 Videos

  • MATRICES

    KUMAR PRAKASHAN|Exercise Practice Paper - 3 (Section - D)|1 Videos

Similar Questions

Explore conceptually related problems

The feasible solution for a LPP is shown in Figure Let z = -3x - 4y objective function. Maximum of Z occurs at

The feasible region for an LLP is shown in the Figure. Let z = 3x - 4y be the objective function. Minimum value of z is

The feasible region for an LLP is shown in the Figure. Let z = 3x - 4y be the objective function. Maximum value of z is

Feasible region (shaded) for a LPP is shown in Figure Maximise z = 5x + 7y.

The feasible region for a LPP is shown in Figure. Evaluate z = 4x + y at each of the corner points at this region. Find the minimum value of z, if exists.

The feasible region for a LPP is shown in Figure. Find the minimum value of z=11x+7y .

If the feasible region for a LPP is unbounded, maximum or minimum of the objective function Z = ax + by may or may not exist.

If the feasible region for a LPP is …………, then the optimal value of the objective function z = ax + by may or may not exist.

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. The Minimum value of F occurs at ………..

In Figure, the feasible region (shaded) for a LPP is shown. Determine the maximum and minimum value of z = x + 2y.

KUMAR PRAKASHAN-LINEAR PROGRAMMING-SOLUTIONS OF NCERT EXEMPLAR PROBLEMS
  1. Maximise Z = 10x + 7y subject to 2x+2y ge 16, " "6x+10y le 3...

    Text Solution

    |

  2. The corner points of the feasible region determined by the system of l...

    Text Solution

    |

  3. The feasible solution for a LPP is shown in Figure Let z = -3x - 4y ...

    Text Solution

    |

  4. The feasible solution for a LPP is shown in Figure Let z = -3x - 4y ...

    Text Solution

    |

  5. The corner points of the bounded feasible region are (0, 0), (0, 8), (...

    Text Solution

    |

  6. The feasible region for an LLP is shown in the Figure. Let z = 3x - 4y...

    Text Solution

    |

  7. The feasible region for an LLP is shown in the Figure. Let z = 3x - 4y...

    Text Solution

    |

  8. Corner points of the feasible region for an LPP are (0, 2), (3, 0), (6...

    Text Solution

    |

  9. Corner points of the feasible region for an LPP are (0, 2), (3, 0), (6...

    Text Solution

    |

  10. Corner points of the feasible region determined by the system of linea...

    Text Solution

    |

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

    Text Solution

    |

  12. In a LPP, the objective function is always ………….

    Text Solution

    |

  13. If the feasible region for a LPP is …………, then the optimal value of th...

    Text Solution

    |

  14. In a LPP if the objective function z = ax + by has the same maximum va...

    Text Solution

    |

  15. A feasible region of a system of linear inequalities is said to be ………...

    Text Solution

    |

  16. A corner point of a feasible region is a point in the region which is ...

    Text Solution

    |

  17. The feasible region for an LLP is always a …….. polygon.

    Text Solution

    |

  18. If the feasible region for a LPP is unbounded, maximum or minimum of t...

    Text Solution

    |

  19. Maximum value of the objective function Z = ax + by in a LPP always oc...

    Text Solution

    |

  20. In a LPP, the minimum value of the objective function Z = ax + by is a...

    Text Solution

    |