ANSWER SHEET Question 3: Problem solving (10 Marks) 1. Represent graphically the feasible region (solution space). (4 Marks) Question 3: Problem solving (10 Marks) Part 1: Consider the following Linear Program: Max 2 - 6x +10% Subject to: 2.x,+ 3x, 5.36 4x+2x, S 32 X2,20 1. Represent graphically the feasible region (solution space) (4 Marks) 2. Find the Optimal Solution using the graphical method. (Marks) Part II: Answer the following questions: 1. Define the special issue of unboundedness, in linear programming problems. (1 Mark) 2. Define the special issue of redundancy, in linear programming problems. (1 Mark) 2. Find the Optimal Solution using the graphical method (4 Marks) Part II: Answer the following questions: 3. Define the special issue of unboundedness, in linear programming problems. (I Mark) 4. Define the special issue of redundancy, in linear programming problems. (1 Mark) ANSWER SHEET Question: Problem solving (7 Marks) 1. Apply the Minimal Spanning Tree technique to determine the path through the network that connects all the houses while minimizing total distance (minimal total cable length). (5 Marks) Question 4: Problem solving (7 Marks) The graph below is a network representing nine houses that a telecommunications company wants to connect using the minimum cable length (the numbers on the arcs are the distances between houses in meters) 4 H 4 2 8 E D H 2 2. Compute the minimal total distance. (1 Mark) E 3. What other types of service connections can be done with minimizing the total distance? (1 Mark) 1. Apply the Minimal-Spanning Tree technique to determine the path through the network that connects all the houses while minimizing total distance (minimal total cable length) (5 Marks) 2. Compute the minimal total distance. (1 Mark) 3. What other types of service connections can be done with minimizing the total distance? (Mark)