Scribd
Upload
184 views2 pages

Tugas 4 Penyelesaian Soal Menggunakan Metode Simplex

The document describes 3 linear programming problems involving production optimization. The first problem involves maximizing profit from 2 products produced on 2 assembly lines with limited hours. The second problem involves maximizing profit from chair and table production given limits on labor hours and wood pounds. The third problem involves maximizing bakery profit from coffee cakes and Danish given limits on flour and sugar pounds. For each problem, the document formulates the objective function and constraints to create a linear programming model to solve using the simplex method.

Uploaded by

Nur Sila
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
184 views2 pages

Tugas 4 Penyelesaian Soal Menggunakan Metode Simplex

The document describes 3 linear programming problems involving production optimization. The first problem involves maximizing profit from 2 products produced on 2 assembly lines with limited hours. The second problem involves maximizing profit from chair and table production given limits on labor hours and wood pounds. The third problem involves maximizing bakery profit from coffee cakes and Danish given limits on flour and sugar pounds. For each problem, the document formulates the objective function and constraints to create a linear programming model to solve using the simplex method.

Uploaded by

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

 

 
 
TUGAS  4  PENYELESAIAN  SOAL  MENGGUNAKAN  METODE  SIMPLEX  
No.  1  
A  company  produces  two  product  that  are  processed  on  two  assembly  lines.  Assembly  
line  1  has  100  available  hours,  and  assembly  line  2  has  42  available  hours.  Each  product  
requires  10  hours  of  processing  time  on  line  1,  while  on  line  2  product  1  requires  7  hours  
and  product  2  requires  3  hours.  The  profit  for  product  1  is  $6  per  unit,  and  the  profit  for  
product  2  is  $4  per  unit.  Formulate  a  linear  programming  model  for  this  problem  and  
solve  using  the  simplex  method.    
  X1   X2   Batasan    
(Product  1)   (Product  2)  
Line  1   10  jam   10  jam   100  jam  
Line  2   7  jam   3  jam   42  jam  
Profit   6  per  unit   4  per  unit    
     
Persamaan  :  
Fungsi  tujuan   Z  Max    =  6x1  +  4X2  
Constrain         =  10x1  +  10X2  ≤  100  
        =  7x1  +  3X2  ≤  42  
 
 
 
No.  2  
The  Pinewood  Furniture  Company  produces  chairs  and  tables  from  two  resources  -­  labor  
and  wood.  The  company  has  80  hours  of  labor  and  36  pounds  of  wood  available  each  
day.  Demand  for  chair  is  limited  to  6  per  day.  Each  chair  requires  8  hours  of  laborand  2  
pounds  of  wood  to  produce,  while  a  table  requires  10  hours  of  labor  and  6  pounds  of  
wood.   The   profit   derived   from   each   chair   is   $400   and   from   each   table,   $100.   The  
company  wants  to  determine  the  number  of  chairs  and  tables  to  produce  each  day  to  
maximize  profit.  Formulate  alinear  programming    model   for   this   problem   and   solve  
using  the  simplex  method.    
 

 
 
 

  X1   X2   Batasan  
(Chairs)   (Tables)  
Labor   8  jam   10  jam   80  jam  
Wood   2  gram   6  gram   36  gram  
Demand   1  Unit   -­   6  Unit/Hari  
Profit   400  per  unit   100  per  unit    

Persamaan  :  
Fungsi  tujuan   Z  Max    =  400x1  +  100X2  
Constrain         =  8x1  +  10X2  ≤  80  
        =  2x1  +  6X2  ≤  36  
        =  x1  ≤  6  
No.  3  
The  Crumb  and  Custard  Bakery  makes  both  coffee  cakes  and  Danish  in  large  pans.  The  
main  ingredients  are  flour  and  sugar.  There  are  25  pounds  of  flour  and  16  pounds  of  
sugar  available  and  the  demand  for  coffee  cakes  is  8.  Five  pounds  of  flour  and  2  pounds  
of   sugar   are   required   to   make   one   pan   of   coffee   cake,   and   5   pounds   of   flour   and   4  
pounds  of  sugar  are  required  to  make  one  pan  of  Danish.  One  pan  of  coffee  cake  has  a  
profit  of  $1,  and  one  pan  of  Danish  has  a  profit  of  $5.  Determine  the  number  of  pans  of  
cake  and  Danish  that  the  bakery  must  produce  each  day  so  that  profit  will  be  maximized.  
Formulate  a  linear  programming  model  for  this  problem  and  solve  using   the   simplex  
method.            
  X1   X2   Batasan  
(Coffee  Cakes)   (Danish)  
Flour   5  gram   5  gram   25  gram  
Sugar   2  gram   4  gram   16  gram  
Demad   1  Pcs   -­   8  Pcs/Hari  
Profit   1  per  pcs   5  per  pcs    

Persamaan  :  
Fungsi  tujuan   Z  Max    =  x1  +  5X2  
Constrain         =  5x1  +  5X2  ≤  25  
        =  2x1  +  4X2  ≤  16  
        =  x1  ≤  8  
 

2  
 

You might also like