Fermi · Concept Library · Courses · Books · Problems · Simulations · Math Wiki · High School Fermi › Problems Linear Algebra and Its Applications · Problem 8.3.7
Linear Programming and Game Theory — Gilbert Strang
Mathematics · linear-programming-duality-optimality
Problem Show that x = ( 1 , 1 , 1 , 0 ) x = (1,1,1,0) x = ( 1 , 1 , 1 , 0 ) y = ( 1 , 1 , 0 , 1 ) y = (1,1,0,1) y = ( 1 , 1 , 0 , 1 ) A = [ 0 0 1 0 0 1 0 0 1 1 1 1 1 0 0 1 ] , b = [ 1 1 1 1 ] , c = [ 1 1 1 3 ] . A = \begin{bmatrix} 0 & 0 & 1 & 0 \\ 0 & 1 & 0 & 0 \\ 1 & 1 & 1 & 1 \\ 1 & 0 & 0 & 1 \end{bmatrix}, \quad b = \begin{bmatrix} 1 \\ 1 \\ 1 \\ 1 \end{bmatrix}, \quad c = \begin{bmatrix} 1 \\ 1 \\ 1 \\ 3 \end{bmatrix}. A = 0 0 1 1 0 1 1 0 1 0 1 0 0 0 1 1 , b = 1 1 1 1 , c = 1 1 1 3 . c x cx c x y b yb y b Browse the problem library