Solve the following NLP using Lagrangean method:
Minimizez=x12+x22+x32Minimize \quad z = x_1^2 + x_2^2 + x_3^2Minimizez=x12+x22+x32 Subject tox1+x2+3x3=2Subject\ to \quad x_1 + x_2 + 3x_3 = 2Subject tox1+x2+3x3=2 5x1+2x2+x3=55x_1 + 2x_2 + x_3 = 55x1+2x2+x3=5 x1,x2,x3≥0x_1, x_2, x_3 \ge 0x1,x2,x3≥0
Using Kuhn-Tucker condition solve the following problem
Maximizez=8x1+10x2−x12−x22Maximize \quad z = 8x_1 + 10x_2 - x_1^2 - x_2^2Maximizez=8x1+10x2−x12−x22 Subject to3x1+2x2≤6Subject\ to \quad 3x_1 + 2x_2 \le 6Subject to3x1+2x2≤6 x1,x2≥0x_1, x_2 \ge 0x1,x2≥0
What is operations research? Why operations research is important in the field of Mechanical Engineering?
Alumco manufacturers Aluminum sheets and Aluminum bars. The maximum production capacity is estimated at either 800 sheets or 600 bars per day. The maximum daily demand is 550 sheets and 560 bars. The profit per ton is $40 per sheet and $35 per bar. Formulate the problem as a linear programming problem.
Use graphical method to solve the following problem
Maximizez=2x1+3x2Maximize \quad z = 2x_1 + 3x_2Maximizez=2x1+3x2
Subject tox1+x2≤1Subject \ to \quad x_1 + x_2 \le 1Subject tox1+x2≤1
3x1+x2≤43x_1 + x_2 \le 43x1+x2≤4
x1,x2≥0x_1, x_2 \ge 0x1,x2≥0
Solve the following NLP using Lagrangian method Minimize z=5x1+x2−(x1−x2)2z = 5x_1 + x_2 - (x_1 - x_2)^2z=5x1+x2−(x1−x2)2 Subject to x1+x2=24x_1 + x_2 = 24x1+x2=24 x1,x2≥0x_1, x_2 \geq 0x1,x2≥0
Solve the following NLP using Kuhn-Tucker conditions Minimize z=8x1+10x2−x12−x22z = 8x_1 + 10x_2 - x_1^2 - x_2^2z=8x1+10x2−x12−x22 Subject to 3x1+2x2≤63x_1 + 2x_2 \leq 63x1+2x2≤6 x1,x2≥0x_1, x_2 \geq 0x1,x2≥0