本文给出了用代理约束选取混合整数线性规划问题初始可行解的一种方法。
In this paper, a method using surrogate constraint to select an initial feasible solution of a mixed integer linear programming problem is presented.
由于从数据库代理程序直接调度非预取 I/O，因此非预取 I/O 不受 NUM_IOSERVERS 约束。
Non-prefetch I/Os are scheduled directly from the database agents and as a result are not constrained by NUM_IOSERVERS.
它实现了所有权和经营权的集中，从而降低代理成本、激励和约束管理层。
It has realized the concentration of ownership and right of administration, so reduces agency cost, incents and restricts the management.
应用推荐