Home
Class 12
MATHS
The linear programming problem minimiseZ...

The linear programming problem minimiseZ=3x+2y subject to the constraints
`x+y ge 8`
`3x +5y le 15 `
` x ge 0, y ge 0 ` has

A

one solution

B

no feasible solution

C

two solutions

D

infinitely many solution

Text Solution

Verified by Experts

The correct Answer is:
B
Given
Minimise Z= 3x + 2y
Subject to the constraints ,
` x+y ge 8`
` 3x +5y le 15 `
` x ge 0, y ge 0`
` (##ARH_EGN_PRG_MAT_C17_E02_013_S01.png" width="80%">
It is clear from the figure, that there is no feasible region. So, given problem has no feasible solution.
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

Minimize Z = 3x + 2y subject to the constraints : x + y ge 8, 3x + 5y le 15, x ge 0, y ge 0 .

Minimize Z = -3x + 4y subject ot constraints : x + 2y le 8, 3x + 2y le 12, x ge 0, y ge 0 .

Maximise Z= -x + 2y , subject to the constraints: x ge 3, x + y ge 5, x + 2y ge 6, y ge 0 .

Solve the linear programming problem. Maximise Z = x + 2y Subject to constraints x - y le 10, 2x +3y le 20 and x ge 0, y ge 0

Maximize z =2x + 3y subject to constraints x + 4y le 8, 3x + 2y le 14 , x ge 0, y ge 0 .

Minimize 3x+2y subject to the constraints x+y ge 5 and x+2 y ge 6, x ge0, y ge 0

Maximize : Z = x + y ,subject to the constraints: x - y le -1, -x + y le 0, x ge 0, y ge 0

Minimize z=6x+3y subject to the constraints 4x+y ge 80 , x +5y gt 115, 3x+2y le 150 , x ge 0, y ge 0

A linear programming problem is as follows: Minimize Z= 30x + 50y subject to the constraints, 3x+5y ge 15 2x+3y le 18 x ge 0, y ge 0 In the feasible region, the minimum value of Z occurs at

Maximize Z = 5x + 3y subject to the constraints: 3x + 5y le 15, 5x + 2y le 10, x ge 0, y ge 0

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

    |