Print Solution to Linear Programming Problem
打印求解线性规划问题
译者:生物统计家园网 机器人LoveR
描述----------Description----------
This is a method for the function print() to print objects of class "simplex".
这是一个方法的功能print()类"simplex"打印对象。
用法----------Usage----------
## S3 method for class 'simplex'
print(x, ...)
参数----------Arguments----------
参数:x
An object of class "simplex" created by calling the function simplex to solve a linear programming problem.
一个类的对象"simplex"创建调用函数simplex求解线性规划问题。
参数:...
further arguments passed to or from other methods.
通过进一步的论据或其他方法。
Details
详情----------Details----------
The coefficients of the objective function are printed. If a solution to the linear programming problem was found then the solution and the optimal value of the objective function are printed. If a feasible solution was found but the maximum number of iterations was exceeded then the last feasible solution and the objective function value at that point are printed. If no feasible solution could be found then a message stating that is printed.
目标函数的系数被打印出来。如果被发现的线性规划问题的解决方案,然后打印的解决方案和目标函数的最优值。如果被发现,但最大迭代次数则超过一个可行的解决方案的最后一个可行的解决方案和目标函数值,在这一点上被打印出来。如果没有可行的解决方案,然后可以找到一条消息,指出印。