Linear Polynomial Equations ℜ
One motivation for introducing constraints in the LP language Prolog was the non-declarative nature of the built-in predicates for arithmetic computations. Therefore, the first CLP languages included constraint solvers for linear polynomial equations and inequations over the real numbers (CLP(ℜ) ) or rational numbers (Prolog-III , CHIP ).
KeywordsInterest Rate Slack Variable Simplex Algorithm Rule Application Constraint Solver
Unable to display preview. Download preview PDF.