ABIYOGA PAMUNGKAS, BAYU (2014) ANALISIS KOMBINASI PRODUKSI UNTUK MENCAPAI LABA MAKSIMUM DENGAN MENGGUNAKAN LINEAR PROGRAMMING METODE SIMPLEK PADA CV RESKA WODERN FASHION PALEMBANG. Other thesis, politeknik negeri sriwijaya.
|
Text (Cover)
LAMPIRAN DEPAN COVER.pdf Download (285kB) | Preview |
|
|
Text (BAB I PENDAHULUAN)
BAB I.pdf Download (239kB) | Preview |
|
|
Text (BAB II TINJAUAN PUSTAKA)
BAB II.pdf Download (157kB) | Preview |
|
![]() |
Text (BAB III KEADAAN UMUM PERUSAHAAN)
BAB III..pdf Restricted to Repository staff only Download (52kB) |
|
![]() |
Text (BAB IV HASIL DAN PEMBAHASAN)
BAB IV.pdf Restricted to Repository staff only Download (253kB) |
|
|
Text (BAB V KESIMPULAN DAN SARAN)
BAB V.pdf Download (4kB) | Preview |
|
|
Text (Daftar Pustaka)
daftar pustaka.pdf Download (127kB) | Preview |
Abstract
CV Reska Wodern Fashion Palembang is one of the convection company in Palembang. Located at Jalan Perindustrian 1 No. 08 Rt. 32/11 Sukarame Km. 9 Palembang. CV Reska Wodern Fashion Palembang produces 2 types of products, they are jackets and shirts. Author analyzed the combination of production to generate maximum profits by using the Simplex Method of Linear Programming. Data collection methods used were field research (interviews and observations), documentation and library research. Theory of the Simplex Method of Linear Programming used was based on the theory of Yamit (2009) and Herjanto (2008). Based on the analysis and the data were performed using the Simplex Method of Linear Programming, the Maximum profit is Rp 4.183.505,01 in a month. With the combination produced total 407,60005 pieces of jackets and 0 pieces of shirts. So in a year the maximum profit that can achieved is Rp 4.183.505,01 x 12 = Rp 50.202.060,1 and the conclusion is CV Reska Wodern Fashion Palembang should only produce jackets in order to achieve the maximum profit. Key words: combination of production, maximum profits, linear programming simplex method
Item Type: | Thesis (Other) |
---|---|
Uncontrolled Keywords: | combination of production, maximum profits, linear programming simplex method |
Subjects: | H Social Sciences > HB Economic Theory |
Divisions: | Business Administration > Undergraduate Theses |
Depositing User: | Mr Bambang Anthony |
Date Deposited: | 21 Jan 2016 02:00 |
Last Modified: | 21 Jan 2016 02:00 |
URI: | http://eprints.polsri.ac.id/id/eprint/709 |
Actions (login required)
![]() |
View Item |