Interior-point methods constitute a robust class of algorithms for solving constrained optimisation problems by exploring the interior of the feasible region instead of traversing its boundary. These ...
Journal of Computational Mathematics, Vol. 37, No. 6 (November 2019), pp. 843-865 (23 pages) ...
This is a preview. Log in through your library . Abstract We present a generic projective interior point algorithm for linear programming which includes modified versions of Karmarkar's original ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback