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

A

p=q

B

p=2q

C

q=2p

D

q=3p

Text Solution

AI Generated Solution

The correct Answer is:
To solve the problem, we need to find the condition on \( p \) and \( q \) such that the maximum of \( Z = px + qy \) occurs at both points \( (15, 15) \) and \( (0, 20) \). ### Step-by-step Solution: 1. **Identify the Objective Function**: We have the objective function \( Z = px + qy \). 2. **Evaluate Z at the Points**: - At the point \( (15, 15) \): \[ Z(15, 15) = p(15) + q(15) = 15p + 15q \] - At the point \( (0, 20) \): \[ Z(0, 20) = p(0) + q(20) = 20q \] 3. **Set the Two Expressions for Z Equal**: Since we want the maximum of \( Z \) to be the same at both points, we set the two expressions equal to each other: \[ 15p + 15q = 20q \] 4. **Rearrange the Equation**: Rearranging gives: \[ 15p + 15q - 20q = 0 \] Simplifying this, we get: \[ 15p - 5q = 0 \] 5. **Solve for the Relationship Between p and q**: Dividing the entire equation by 5: \[ 3p = q \] 6. **Conclusion**: The condition on \( p \) and \( q \) such that the maximum of \( Z \) occurs at both points \( (15, 15) \) and \( (0, 20) \) is: \[ q = 3p \]

To solve the problem, we need to find the condition on \( p \) and \( q \) such that the maximum of \( Z = px + qy \) occurs at both points \( (15, 15) \) and \( (0, 20) \). ### Step-by-step Solution: 1. **Identify the Objective Function**: We have the objective function \( Z = px + qy \). 2. **Evaluate Z at the Points**: ...
Promotional Banner

Topper's Solved these Questions

  • 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 EXERCISE 1 (TOPICAL PROBLEMS )(Solution of LPP Graphical Method )|15 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 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 ………

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 the following system of linear inequalities: 2x+yge10, x+3yle15,x,yge0 are (0,0),(5,0),(3,4) and (0,5) . Let Z=px+qy , where p,qge0 . Condition on p and q so that the maximum of Z occurs at both (3,4) and (0,5) is: (a) p=q (b) p=2q (c) p=eq (d) q=3p

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 as shown below: Let Z=px +qy where p,q gt 0 be the objective function. Find the condition on p and q so that the maximum value of Z occurs at B ( 4,10 ) and C (6,8 ) Also mention the number of optimal solutions in this case.

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

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

MHTCET PREVIOUS YEAR PAPERS AND PRACTICE PAPERS-Linear Programming -EXERCISE 2 (MISCELLANEOUS PROBLEMS )
  1. Consider the inequalities 5x1+4x2ge9,x1+x2 le 3, x1 ge 0 , x2 ge 0 Wh...

    Text Solution

    |

  2. The minimum and maximum values problem, of Z for the minimise and ma...

    Text Solution

    |

  3. The linear programming problem minimiseZ=3x+2y subject to the constrai...

    Text Solution

    |

  4. The maximum and minimum values of the objective function Z = x + 2y s...

    Text Solution

    |

  5. The maximum value of the objective function Z=3x+4y subject to th...

    Text Solution

    |

  6. Let x and y are the number of tables and chairs respectively, on which...

    Text Solution

    |

  7. The graphical solution of linear inequalities x+y ge 5 " and " x -y ...

    Text Solution

    |

  8. By graphical method, the solutions of linear programming problem maxim...

    Text Solution

    |

  9. A toy company manufactures two types of doll; a basic version doll; a ...

    Text Solution

    |

  10. The minimum value of Z = 10x + By subject to 4x +y ge 4, x +3y ge 6, ...

    Text Solution

    |

  11. The point which provides the solution of the solution to the linear pr...

    Text Solution

    |

  12. Shaded region is represented by , the constraints

    Text Solution

    |

  13. Let R be the feasible region (convex polygon) for a linear programming...

    Text Solution

    |

  14. The minimum value of the objective function Z=x+2y Subject to the c...

    Text Solution

    |

  15. Let the feasible region of the linear programming problem with the obj...

    Text Solution

    |

  16. The minimum and maximum values of the objective function, Z = 5x + 1...

    Text Solution

    |

  17. Consider the following statements I. If the feasible region of an L...

    Text Solution

    |

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

    Text Solution

    |

  19. (Allocation problem) A cooperative society of farmers has 50 hectar...

    Text Solution

    |

  20. Anil wants to invest at the most Rs.12000 in bonds. A and B. According...

    Text Solution

    |