Problem 1: For the following linear programming problem:
???????? ? = 40?1 + 50?2
Subject to constraints:
3?1 − 6?2 ≥ 30
?1 – 15 ≤ 3?2 2
?1 + 3 ?2 = 24
?1, ?2 ≥ 0
1- Find the optimal solution using graphical solution corner
points method or iso profit line method. Please, show the values
for state variable, decisions variables, and slack and surplus
variables
2- Determine the value for basic solution and non-basic
solution, binding constraints...