`5x_(1)+3x_(2)=30`
`5x_(1)-2x_(2)=5`

Maximize z = 5x_(1) + 3x_(2) Subject to 3x_(1) + 5x_(2) le 15 5x_(1) + 2x_(2) le 10 x_(1), x_(2) ge 0

Consider the following linear programming Problem : Maximize Z=50x_(1)+30x_(2) Subject to 2x_(1)+x_(2)<14,5x_(1)+5x_(2)<=40x_(1)+3x_(2)<=18,x_(1),x_(2)<=0

If 3x_(1)+5x_(2) le 15,5x_(1)+2x_(2) le 10,x_(1),x_(2)ge0, then the maximum value of z=5x_(1)+3x_(2) by graphical method is

(5x-1)/(x^(2)+3)<1

Add :5x^(2)-(1)/(3)x+(5)/(2),-(1)/(2)x^(2)+(1)/(2)x-(1)/(3) and -2x^(2)+(1)/(5)x-(1)/(6)

(i) (2x+3) (3x-5) (ii) x(1+x)^(3) (iii) (sqrtx + 1/x) (x -1/sqrtx) (iv) (x-1/x)^(2) (v) (x^(2) + 1/x^(2))^(3) (vi) (2x^(2) +5x-1) (x-3)

Which of the following is a reciprocal equation of class one.1)2x^(3)+5x^(2)+5x+2=02 ) 2x^(3)+5x^(2)+5x-2=03)2x^(3)-5x^(2)+5x-2=04 none of these

If x+(1)/(x)=2 then (2x^(2)+2)/(3x^(2)+5x+3)

Simplify (x-3)/(x^(2)-x-6) + (2x-1)/(2x^(2) + 5x-3) - (2x +5)/(x^(2) + 5x +6)