TUGAS TEKNIK KUANTITATIF

LINEAR PROGRAMMING

Nama : Gustia Mahendra

NIM : 2020932015

3.1-11 The Omega Manufacturing Company has discontinued the production of a

certain unprofitable product line. This act created considerable excess production
capacity. Management is considering devoting this excess capacity to one or
more of three products; call them products 1, 2, and 3. The available capacity on
the machines that might limit output is summarized in the following table:
Machine Type Available Time (Machie Hours per Week)
Milling Machine 500
Lathe 350
Grinder 150

The number of machine hours required for each unit of the respective products is:
Productivity coefficient (in machine hours per unit)
Machine Type Product 1 Product 2 Product 3
Milling Machine 9 3 5
Lathe 5 4 0
Grinder 3 0 2

The sales department indicates that the sales potential for products 1 and 2
exceeds the maximum production rate and that the sales potential for product 3 is
20 units per week. The unit profit would be $50, $20, and $25, respectively, on
products 1, 2, and 3. The objective is to determine how much of each product
Omega should produce to maximize profit.
(a) Formulate a linear programming model for this problem.
(b) Use a computer to solve this model by the simplex method.

Solution:

Diketahui:
Available Time (Machie Hours per
Machine Type Pduction Time (hours/unit) Week)
Product 1 Product 2 Product 3
Milling Machine 9 3 5 500
Lathe 5 4 0 350
Grinder 3 0 2 150
Profit per unit $ 50,00 $ 20,00 $ 25,00
 a. Formulasi model program linier
 Variabel keputusan :
x1 : jumlah produk 1 yang diproduksi per minggu
x2 : jumlah produk 2 yang diproduksi per minggu
x3 : jumlah produk 3 yang diproduksi per minggu
 Fungsi Tujuan : maksimasi
Z = 50 x1 + 20 x2 + 25 x3
 Pembatas : 9 x1 + 3 x2 + 5x3 ≤ 500
5 x1 + 4 x2 ≤ 350
3 x1 + 2x3 ≤ 500
x1, x2, x3 ≥0
b. Penyelesaian model dengan komputer

Maka untuk memaksimalkan profit jumlah produk yang harus diproduksi per
minggu adalah:
Produk 1 (x1) = 0 unit
 Produk 2 (x2) = 87,5 unit
Produk 3 (x3) = 47,5 unit

Sehingga diperoleh profit sebesar $ 2937,5

3.4-9 Ralph Edmund loves steaks and potatoes. Therefore, he has decided to go
on a steady diet of only these two foods (plus some liquids and vitamin
supplements) for all his meals. Ralph realizes that this isn’t the healthiest diet, so
he wants to make sure that he eats the right quantities of the two foods to satisfy
some key nutritional requirements. He has obtained the nutritional and cost
information shown at the top of the next column.Ralph wishes to determine the
number of daily servings (may be fractional) of steak and potatoes that will meet
these requirements at a minimum cost.
(a) Formulate a linear programming model for this problem.
(b) Use the graphical method to solve this model.
(c) Use a computer to solve this model by the simplex method.

Grams of ingredient per Daily

Ingredient serving Requirement
Steak Potatoes (Gram)
Carbohydrate
s 5 15 ≥ 50
Protein 20 5 ≥ 40
Fat 15 2 ≤ 60
Cost per
serving $ 4,00 $ 2,00

Solution:
a. Formulasi model program linier
 Variabel keputusan :
x1 : jumlah porsi stik yang disajikan per hari
x2 : jumlah porsi kentang yang disajikan per hari
 Fungsi Tujuan : minimasi
Z = 4 x 1 + 2 x2
 Pembatas : 5 x1 + 15 x2 ≥50
20 x1 + 5 x2 ≥40
15 x1 + 2 x2 ≤ 60
x1, x2 ≥0

b. Penyelesaian dengan metode grafik

Jika: 5 x1 + 15 x2 ≥50
x1 = 0  maka 5(0) + 15 x2 = 50
x2 = 3,33
x2 = 0  maka 5x1 + 15(0) = 50
x1 = 10
20 x1 + 5 x2 ≥40
 x1 = 0  maka 20(0) + 5x2 = 40
x2 =8
x2 = 0  maka 20x1 + 5(0) = 40
x1 =2
15 x1 + 2 x2 ≤ 60
x1 = 0  maka 15(0) + 2x2 = 60
x2 = 30
x2 = 0  maka 15x1 + 2(0) = 60
x1 =4
Grafik:

Titik potong grafik:

Persamaan 1 & 2 Persamaan 1 & 3
5 x1 + 15 x2 = 50 5 x1 + 15 x2 = 50
20 x1 + 5 x2 = 40 15 x1 + 2 x2 = 60

20 x 1+60 x 2=200 15 x 1+45 x 2=150

20 x 1+5 x 2=40 15 x 1+2 x 2=60
¿ −¿ ¿ ¿ −¿ ¿
55 x 2=160 43 x 2=90
x 2=2,91 x 2=2,09
20 x 1+5 x 2=40 15 x 1+ x 2=60
20 x 1+ 5 (2,91 ) =40 15 x 1+ 2 ( 2,09 ) =60
¿ 25,45 ¿ 55,81
x 1= x 1=
20 15
x 1=1,27 x 1 3,72

Corner poin solution: Z = 4 x1 + 2 x2

x1 x2 Z
1,27 2,91 10,9
3,72 2,09 19,06
0 8 16
0 30 60 Jumlah porsi stik yang disajikan per
hari adalah 1,27 porsi dan jumlah porsi kentang yang disajikan per hari
2,91porsi sehingga diperoleh biaya penyajian minimum per porsi yaitu
$10,9.
 c. Penyelesaian dengan komputer

3.4-12 The Medequip Company produces precision medical diagnostic equipment

at two factories. Three medical centers have placed orders for this month’s
production output. The table below shows what the cost would be for shipping
each unit from each factory to each of these customers. Also shown are the
number of units that will be produced at each factory and the number of units
ordered by each customer.
To Unit Shipping Cost
Customer Customer Customer
Frrom 1 2 3 Output
 Factory 1 $600 $800 $700 400
Factory 2 $400 $900 $600 500
Order Size (unit) 300 200 400  

A decision now needs to be made about the shipping plan for how many units to
ship from each factory to each customer.
(a) Formulate a linear programming model for this problem.
(b) Solve this model by the simplex method.

\Solution:
a. Formulasi model program linier
 Variabel keputusan :
x11 : jumlah produk yang dikirim dari pabrik 1 ke customer 1
x12 : jumlah produk yang dikirim dari pabrik 1 ke customer 2
x13 : jumlah produk yang dikirim dari pabrik 1 ke customer 3
x21 : jumlah produk yang dikirim dari pabrik 2 ke customer 1
x22 : jumlah produk yang dikirim dari pabrik 2 ke customer 2
x23 : jumlah produk yang dikirim dari pabrik 2 ke customer 3

 Fungsi Tujuan : minimasi

Z = 600x11 + 800x12 + 700x13 + 400x21 + 900x22 + 600x23

 Pembatas : x11 + x12 + x13 ≤ 400

x21 + x22 + x23 ≤ 500
x11 + x21 ≤ 300
x12 + x22 ≤ 200
x13 + x23 ≤ 400
x11 , x12 , x13 , x21 ,x22 ,x23 ≥0

b. Penyelesaian dengan metode simpleks

3.4-14. The Metalco Company desires to blend a new alloy of 40 percent tin, 35
percent zinc, and 25 percent lead from several available alloys having the
following properties:
Alloy
Property
1 2 3 4 5
Percentage of tin 60 25 45 20 50
Percentage of zinc 10 15 45 50 40
Percentage of lead 30 60 10 30 10
Cost ($/lb) 77 70 88 84 94

The objective is to determine the proportions of these alloys that should be

blended to produce the new alloy at a minimum cost.
(a) Formulate a linear programming model for this problem.
(b) Solve this model by the simplex method.
Solution:

3.5-3. Ed Butler is the production manager for the Bilco Corporation, which
produces three types of spare parts for automobiles. The manufacture of each
part requires processing on each of two machines, with the following processing
times (in hours):
Machin Part
e A B C
1 0,02 0.03 0,05
2 0,05 0,02 0,04

Each machine is available 40 hours per month. Each part manufactured will yield
a unit profit as follows:
  Part
A B C
Profit
$ 300 $ 250 $ 200

Ed wants to determine the mix of spare parts to produce in order to maximize

total profit.
(a) Formulate a linear programming model for this problem.
(b) Display the model on an Excel spreadsheet.
(c) Make three guesses of your own choosing for the optimal solution. Use the
spreadsheet to check each one for feasibility and, if feasible, to find the value
of the objective function.

Solution: