Interior point algorithm for solving farm resource allocation problem

Abstract

This paper introduces interior point algorithm as an alternative approach to simplex algorithm for solving farm resource allocation problem. The empirical result of interior point algorithm is compared with that of the simplex algorithm. It goes further to address a profit maximization problem. The result revealed several relevant patterns. Results of the interior point algorithm is similar to that of the simplex algorithm. Findings indicated that in both algorithms, the farm is to produce peppers, wheat which is irrigated and weeded manually, hire additional month of labour, and also purchase urea and muriate fertilizer to realize a similar amount of profit. Additionally, both algorithms suggested that practicing crop rotation where beans, if grown, should be altered with wheat cannot be possible since no beans will be grown. The Simplex algorithm saves 39 iterations over Interior Point algorithm in solving the farm resource allocation problem. The findings demonstrate that the interior point algorithm offers a useful alternative to the simplex algorithm when addressing farm resource allocation problem. JEL code: D24, D57, C61, C63, C67