Solve the following problem using DPP Maximize Z = 2x1+5x2 Subject to constraints: 2x1+x2 ≤430 2x2 ≤ 460, x1, x2≥ 0
SIKSHAPATH Latest Questions
Solve the following problem using DPP Maximize Z = 50x1+100x2 Subject to constraints: 10x1+5x2 ≤ 2500, 4x1+10x2 ≤2000, x1, x2≥ 0
Use the method of Lagrange an multipliers to solve the following NLPP. Does the solution maximize or minimize the objective function? Optimize Z = 2x12+ x22+3x32+10x1+8x2+6x3-100 Subject to x1+x2+x3 = 20 x1, x2, x3 ≥ 0
Solve the NLPP by Lagrange’s Multiplier Method Max Z=4x1-x12+8x2-x22 ,Subject to x1+x2=2, x1,x2>=0
Determine the optimal solution of the following NLPP by Lagrange multiplier method Optimize Z=x12-10x1+x22 -6x2+x32-4x3 , subject to x1+x2+x3=7 ,x1,x2,x3>=0
Create a package which includes a function to return a square of a number if it is positive else return an error message to the user.