Scribd
Upload
29 views3 pages

Goal Programming

The document describes a goal programming model for a company that manufactures two products. The company has constraints on labor hours, materials, and goals for minimum total profit, batch sizes, and meeting demand for one product. The optimal solution is to produce 11 units of product 1 and 7 units of product 2 to maximize profit at 260 units, meeting all the goals and constraints.

Uploaded by

Galang Grezanto
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
29 views3 pages

Goal Programming

The document describes a goal programming model for a company that manufactures two products. The company has constraints on labor hours, materials, and goals for minimum total profit, batch sizes, and meeting demand for one product. The optimal solution is to produce 11 units of product 1 and 7 units of product 2 to maximize profit at 260 units, meeting all the goals and constraints.

Uploaded by

Galang Grezanto
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

A.

Goal Programming
Goal programming models are very similar to linear programming models but whereas linear
programs can have several objectives. Consider the following example. Suppose that a
company manufactures two products (x1 and x2). The resource requirements and profit are in
the table below

Jenis Produksi
operasi kapasitas (hours)
x1 x2
labor hours per unit 3 6 72
material per unit 2 1 30
profit per unit 16 12
In addition the company has the following goals :

1. The total profit should be at least 250


2. It takes time to set up to produce in batches of at least 5
3. The current demand for product 1 is 14 therefore we would like to produce 14 exactly

B. Jawaban
Constraint 1 : 16x1 + 12x2 ≥ 250

Constraint 2 : 3x1 + 6x2 ≤ 72

Constraint 3 : 2x1 + x2 ≤ 30

Constraint 4 : x2 ≥ 5

Constraint 5 : x1 = 14

Tabel :
Summary :

Grafik :
C. Kesimpulan
Hasil yang paling optimal dari Goal Programming diatas adalah dengan memproduksi X1 sebanyak
10.6 ≈ 11 dan X2 sebanyak 6.7 ≈ 7 untuk profit yang maksimal dari barang tersebut. Dengan
memproduksi X1 sebanyak 11 dan X2 sebanyak 7 maka akan mendapatkan keuntungan sebesar 260.

You might also like