Maximize a linear objective function with constraints
Maximize the objective function 2x + 3y subject to the constraints that x + twice y is at most 6; and the sum of 5 times x and 3 times y is at most 15; with both decision variables non-negative.
Find the optimal solution using linear programming and the graphical solution procedure. What is the value of the objective function at the optimal solution?