Consider a maximization linear programming problem with extreme points xi, x2, Xz. and x4. and extreme directions d1,. d2, and dz. and with an objective function gradient e such that cx1 =4, cx2 = 6, cx3= 6, cx4=3, cd1= 0, cd2=0, and cd3=2. Characterize the set of alternative optimal solutions to this problem.

Set of alternative optimal solution : 0 ≤ z ≤ 1.5

Hence There will be an infinite set of Alternative optimal solution

Step-by-step explanation:

considering Cx1 = 4

∴ C = 4 / x1

Cx2 = 6

∴ 4x2 - 6x1  = 0

2x2 - 3x1 = 0 ------ ( 1 )

considering Cx3 = 6

C = 6/x3

Cx4 = 3

∴ (6/x3) x4 - 3 = 0

= 2x4 - x3 = 0 ---- ( 2 )

attached below is the remaining part of the solution

set of alternative optimal solution : 0 ≤ z ≤ 1.5

There will be an infinite set of Alternative optimal solution

line or a linear equation graph

step-by-step explanation:

where is the rest of the

step-by-step explanation: