Hodograph Method for Linear Programming Problems

An extremely brief account of the idea of the hodograph method is given in [4l]. It required us a good deal of time and application to several practical problems before we got convinced of its computational effectiveness It was also discovered that it is a finite method that simultaneously solves both primal and dual linear programming problems, and that it is possible to extend the method for solving nonlinear programming problems too. The method is based on the idea of modelling constraints by force fields, which was discussed in Sec.3.5.