Question

Consider the quadratic programming problem: Minimize () = 1 2 − 1 + 2 2 − 2 2 Subject to 1 + 2 ≤ 1, 1 ≥ 0, 2 ≥ 0. () Draw the feasible region in the 12-plane () Draw the level curves, () = constant, of the objective function to verify that The interior feasible point ( 1 2 , 1 2 ) is the global minimum.​

Answer 1

Answer:

9248784646548645*78787848/7855