| 释义 |
feasible solution [`fēz·ǝ·bǝl sǝ`lü·shǝn] COMPUTER SCIENCE In linear programming, any set of values for the variables xj , j = 1, 2, ..., n, that (1) satisfy the set of restrictions where the bi are numerical constants known collectively as the right-hand side and the aij are coefficients of the variables xj , and (2) satisfy the restrictions xj ≧ 0. |