A unified feasible direction interior approach to the minimization of linear and general objective functions subject to linear constraints
AbstractA modification of Snyman's interior feasible direction method for linear programming is proposed and the method is also extended to problems where the objective function is non-linear. The method attempts to identify the optimal bounding set of active constraints. In the modified algorithm the successive interior steps in the identifying cycle are no longer constrained to be in the place of constant objective function value, but are computed to ensure improvement in the objective function for any non-zero step taken within the cycle. The method is also extended to non-linear objective functions by allowing for line searches within the interior and along bounding hypersurfaces. A formal unified algorithm is presented and the method is illustrated by its successful application to a number of simple problems from different categories.
The following license applies:
Attribution CC BY
This license lets others distribute, remix, tweak, and build upon your work, even commercially, as long as they credit you for the original creation.