Consider the following linear programming problem: Maximize 6x+5y (OBJ) Subject to x+y≤6 (1) 2x+y≤8 (2) y≤5 (3) x,y≥0 What is the optimal solution to this problem? What is the optimal value of the objective function? Solve this model by using graphical analysis based on the Corner Point Solution Method. Answer questions below. 2.1. Clearly plot and label the constraints. Show your calculations for drawing constrain line. The solution without calculation will not be accepted. 2.2. Develop and shade the feasible region. Use graph paper. 2.3. Compute all the corner points or extreme points and their coordinates (i.e. the values of x and y). The solution without calculation will not be accepted. 2.4. Determine the optimal solution (i.e. the values of x and y) using corner points method. Why your solution is optimal? 2.5 Compute the value of the objective function at the optimal solution. 2.6. Identify the binding and non-binding constraint(s). Explain why? 2.7 Is coordinate (4, 2) feasible solution? Explain Why? The solution without any explanation will not be accepted Show the graph with the optimal point. Make the conclusion:
Consider the following linear programming problem:
Maximize 6x+5y (OBJ)
Subject to x+y≤6 (1)
2x+y≤8 (2)
y≤5 (3)
x,y≥0
What is the optimal solution to this problem? What is the optimal value of the objective function?
Solve this model by using graphical analysis based on the Corner Point Solution Method.
Answer questions below.
2.1. Clearly plot and label the constraints. Show your calculations for drawing constrain line. The solution without calculation will not be accepted.
2.2. Develop and shade the feasible region. Use graph paper.
2.3. Compute all the corner points or extreme points and their coordinates (i.e. the values of x and y). The solution without calculation will not be accepted.
2.4. Determine the optimal solution (i.e. the values of x and y) using corner points method.
Why your solution is optimal?
2.5 Compute the value of the objective function at the optimal solution.
2.6. Identify the binding and non-binding constraint(s). Explain why?
2.7 Is coordinate (4, 2) feasible solution? Explain Why? The solution without any explanation will not be accepted
Show the graph with the optimal point. Make the conclusion:
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 3 images
