Linear Algebra and Its Applications · Problem 8.2.12
Linear Programming and Game Theory — Gilbert Strang
Mathematics · karmarkar-interior-point
Problem
(a) Minimize the cost cTx=5x1+4x2+8x3 on the plane x1+x2+x3=3, by testing the vertices P, Q, R, where the triangle is cut off by the requirement x≥0.
(b) Project c=(5,4,8) onto the nullspace of A=[111], and find the maximum step s that keeps e−sPc nonnegative.