Class of objects that result from solving a linear programming problem using simplex.
类的对象，使用simplex求解线性规划问题的结果。
代----------Generation----------
This class of objects is returned from calls to the function simplex.
这个类的对象被返回调用函数simplex。
方法----------Methods----------
The class "saddle.distn" has a method for the function print.
"saddle.distn"类有一个方法的功能print。
结构----------Structure----------
Objects of class "simplex" are implemented as a list with the following components.
对象类"simplex"实施以下组件列表。
The values of x which optimize the objective function under the specified constraints provided those constraints are jointly feasible.
x优化的目标函数在指定的限制提供了这些限制值是共同可行的。
This indicates whether the problem was solved. A value of -1 indicates that no feasible solution could be found. A value of 0 that the maximum number of iterations was reached without termination of the second stage. This may indicate an unbounded function or simply that more iterations are needed. A value of 1 indicates that an optimal solution has been found.
这表明该问题是否得到解决。没有可行的解决方案，可以发现一个-1值表示。一个0的价值，没有终止第二阶段达到最大迭代次数。这可能表明一个无限的功能或简单，需要更多的迭代。一个1值表示，已经找到最佳的解决方案。
The value of the objective function at soln.
在soln的目标函数值。
This is NULL if a feasible solution is found. Otherwise it is a positive value giving the value of the auxiliary objective function when it was minimized.
这是NULL如果找到一个可行的解决方案。否则，它是一种积极的价值，给予辅助目标函数值，当它被最小化。
The original coefficients of the objective function.
原来的目标函数系数。
The objective function coefficients re-expressed such that the basic variables have coefficient zero.
目标函数系数重新表达了这样的基本变量系数为零。
This is NULL if a feasible solution is found. Otherwise it is the re-expressed auxiliary objective function at the termination of the first phase of the simplex method.
这是NULL如果找到一个可行的解决方案。否则，它是表达在终止第一阶段单纯形法的辅助目标函数。
The final constraint matrix which is expressed in terms of the non-basic variables. If a feasible solution is found then this will have dimensions m1+m2+m3 by n+m1+m2, where the final m1+m2 columns correspond to slack and surplus variables. If no feasible solution is found there will be an additional m1+m2+m3 columns for the artificial variables introduced to solve the first phase of the problem.
最终约束矩阵表示非基本变量。如果找到一个可行的解决方案，那么这将有尺寸m1+m2+m3n+m1+m2，最终m1+m2列对应的松弛变量和剩余变量。如果没有找到可行的解决方案会有一个额外的m1+m2+m3引入到解决问题的第一阶段的人工变量列。
The indices of the basic (non-zero) variables in the solution. Indices between n+1 and n+m1 correspond to slack variables, those between n+m1+1 and n+m2 correspond to surplus variables and those greater than n+m2 are artificial variables. Indices greater than n+m2 should occur only if solved is -1 as the artificial variables are discarded in the second stage of the simplex method.
基本（非零）解决方案中的变量的指标。指数之间n+1和n+m1对应的松弛变量，n+m1+1和n+m2对应的盈余变量和那些大于之间的n+m2人工变量。指数比n+m2的应该发生，只有solved是-1人工变量被丢弃在第二阶段的单纯形法。
The final values of the m1 slack variables which arise when the "<=" constraints are re-expressed as the equalities A1%*%x + slack = b1.
m1出现松弛变量的最终值时，“<=”约束的等式表达A1%*%x + slack = b1。
The final values of the m2 surplus variables which arise when the "<=" constraints are re-expressed as the equalities A2%*%x - surplus = b2.
m2盈余出现时，“<=”约束的等式A2%*%x - surplus = b2重新表达的变量的最终值。
This is NULL if a feasible solution can be found. If no solution can be found then this contains the values of the m1+m2+m3 artificial variables which minimize their sum subject to the original constraints. A feasible solution exists only if all of the artificial variables can be made 0 simultaneously.
这是空的，如果可以找到一个可行的解决方案。如果没有办法可以解决，然后发现这个包含m1+m2+m3人工变量，尽量减少原限制他们的总和主题的值。如果人工变量都可以0同时存在一个可行的解决方案。
发表于 2012-2-16 17:37:58
