SOLUTION OF LINEAR PROGRAMMING PROBLEMS

using intersect on the calculator or using rref: Value is (12, 2) 3. Evaluate the objective function at each vertex. Put the vertices into a table: Vertex P=3x+2y (0, 0) 0 min (0, 5) 10 (15, 0) 45 (12, 2) 40 Max 4. The region is bounded, therefore a max and a min exist on S. The minimum is … ................
................