In an LP Problem, the Goal Is to Maximize the Objective

Multiple Choice

In an LP problem, the goal is to maximize the objective function S + 3T, subject to the binding constraints S + T ≤ 700 and S + 2T ≤ 1,000. The optimal solution is:

A) S = 400 and T = 300.
B) S = 200 and T = 600.
C) S = 700 and T = 0.
D) S = 0 and T = 500
E) S = 500 and T = 200