Using semlex method Question 4.1.2 By hand please

PROBLEMS The symbols to the left of some of the problems for their parts) and have the following meaning: x 20. *320 D. The corresponding demonstration cxample listed on the preced- ing page may be helpful. DJ (a) Use the graphical method to solve this problem. Circle all We suggest that you use the corresponding interactive procedure the comer points on the graph. listed on the preceding page (the printout records your work). (b) For each CPF solution, identity the pair of constraint bound. C: Use the computer with any of the software options available to ary equations it satisfies. you for as instructed by your instructor) to solve the problem () Calculate Z for each CPF solution. Use this information to (e) For each CPF solution, identify its atjacent CPF solutions. automatically. (See See. 4.8 for a listing of the options featured in this book and on the book's website.) identify an optimal solution An asterisk on the problem number indicates that at least a partial (e) Describe graphically what the simplex method does step by answer is given in the back of the book. step to solve the problem. 4.1-1. Consider the following problem 4.1-3. A certain linear programming model involving two activi- ties has the feasible region shown below. Maximize 2= x1 + 213, subject to Ay 52 il (5.5) Level of Activity 2 Feasible region and l= 0, (a) Plot the feasible region and circle all the CPF solutions. (b) For each CPF solution, identify the pair of constraint bound- ary equations that it satisfies. (c) For each CPF solution, use this pair of constraint boundary equations to solve algebraically for the values of X and t, at the corner point (d) For each CPF solution, identify its adjacent CPF solutions (e) For each pair of adjacent CPF solutions, identify the constraint boundary they share by giving its equation, 4.1-2. Consider the following problem. Maximize Z=3x + 229 subject to Level of Activity 1 The objective is to maximize the total profit from the two activi: ties. The unit profit for activity 1 is $1.000 and the unit profit for activity 2 is $2,000 * + 213 5.6