2016 | OriginalPaper | Chapter
The Artificial Constraint Algorithm
Author : Quirino Paris
Published in: An Economic Interpretation of Linear Programming
Publisher: Palgrave Macmillan US
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
When it is difficult to find an initial basic feasible solution for either the primal or the dual problem, the artificial constraint algorithm provides a dual alternative to the artificial variable method. This is so because the dual of a variable is a constraint and vice versa (see chapter 2). Armed with this dual notion (variable ←→ constraint), we can infer the requirements of the artificial constraint algorithm from the requirements of the artificial variable algorithm by simply exchanging every dual notion, as in the scheme shown in table 11.1.