feasible solution

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 ai j are coefficients of the variables xj , and (2) satisfy the restrictions xj ≥ 0.