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

The feasible solution for a LPP is hown as below,

Let Z =3x -4y be the objective function . Then, 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
From the above table the minimum value of z is -32 which occurs at point (0, 8).
Promotional Banner

Topper's Solved these Questions

  • Linear Programming

    MHTCET PREVIOUS YEAR PAPERS AND PRACTICE PAPERS|Exercise EXERCISE 2 (MISCELLANEOUS PROBLEMS )|30 Videos

  • Linear Programming

    MHTCET PREVIOUS YEAR PAPERS AND PRACTICE PAPERS|Exercise MHT CET Corner|13 Videos

  • Linear Programming

    MHTCET PREVIOUS YEAR PAPERS AND PRACTICE PAPERS|Exercise MHT CET Corner|13 Videos

  • LINE

    MHTCET PREVIOUS YEAR PAPERS AND PRACTICE PAPERS|Exercise MHT CET Corner|3 Videos

  • MATHEMATICAL LOGIC

    MHTCET PREVIOUS YEAR PAPERS AND PRACTICE PAPERS|Exercise MHT CET CORNER|22 Videos

Similar Questions

Explore conceptually related problems

The feasible solution for a LPP is hown as below, Let Z =3x -4y be the objective function . Then, Maximum of Z occurs at

The feasible solution for a LPP is shown in following figure. Let Z=3x-4y be the objective function, Minimum of Z occurs at

The feasible region for an LPP is shown in the below. Let F = 3x - 4y be the objective function. Maximum value of F is :

The feasible region for an LPP is shown in the Let Z = 4x + 3y be the objective function. Maximum of Z occur at :

The feasible region for an LPP is shown in the following figure. Let F=3x--4y be the objective function. Maximum value of F is

The corner points of the feasible region determined by the system of linear constraints are as shown below: Let Z=3x -4y be the objective function. Find the maximum and minimum value of Z and also the corresponding points at which the maximum and minimum value occurs.

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. Determine the minimum value of F occurs at

Let R be the feasible region (convex polygon) for a linear programming problem and Z = ax + by be the objective function. Then, which of the following statements is false? A) When Z has an optimal value, where the variables x and y are subject to constraints described by linear inequalities, this optimal value must occur at a corner point (vertex) of the feasible region . B)If R is bounded, then the objective function Z has both a maximum and a minimum value on Rand each of these occurs at a corner point of R . C) If R is unbounded, then a maximum or a minimum value of the objective function may not exist D) If R is unbounded and a maximum or a minimum value of the objective function z exists, it must occur at corner point of R

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

In the given figure, if the shaded region is the feasible region and the objective function is z = x - 2y, the minimum value of Z occurs at: