An efficient algorithm for solving linear goal programming problems using partitioning and elimination procedures is presented. The algorithm takes advantage of the definition of ordinal preemptive ...
一些您可能无法访问的结果已被隐去。
显示无法访问的结果一些您可能无法访问的结果已被隐去。
显示无法访问的结果