Program Linear menggunakan Metode Grafik

Abstract

Linear programming is part of Operation Research which studies optimum problems. The principles of linear
programming are applied to real problems including in the fields of economics, health, education, trade,
transportation, industry, social affairs, and others. a linear programming problem is a problem related to
finding the optimal value (maximum or minimum value) of the objective function (which is a linear function in
the form Z=c_1x_1+c_2x_2+…c_nx_n\ with decision variables x_1, x_2,…, x_n depending on the
constraints/problem constraints which are expressed in the form of linear equations or inequalities. The
constraints/problem constraints are referred to as constraints functions, the decision variables on linear
programming problems must be non-negative x_1 ≥ 0, i = 1,2,…,n.The set of points that fulfill the constraint
function and the requirements of the (non-negative) decision variable is referred to as the feasible region.Any
point in the feasible solution area that yields the optimum value (maximum or minimum) of the objective
function is referred to as the optimum solution.Graphic method is a way that can be used to solve optimization
problems in linear programming.The limitation of this method is that the variables that can be used are limited
(only two), the use of 3 variables will be very difficult to do.