Linear programming Let a be an mxn matrix. b be an m-vector and c be an n-vector. Find an n-vector x that maximizes clx subject to Ax s b, or determine that no such solution exists maximIzing A x< b C x c 2001 by Charles E Leiserson Introduction to Algorithms Day 31 L18. 17© 2001 by Charles E. Leiserson Introduction to Algorithms Day 31 L18.17 Linear programming Let A be an m×n matrix, b be an m-vector, and c be an n-vector. Find an n-vector x that maximizes cTx subject to Ax ≤ b, or determine that no such solution exists. . ≤ m maximizing . n A x ≤ b cT x