+ /* Solve the program using the simplex method. The column representing the
+ objective variable is kept implicit, as it would never change during the
+ execution of the algorithm. */
+
+ /* Force all columns fully into existence and relocate objective row to
+ bottom in preparation of phase 1. A new objective row is calculated by
+ pricing out the constraint rows. */