nondegenerative basic feasible solution

nondegenerative basic feasible solution

[¦nän·di′jen·rəd·iv ′bā·sik ′fēz·ə·bəl sə′lü·shən] (computer science) In linear programming, a basic feasible solution with exactly m positive variables xi , where m is the number of constraint equations.