Answer to Question #220576 in Operations Research for Ash

Question

Solve this quadratic programming using the primal dual interior point method or the Barrier Function interior method.

Find the values of x that minimize

f(x)=0.5x2

1

+x2

2

−x1

x2

−2x1

−6x2

,

subject to the constraints

x1

≥0

x2

≥0

x1

+x2

≤2

−x1

+2x2

≤2

2x1

+x2

≤3.