Home
Class 12
MATHS
The corner points of the feasible region...

The corner points of the feasible region determined by the system of linear constraints are (0,0), (0,40), (20,40), (60, 20), (60, 0). The objective function is Z = 4x + 3y. Compare the quantity in column in A and column B. Column A= Maximum of Z Column B= 325

A

The quantity in column B is greater

B

The quantity in column A is greater

C

The two quantities are equal

D

The relationship can not be determined on the basis of the information supplied

Text Solution

Verified by Experts

The correct Answer is:
A
Promotional Banner

Topper's Solved these Questions

  • LINEAR INEQUALITIES

    HIMALAYA PUBLICATION|Exercise QUESTION BANK|54 Videos

  • MATHEMATICAL INDUCTION AND SUMMATION OF SERIES

    HIMALAYA PUBLICATION|Exercise Question Bank|91 Videos

Similar Questions

Explore conceptually related problems

The corner points of the feasible region determined by the system linear constraints are (0,10), (5,5), (15,15), (0,20). Let Z = px+ qy, where p, q gt 0 , condition on p and q so that the maximum of Z occurs at both the points (15,15) and (0,20) is

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 gt 0 . Condition on p and q so that the minimum of z occurs at (3, 0) and (1, 1) is

Corner points of feasible region for an LPP are (0,2),(3,0),(6,0),(6,8) and (0,5). Let F=4 x+6 y be the objective function. The minimum value of F occur at

Solve graphically the system of linear inequalities 4x+3y le 60, y ge2x, x ge 3,x,y ge0 .

f: Z to Z is a linear function defined by f={(1,1),(0,-1),(2,3)} , find f(x)

Let f={(1,1),(2,3),(0,-1),(,-1,-3)} be a linear function from Z into Z. Find f(x).

The point whose abscissa is equal to its ordinate and which is equidistant from A(4,0) and B(0,5) is

The number of integral values of a for which the system of linear equations x sin theta -2 y cos theta -az=0 , x+2y+z=0,-x+y+z=0 may have non-trivial solutions, then

The feasible solution for a LPP is shown in the following figure. Let Z=3 x-4 y be the objective function. (Maximum value of Z+ Minimum value of Z ) is

HIMALAYA PUBLICATION-LINEAR PROGRAMMING-QUESTION BANK
  1. The shaded region in the following figure is the solution set of the i...

    Text Solution

    |

  2. The shaded region in the following figure is the solution set of the i...

    Text Solution

    |

  3. The maximum value of linear objective function z = 40x + 50y subjected...

    Text Solution

    |

  4. The shaded region in the following figure is the solution set of the i...

    Text Solution

    |

  5. Maximum value of set z = 3x +2y subjected to 0 le x le 3, 0 le y le 3,...

    Text Solution

    |

  6. The shaded region in the following figure is the solution set of the i...

    Text Solution

    |

  7. The minimum value of z = 6x + 4y subjected to 2x + 3y le 30, 3x + 2y l...

    Text Solution

    |

  8. The region represented by the inequations 2x + 3y le 18, x + y ge 10, ...

    Text Solution

    |

  9. Optimization of the objective function is a process of

    Text Solution

    |

  10. The corner points of the feasible region determined by the system line...

    Text Solution

    |

  11. Feasible region (shaded ) for a LPP is shown in the following figure

    Text Solution

    |

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

    Text Solution

    |

  13. The feasible solution for a LPP is shown in the following figure. Let ...

    Text Solution

    |

  14. The feasible solution for a LPP is shown in the following figure. Let ...

    Text Solution

    |

  15. The feasible solution for a LPP is shown in the following figure. Let ...

    Text Solution

    |

  16. The feasible region for an LPP is shown in the following figure. Let F...

    Text Solution

    |

  17. The feasible region for an LPP is shown in the following figure. Let F...

    Text Solution

    |

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

    Text Solution

    |

  19. In the equation 33 Maximum of F - Minimum of F =

    Text Solution

    |

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

    Text Solution

    |