Home
Class 12
MATHS
Solve the following linear programming p...

Solve the following linear programming problems graphically :
Maximize : `Z = x + 170y` subject to the constraints `3x+2y le 6, x+4y le 16, x, y ge 0`.

Text Solution

Verified by Experts

The correct Answer is:
The maximum profit of Rs. 48,000 company has to produce 150 sweater.
Promotional Banner

Topper's Solved these Questions

  • LINEAR PROGRAMMING

    KUMAR PRAKASHAN|Exercise MULTIPLE CHOICE QUESTIONS|42 Videos

  • LINEAR PROGRAMMING

    KUMAR PRAKASHAN|Exercise PRACTICE PAPER - 12|14 Videos

  • LINEAR PROGRAMMING

    KUMAR PRAKASHAN|Exercise TEXTBOOK ILLUSTRATIONS FOR PRACTICE WORK|11 Videos

  • INVERSE TRIGONOMETRIC FUNCTIONS

    KUMAR PRAKASHAN|Exercise PRACTICE PAPER - 2 (SECTION - D)|2 Videos

  • MATRICES

    KUMAR PRAKASHAN|Exercise Practice Paper - 3 (Section - D)|1 Videos

Similar Questions

Explore conceptually related problems

Solve the following linear programming problems graphically : Maximize : Z = 100x + 170y subject to the constraints 3x+2y le 3600, x+4y le 1800, x, y ge 0 .

Solve the following linear programming problems graphically : Minimise : Z = 3x + 2y subject to the constraints x+y le 8, 3x+5y ge 15, x ge 0, y ge 0

Solve the following linear programming problems graphically : Maximise : Z = 5x +7y subject to constraints x+y le 4, 3x+8y le 24, 10x+7y le 35, x, y ge 0 .

Solve the following linear programming problems graphically : Minimise : Z = 20x + 10y subject to the constraints x+2y le 40, 3x+y ge 30, 4x+3y ge 60, x, y ge 0 .

Solve the following linear programming problems graphically : Maximise : Z = 10x + 6y subject to constraints 3x+y le 12, 2x+5y le 34, x, y ge 0

Solve the following linear programming problems graphically : Maximise Z = 50x + 15y subject to constraints 5x+y le 100, x+y le 60, x, y ge 0 .

Solve the following linear programming problems graphically : Minimise : Z = 3x + 5y subject to constraints -2x+y le 4, x+y ge 3, x-2y le 2, x, y ge 0 .

Solve the following Linear Programming Problems graphically : Maximise Z=3x+4y subject to the constraints : x+y le 4 , x ge 0 , y ge 0

Solve the following linear programming problems graphically : Minimise : Z = 18x +10y subject to constraints 4x+y ge 20, 2x+3y ge 30, x, y ge 0 .

Solve the following linear programming problem graphically : Maximise Z = 4x + y " …(1)" subject to the constraints : x+y le 50 " …(2)" 3x+y le 90" …(3) " x ge 0, y ge 0" ...(4)"

KUMAR PRAKASHAN-LINEAR PROGRAMMING-SOLUTIONS OF NCERT EXEMPLAR PROBLEMS
  1. Find the minimum value of Z = x + y subject to the constraints 2x+3y l...

    Text Solution

    |

  2. Solve the following linear programming problems graphically : Maximi...

    Text Solution

    |

  3. Solve the following linear programming problems graphically : Maximi...

    Text Solution

    |

  4. Refer to question 15. Determine the maximum distance that the man can ...

    Text Solution

    |

  5. Maximise z = x + y subject ot x+4y le 8, 2x+3y le 12, 3x+y le 9, x ge ...

    Text Solution

    |

  6. A manufacturer produces two models of bikes model X and model Y. Model...

    Text Solution

    |

  7. In order to supplement daily diet, a person wishes to take some of x a...

    Text Solution

    |

  8. A company makes 3 model of calculators : A, B and C at factory (I) and...

    Text Solution

    |

  9. Maximise Z = 10x + 7y subject to 2x+2y ge 16, " "6x+10y le 3...

    Text Solution

    |

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

    Text Solution

    |

  11. The feasible solution for a LPP is shown in Figure Let z = -3x - 4y ...

    Text Solution

    |

  12. The feasible solution for a LPP is shown in Figure Let z = -3x - 4y ...

    Text Solution

    |

  13. The corner points of the bounded feasible region are (0, 0), (0, 8), (...

    Text Solution

    |

  14. The feasible region for an LLP is shown in the Figure. Let z = 3x - 4y...

    Text Solution

    |

  15. The feasible region for an LLP is shown in the Figure. Let z = 3x - 4y...

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

  19. In a LPP, the linear inequalities or restrictions on the variables are...

    Text Solution

    |

  20. In a LPP, the objective function is always ………….

    Text Solution

    |