Consider the Linear Programming formation of this problem.
A) Is it a maximization or a minimization problem?
B) How many decision variables are there?
C) How many constraints are there (not counting the non-negativity constraints)?
D) Provide your Linear Programming formation for this problem. Make sure to provide a clear and precise definition for your decision variables.
E) Use the greedy method to solve this linear program. Is (3,2) a feasible solution?
F) What is the objective value associated with the solution (2,3)?
G) Which of the following solutions is better: (6,4) or (2,3)?