(Solved):
1. You have solved a 3-variable maximisation Linear Program with the objective function of z = 4x ...
1. You have solved a 3-variable maximisation Linear Program with the objective function of z = 4x? + 3x? + 7x3. The Linear Program has two "<" constraints, and its optimal solution is as follows: (X?, X?, X3, S?, S?) = (7, 0, 0, 2, 0), z* = 28. Consider the following situations: • The objective function changes to maximise z = 4x? + 7x? + 7x3. • The objective function changes to maximise z = 3x? + 3x? + 7x3. For each situation above, analyse separately and specifically what must be checked if you were to determine whether the current basis remains optimal after the change is made. Justify your answers. (CO3, C4) [4 marks]
ANS: Optimal Solutions Consider the following linear program: Maximize z = 0x1 + 0x2 ? 3x3 ? x4 + 20, (Objective 1) subject to: x1 ? 3x3 + 3x4 = 6, (1) x2 ? 8x3 + 4x4 = 4, (2) x j ? 0 (j = 1, 2, 3, 4). Note that as stated the problem has a very speci