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

- "runner b is moving at a slower rate."

- "the graphs shown are graphs of distance(km) against time(min).

the slopes of this graphs are are given by:

slope = (change in y)/(change in x)

= (change in distance)/(change in time)

this is the formula for finding the speed. so, the slope of these graphs represent the speed of the runner.

taking each division in the graph to represent 1 on both axis:

runner a ⇒ speed = (2-0)/(1-0)

= 2/1

= 2 km/min

runner b ⇒ speed = (3-0)/(3-0)

= 3/3

= 1 km/min

this shows that   runner b is moving at a slower rate."