Penyelesaian Masalah Pemrograman Kuadratik Menggunakan Metode Beale

Abstract

Quadratic programming is a special form of nonlinear programming which has the general form of the objective function in the form of a quadratic functions and the constraints in the form of linear functions. One of the methods used to solve the quadratic programming model is Beale’s method. This method is a modification of the simplex method for linear programming problems. This study aims to determine the optmal results of paddy production data in Balikpapan city using Beale’s method. The quadratic programming model was formed using the least squares method with the objective functions by selecting two types of plants,namely lowland paddy and upland paddy. Furthermore, the quadratic programming model formed that is formed is solved using Beale’s method. The data used is data on the paddy production of balikpapan city in 2005-2019.  Based on the calculatios, the objective function is  with the constraint functions  and . After calculating using Beale’s method, the optimal result for the maximum yield of lowland paddy and upland paddy is  quintals with a harvested area of   hectares of lowland paddy and a harvested paddy of hectares of upland paddy.