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

The corner points of the feasible region of a system of linear inequalities are (0, 0), (4,0), (3,9), (1, 5) and (0, 3). If the maximum value of objective function, Z = ax + by occurs at points (3, 9) and (1, 5), then the relation between a and b is:

A

a-2b =0

B

2a-b=0

C

a + 2b =0

D

2a +b=0

Text Solution

AI Generated Solution

Promotional Banner

Topper's Solved these Questions

  • SAMPLE PAPER 09

    EDUCART PUBLICATION|Exercise SECTIONS-B|19 Videos

  • SAMPLE PAPER 09

    EDUCART PUBLICATION|Exercise SECTIONS-C|8 Videos

  • SAMPLE PAPER - 5

    EDUCART PUBLICATION|Exercise Section - C|10 Videos

  • SAMPLE PAPER 11

    EDUCART PUBLICATION|Exercise SECTION- C|4 Videos

Similar Questions

Explore conceptually related problems

The corner points of a feasible region determined by a system of linear inequations are (0, 0), (4,0), (5,2), (2, 2) and (0, 1). If the objective function is Z = x + y, then maximum of Z occurs at:

The corner points of the feasible region of a system of linear inequations are (0, 0), (5, 0), (6,5), (6, 8), (4, 10) and (0,8). If Z = 3x - 4y, then the minimum value of Z occurs at:

The corner points of a feasible region determined by a system of linear inequalities are (20,40),(50,100),(0,200) and (0,50). If the objective funtion Z=x+2y , then maximum of Z occurs at.

The corner points of the feasible region determined by a system of linear inequations are (0,0),(4,0),(2,4) and (0,5). If the minimum value of Z=ax+by,a, bgt0 occurs at (2,4) and (0,5) ,then :

If the corner points of a feasible region of system of linear inequalities are (15,20) (40,15) and (2,72) and the objective function is Z = 6x + 3y then Z_(max) - Z_(min) =

The corner points of the feasible region of the system of linear inequations x+yge2,x+yle5,x-yge0,x,yge0 are :

the corner points of the feasible region of a system of linear inequalities 3x + 5y le 15, 5x + 2y ge 10, x ge 0, y ge 0 , are:

The corneer points of a feasible region, determined by a system of linear inequations, are (0,0),(1,0),(4,3),(2,1) and (0,1). If the objective function is Z = 2x - 3y, then the minimum value of Z is :

The corner points of the feasible region of an LPP are (0,0),(0,8),(2,7),(5,4) and (6,0). The maximum value of the objective function Z = 3x + 2y is: