Revise your code just as you would revise an essay.
Sketch, write, delete, reformulate, ask others what they think.
method is based on LIPSOL (Linear Interior Point Solver, ), which is a variant of Mehrotra's predictor-corrector algorithm , a primal-dual interior-point method.
A number of preprocessing steps occur before the algorithm begins to iterate. The first stage of the algorithm might involve some preprocessing of the constraints (see Interior-Point-Legacy Linear Programming).
The List exercises for example are more complicated in languages like C that don’t have build-in support for lists.
I suppose they are also useful, although much easier, whenever an experienced person wants to learn a new language.
For example if the task is sorting lists, sort some short lists yourself.
A reasonable method would be to find the smallest element, write it down and cross it out of the original list and repeat this process until you have sorted the whole list.
These usually arise from linear constraint matrices that have large condition number, or problems that have large solution components.
To correct these issues, try to scale the coefficient matrices, eliminate redundant linear constraints, or give tighter bounds on the variables.