求助，单纯形法习题

lianfs

Answer the following questions along with a concise explanation with respect to the linear program to maximize cx subject to x∈X={x:Ax=b,x≥0}, where A is m×n of rank m<n.
        In a simplex tableau, if z_j-c_j=-7 for a nonbasic variable x_j, what is the change in objective value when x_j enters the basis given that the minimum ratio is 3 in the pivot?
        If an extreme point is optimal, then is it possible that not all z_j-c_j≥0 for an associated basis?
        If there exists a d such that Ad=0,d≥0, and cd≥0, then is the optimal objective value unbounded?
        Let x ̅ be a feasible solution with exactly m positive components. Is x ̅ necessarily an extreme point of X?
        If a nonbasic variable x_k has z_k-c_k=0 at optimality, then can one claim that alternative optimal solutions exist?
        If x_1 and x_(2 )are adjacent points and if B_1 and B_2 are respective associated bases, then these bases are also adjacent. True or false? Explain.
2 b9 Z- ^+ Y: }( W        Is it possible for an optimal solution to have more than m positive variables?
        Suppose that n=m+1. What is the least upper bound on the number of extreme points and feasible bases?
) R' c+ k/ u" u( k7 t4 G. Z        A p-dimensional polyhedron can have at most p extreme directions. True or false? Explain.
3 R! D6 g* w  X! U8 z* g        Let x ̅ be an extreme point having (m-1) positive components. Then there are (p+1) bases associated with this extreme point, where p=n-m. True or false? (Assume that Ax=b does not imply any variable to be a constant) Explain.
1 o( z. K# X4 j0 x$ U3 I" @

z919953051

你这个可以用于ACM竞赛了。。。

wangxiaohan

好高深呀帮顶下

士心之约

' m) b4 _4 i7 g: O8 z