Author Question: To solve an LP with upper-bound constraints allow xi=0 or xi= ... (Read 60 times)

bcretired · **on:** Aug 1, 2018

To solve an LP with upper-bound constraints allow x_i=0 or x_i= ________.

a.s_i.

b..

c.c_i.

d.a_i.

Question 2

Which is NOT a step in the Dantzig-Wolfe decomposition algorithm?
a.Assume that a bfs solution for the restricted master is readily available.
b.Substitute the optimal values of

and

to get the optimal values of x₁, x₂... x_n.
c.Express the variables in Variable set 1 as a convex combination of the extreme points for Constraint set 1.
d.Express the variables as a convex combination of the extreme points for Constraint set k.