Home
Class 12
MATHS
For an objective function Z=ax+by , wher...

For an objective function Z=ax+by , where a, b > 0; the corner points of the feasible region determined by a set of constraints (linear inequalities) are (0, 20), (10, 10), (30, 30) and (0, 40). The condition on a and b such that the maximum Z occurs at both the points (30, 30) and (0, 40) is:

A

b-3a=0

B

a=3b

C

a+2b=0

D

2a-b=0

Text Solution

AI Generated Solution

The correct Answer is:
To solve the problem, we need to determine the condition on \( a \) and \( b \) such that the maximum value of the objective function \( Z = ax + by \) occurs at both points \( (30, 30) \) and \( (0, 40) \). ### Step-by-Step Solution: 1. **Evaluate the Objective Function at the Points:** - For point \( (30, 30) \): \[ Z_1 = a(30) + b(30) = 30a + 30b \] - For point \( (0, 40) \): \[ Z_2 = a(0) + b(40) = 40b \] 2. **Set the Objective Function Values Equal:** Since we want the maximum \( Z \) to occur at both points, we set \( Z_1 \) equal to \( Z_2 \): \[ 30a + 30b = 40b \] 3. **Rearrange the Equation:** Rearranging the equation gives: \[ 30a + 30b - 40b = 0 \] \[ 30a - 10b = 0 \] 4. **Solve for \( a \) in terms of \( b \):** Dividing the entire equation by 10: \[ 3a - b = 0 \] Thus, we can express \( b \) in terms of \( a \): \[ b = 3a \] 5. **Conclusion:** The condition on \( a \) and \( b \) such that the maximum \( Z \) occurs at both points \( (30, 30) \) and \( (0, 40) \) is: \[ b = 3a \quad \text{(where \( a, b > 0 \))} \]
Promotional Banner

Topper's Solved these Questions

  • JEE MAINS PREVIOUS YEAR

    RD SHARMA|Exercise EXAMPLE|1 Videos
  • MAXIMA AND MINIMA

    RD SHARMA|Exercise Solved Examples And Exercises|306 Videos

Similar Questions

Explore conceptually related problems

For an objective function Z = ax + by," where "a,b gt 0, the corner points of the feasible region determined by a set of constraints (linear inequalities) are (0, 20), (10, 10), (30, 30) and (0, 40). The condition on a and b such that the maximum Z occurs at both the points (30, 30) and (0, 40) is:

For an objective function Z = ax + by, where a, bgt0 , the corner points of the feasible region determined by a set of constraints (linear inequalities) are (0, 20). (10, 10), (30, 30) and (0, 40). The condition on a and b such that the maximum z occurs at both the points (30, 30) and (0, 40) is:

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

The corner points of the feasible region determined by the system of linear constraints are (0,10) , (5,5) (25,20),(0,30) Let z = px + qy , where p,qgt0 Condition on p and q so that te maximum of z occurs at both the points (25,20 ) and (0,30) is ………

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 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 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 :

Corner poins of the feasible region determned by the system of linear constrainsts are (0,3), (1,1), and (3,0). Let Z=px+qy. Where p, q lt 0 Condition on p and q, so that the minimum of Z occurs at (3,0) and (1,1) is

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 :

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:

RD SHARMA-LINEAR PROGRAMMING -Solved Examples And Exercises
  1. Solve the Following Linear Programming Problem graphically : Maxim...

    Text Solution

    |

  2. A dealer wishes to purchase a number of fans and sewing machines. He h...

    Text Solution

    |

  3. A small manufacturer has employed 5 skilled men and 10 semi - skilled ...

    Text Solution

    |

  4. A factory manufactures two types of screws, A and B. Each type of scre...

    Text Solution

    |

  5. Reshma wishes to mix two types of food P and Q in such a way that t...

    Text Solution

    |

  6. For an objective function Z=ax+by , where a, b > 0; the corner points ...

    Text Solution

    |

  7. Solve each of the following linear programming problems by graphical ...

    Text Solution

    |

  8. Solve each of the following linear programming problems by graphical ...

    Text Solution

    |

  9. One kind of cake requires 200 g of flour and 25 g of fat, and anoth...

    Text Solution

    |

  10. If a young man rides his motorcycle at 25 km/hr, he has to spend 2 per...

    Text Solution

    |

  11. Two tailors A and B earns 15 and 20 per dayrespectively. A can stitch ...

    Text Solution

    |

  12. A manufacturer makes two types of toys A and B. Three machines are ...

    Text Solution

    |

  13. A factory uses three different resources for the manufacture of two di...

    Text Solution

    |

  14. A cottage industry manufactures pedestal lamps and wooden shades, e...

    Text Solution

    |

  15. A small firm manufactures items A and B. The total number of items tha...

    Text Solution

    |

  16. A small firm manufactures items A and B. The total number of items tha...

    Text Solution

    |

  17. A small firm manufactures gold rings and chains. The total number o...

    Text Solution

    |

  18. Objective function of a LLP is (A) a constraint          (B) a func...

    Text Solution

    |

  19. The maximum value of Z=4x+2y subjected to the constraints 2x+3ylt=18 ,...

    Text Solution

    |

  20. The optimal value of the objective function is attained at the points ...

    Text Solution

    |