Home
Class 12
MATHS
Maximise Z=3x+4y Subject to the constr...

Maximise `Z=3x+4y`
Subject to the constraints
`x+yle4,xge0,yge0`

Text Solution

AI Generated Solution

To solve the problem of maximizing \( Z = 3x + 4y \) subject to the constraints \( x + y \leq 4 \), \( x \geq 0 \), and \( y \geq 0 \), we can follow these steps: ### Step-by-Step Solution: 1. **Identify the Constraints:** - The constraints given are: - \( x + y \leq 4 \) - \( x \geq 0 \) ...
Doubtnut Promotions Banner Mobile Dark
|

Topper's Solved these Questions

  • LINEAR PROGRAMMING

    NAGEEN PRAKASHAN ENGLISH|Exercise Exercise 12.2|11 Videos
  • LINEAR PROGRAMMING

    NAGEEN PRAKASHAN ENGLISH|Exercise Miscellaneous Exercise|9 Videos
  • LINEAR PROGRAMMING

    NAGEEN PRAKASHAN ENGLISH|Exercise Exercise 12 B|15 Videos
  • INVERES TRIGONOMETRIC FUNCTIONS

    NAGEEN PRAKASHAN ENGLISH|Exercise Miscellaneous Exercise (prove That )|9 Videos
  • MATRICES

    NAGEEN PRAKASHAN ENGLISH|Exercise Miscellaneous Exerice|15 Videos

Similar Questions

Explore conceptually related problems

Solve the Following Linear Programming Problem graphically : Maximise Z = 3x + 4y subject to the constraints : x+ylt=4,xgeq0,ygeq0 .

Maximise Z=3x+4y, Subjected to the constraints x+y le1, x ge 0, y ge 0

Maximise Z=-x+2y Subject to the constraints xge3, x+yge5,x+2yge6,yge0

Solve the linear programming problem Maximise Z=x+2y Subject to the constraints: x-yle10, 2x + 3y le20 and xge0, yge0

Solve each of the following linear programming problems by graphical method. Maximize Z=3x+3y Subject to the constraints x-ylt=1 x+ygeq3 x , ygeq0

Minimise Z=13x-15y subject to the constraints x+y le 7, 2x-3y+6 ge 0, x ge 0, x ge 0, and y ge 0

Maximise the function Z=11x+7y , subject to the constraints x le 3, yle 2, x ge 0, y ge 0

Find the point which provides the solution of linear programming problem: Maximise: Z=45x + 55y Subject to constraints: x, yge 0,6x + 4y le 120 and 3x + 10y le 180.

Solve the following problem graphically:Minimise and Maximise Z = 3x + 9y . . . (1)subject to the constraints: x+3ylt=60 . . . (2) x+ygeq10 . . . (3) xlt=y . . . (4) xgeq0,ygeq0 . . . (5)

Minimise Z = 6x + 3y, subject to the constraints 4x + y ge 80, x + 5y ge 115, 3x + 2y le 150, x ge 0, y ge 0 .