Prove that x = (1, 0.5, -1) is optimal for the following optimization problem 1 2...

Transcribed Image Text:

Prove that x = (1, 0.5, -1) is optimal for the following optimization problem 1 2 where Hint: • A≥0 A = are positive. min S.t. 13 12 xAx xAx + bx 1≤ i ≤ 1, i = 1,2,3, 12 -2 17 6 12 -2 6 and b = all its principle minors are nonnegative; A> 0 all its leading principle minors • A principal submatrix of an n x n matrix is obtained by deleting of any k rows and corresponding k columns. -22 -14.5 13 • The determinant of a principal submatrix is called the principal minor of A. • The leading principal submatrix of order k of an n x n matrix is obtained by deleting the last n-k rows and column of the matrix. Prove that x = (1, 0.5, -1) is optimal for the following optimization problem 1 2 where Hint: • A≥0 A = are positive. min S.t. 13 12 xAx xAx + bx 1≤ i ≤ 1, i = 1,2,3, 12 -2 17 6 12 -2 6 and b = all its principle minors are nonnegative; A> 0 all its leading principle minors • A principal submatrix of an n x n matrix is obtained by deleting of any k rows and corresponding k columns. -22 -14.5 13 • The determinant of a principal submatrix is called the principal minor of A. • The leading principal submatrix of order k of an n x n matrix is obtained by deleting the last n-k rows and column of the matrix.

Answer rating: 100% (QA)

A 13 12 2 12 17 6 2 6 12 22 145 13 b 1 05 1 x 1 05 1 show your worki... View the full answer