A unified feasible direction interior approach to the minimization of linear and general objective functions subject to linear constraints

P.J. Vermeulen, J.A Snyman

Abstract


A 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.

Full Text:

PDF


DOI: https://doi.org/10.5784/8-2-464

Refbacks

  • There are currently no refbacks.





ISSN 2224-0004 (online); ISSN 0259-191X (print)

Powered by OJS and hosted by Stellenbosch University Library and Information Service since 2011.


Disclaimer:

This journal is hosted by the SU LIS on request of the journal owner/editor. The SU LIS takes no responsibility for the content published within this journal, and disclaim all liability arising out of the use of or inability to use the information contained herein. We assume no responsibility, and shall not be liable for any breaches of agreement with other publishers/hosts.

SUNJournals Help