In section 2.4.1, for the standard form of the LP, it was shown that the dual feasibility and primal optimality conditions are identical and the primal reduced cost vector d is the same as the vector of dual logical variables. In case of CF-1 or CF-2 similar statements are true. This fact can be utilized to introduce some efficient dual algorithms.


Break Point Dual Objective Dual Algorithm Dual Constraint Nonbasic Variable 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2003

Authors and Affiliations

  • István Maros
    • 1
    • 2
  1. 1.Imperial CollegeLondonUK
  2. 2.Computer and Automation Research InstituteBudapestHungary

Personalised recommendations