nondegenerative basic feasible solution
McGraw-Hill Science & Technology Dictionary:
Top
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.
Related Videos:
Top
nondegenerative basic feasible solution
Post a question - any question - to the WikiAnswers community:
Copyrights:
McGraw-Hill Science & Technology Dictionary
McGraw-Hill Dictionary of Scientific and Technical Terms. Copyright © 2003, 1994, 1989, 1984, 1978, 1976, 1974 by McGraw-Hill Companies, Inc. All rights reserved.
Read more