求助!!!!急, 大家帮我看看,谢谢了 - 数学建模社区-数学中国

Answer with 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 mxnof rank m < n

b. If an extreme point is optimal, then is it possible that not all zj-cj>=0 for an associate basis?
answer is it is possible. 要找出一个例子才行

g. Is it possible for an optimal solution to have more than m positive variables?
答案是 yes. 同样也要例子
h. Suppose that n = m+1. What is the least upper bound on the number of extreme points and feasible bases?
答案是两个结果不同. 结果是多少?

想了很久,没有想出什么例子.... 大家帮我看看!!!! 谢谢了

我想问题一的情况是虽然可以找到一个向量可以进基，但是找不到可以离基的情况。

问题二是最优解有无穷多个的情况，就是一条直线上的点都是最优解的情况。

问题三我想极点的个数上限应该是C_n²，可行基的上限应该是C_n^m。