Linear Programming

Group 5

Akmal Ariqsyah Putra Arnoby (C1B021060)

Artha Sary Br Limbong (C1B021121)
Dwi Noviola Aribtha (C1B021079)
Putri Ruspida Sari (C1B021089)
 Basic Idea of Linear Programming
Linear programming is a further development of the concepts of linear algebra. Linear programming is a
linear equation optimization model with respect to the linear constraints it faces. The linear programming
problem is the problem of finding the optimum (maximum or minimum) values of a linear function in a
system or set of linear constraints.

In order for an optimization problem to be solved by linear programming, there are several conditions or
characteristics that must be met, that is:
1. The problem must be converted into a mathematical problem in linear form
2. The whole system of problems must be broken down into units of activity
3. Each activity must be able to determine the exact type and location in the programming model.
4. Each activity must be quantifiable so that each value can be calculated and compared.
The formulation of a linear programming model can be done through the following steps:

 Define activity
 Determine sources (input)
 Calculate the number of inputs and outputs for each unit of activity
 Determine activity constraints
 Formulating the model, namely forming the objective function and the constraint functions

Example of Formulation of Linear Programming Model

For example, a company produces two kinds of output, namely goods A and goods B, using two kinds of raw materials, namely R
and S as inputs. Goods A or item B uses R and S as inputs in the production process. Each unit of output A requires 4 units of input R
and 3 units of input S, while each unit of B requires 2 units of R and 4 units of S. The selling prices of products A and B are IDR
5,000.00 and IDR 6,000.00, respectively. The total inventory of input R and input S owned by the company is 100 units and 120
units, respectively. How many units of A and B must be produced so that the company's revenue is maximum, with the limitation or
constraint that the use of input R and input S does not exceed 100 units and 120 units, respectively?

Fond d’écran virtuel

Answer:
We must formulate the objective function to be optimized and the constraint functions to be
encountered. Suppose z represents the company's revenue, while a and b represent amount A and
amount B, respectively, then:

Objective function: Z = 5000 a + 6000 b

Constraint function: 4a + 2b 100

3a + 4b 120

The first constraint function deals with the input R; because each unit of A requires 4 units of R
and each unit of B requires 2 units of R, even though the number of inputs of R that can be used
cannot exceed 100 units. The next constraint function relates to the input or raw material S;
because each unit of A requires 3 units of S and each unit of B requires 4 units of S. Even thou gh
the number of input S used should not exceed 120 units.
General Form of Linear Programming Model
The linear programming problem is to find the maximum or minimum optimization value. These
problems can be formulated as follows:
Maximization Problem
Maximize objective function
Z = + + …………+
Against obstacles
+ + ……… + ≤
 
+ + ……..…+ ≤
. . . .
. . . .
. . . .
+ + ……….+ ≤
Which one: ≥ 0 J = 1, 2, ………….., n
In short, maximize z =
To ≤
≥ 0 i = 1, 2, ………., m
Minimization Problem
Minimize Objective Function
Z = + + ………….. +
Against obstacles
+ + …………….. + ≥
+ + ……………… + ≥
. . . .
. . . .
. . . .
. . . .
+ + ……………… + ≥
Which one: ≥ 0 j = 1, 2, …………., n  
In short, keep it to a minimum z =
To ≥
≥ 0 i = 1, 2, …………., m

The maximization problem is encountered, for example, in the case of determining the combination of the number of
products in order to obtain maximum profit. Meanwhile, the problem of minimization is encountered, for example in the
case of efforts to reduce production costs. Variable also called decision variables. The decision variable cannot be negative
so that ≥ 0. Solving linear programming problems can be done in three ways, namely the graphical method, the algebraic
method, and the simplex method.
Graphical Method

The following, are the steps for solving the graphical method in general after the problem
model is formulated:
1. Draw the constraint functions
2. Determine the feasible area for the problem in question, that is the area bounded by the
constraint lines
3. Draw the objective function by assigning any value of z
4. make necessary shifts on the curve or the goal line by changing the value of z so that the
optimal solution point can be determined
5. The optimal solution point is the farthest corner point from other areas that can be
reached by the goal line.
Panel (a) shows an image of an equation. The area of the equation 5x + 4y = 20 is the points
along the relevant line . While panels (b) and (c) show a picture of an inequality. The
crosses in panel (b) indicate that the area to the top/right of the line does not belong to the
area of inequality 5x + 4y ≤ 20.
So the area is starting from the relevant line down/left. Or use the method indicated by panel
(c) ; the arrows represent the area that is included in the inequality 5x + 4y ≤ 20.
For inequalities marked ≥ , consider the following examples

The field below/left of the line does not include the 5x + 4y ≥ 20 area .
 Case 80

A company produces two kinds of goods, X₁ and , each using three kinds of materials, namely M₁, M₂ and
M₁. Each unit of X requires 3 units of M₁, 4 units of M₂ and 2 units of . Meanwhile, each unit of X₂
requires 2 units of M₁, 1 unit of M₂ and 8 units of M,. The total cost to make X₁ Cost and X₂ are IDR 2
thousand and IDR 3 thousand per unit, respectively. Every day the company can use at least 60 units of
M₁, 40 units of M₂ and 80 units of to be processed into the goods it produces. How many units of each
item should be made for optimal daily total costs?

Minimize z = 2000 x₁ +3000

against the constraint M₁ : 3 x₁ + 2 ≥ 60
constraint M₂ : 4 x₁ + x₂ ≥ 40
constraint : 2 x₁ + 8 ≥ 80
, x₂ ≥ 0

The area like it is the ACFI open field. The farthest angle that unit X can be drawn by the line of sight is the
point F(16, 6), the intersection of the constraint for and the constraint
So, X₁ = 16 units
X₂ = 6 units
 The minimum total cost per day, by producing 16 X₁, and 6 , is IDR 50 thousand (for comparison:
at A, z = 120 thousand; at C, z = 80 thousand; while at point I, z = 80 thousand).
 
Case 81
PT "Double-X" produces two kinds of goods, and X₂, each bringing in a profit of 25 thousand and 15 rupiah per unit. Product
X₁ is made from a mixture of K, L and M inputs. While X₂ is only made from a mixture of K and L. Each unit consists of 3 K, 2
L and 3 M, while each unit only consists of 3 units of K and 4 units of L. The number of inputs available for processing does
not exceted 24 units of K, 20 units of L and 21 units of M per minute. How many units of each item must be produced per
minute for optimal profit?

maximize z = 25 + 15

to (I) : 3 + 3≤ 24 (input K)

(II) : 2 + 4 ≤ 20 (input L)

(III) : 3 ≤ 20 (input M)

, ≥ 0
 The feasible area is the OBCEF field. The optimal solution is at point E(7,1) with z = 190.

So, by producing 7and 1 per minute, the maximum profit is 190 rupiah.

Number of inputs used: untuk menghitung jumlah input yang terpakai, kita masukkan x1 dam x2 ke
persamaan input

K = 3 + 3 = 3(7) + 3(1) = 24

L = 2 + 4 = 2(7) + 4(1) = 18

M = 3 = 3(7) = 21