BibTex Citation Data :
@article{JSINBIS18, author = {Putut Sriwasito and Bayu Surarso and Eko Sarwoko}, title = {Sistem Aplikasi Penyelesaian Masalah Program Linier Standar Maksimal Berbasis Web dengan Keluaran Sesuai Produk Kemasan terkecil}, journal = {Jurnal Sistem Informasi Bisnis}, volume = {1}, number = {2}, year = {2011}, keywords = {}, abstract = { Individual or cooperation as the producer who produces more than one product always has a problem to determine the amount of each product, as well as the smallest packaging used to generate the maximum revenue but still meet the inventory of existing facilities. If the inventory of facilities and functions form a linear function of income then the problem is called the program a maximu m linear case, where all supplies are limited means of the standard linear program is called maximal. Although the system has available a linear program to solve the problem, the system is only owned by a limited circle, this system also does not provide the smallest packaging option. In general linear programming problem is solved by the simplex method with any number of real output in decimal or fractional format mix. Settlement is not operational because the manufacturers do not always able to make the smallest product packaging in accordance with the unit on completion, to become operational, the results of this settlement may be rounded according to the smallest package selected. The problem of limited manufactures which have a system of linear program application can be overcome by providing a system similar to a web-based applications. This study compiled a web-based application system to solve a standard linear program that generates the maximum revenue that maximum use PHP software, data entered through the form and then taken by the POST method, then set up a matrix, carried out by iterating between the rows in the matrix operations that met the criteria optimal. By ch oosing the smallest packaging which is used 0.25 units or 0.50 units, the system check the number of products that have the smallest rounding according to the package selected, then the system prepare and present the inventory and revenue report. Keywords: Simplex metho; The smallest packaging; Web-based }, issn = {2502-2377}, pages = {99--107} doi = {10.21456/vol1iss2pp99-107}, url = {https://ejournal.undip.ac.id/index.php/jsinbis/article/view/18} }
Refworks Citation Data :
Individual or cooperation as the producer who produces more than one product always has a problem to determine the amount of each product, as well as the smallest packaging used to generate the maximum revenue but still meet the inventory of existing facilities. If the inventory of facilities and functions form a linear function of income then the problem is called the program a maximu m linear case, where all supplies are limited means of the standard linear program is called maximal. Although the system has available a linear program to solve the problem, the system is only owned by a limited circle, this system also does not provide the smallest packaging option. In general linear programming problem is solved by the simplex method with any number of real output in decimal or fractional format mix. Settlement is not operational because the manufacturers do not always able to make the smallest product packaging in accordance with the unit on completion, to become operational, the results of this settlement may be rounded according to the smallest package selected. The problem of limited manufactures which have a system of linear program application can be overcome by providing a system similar to a web-based applications. This study compiled a web-based application system to solve a standard linear program that generates the maximum revenue that maximum use PHP software, data entered through the form and then taken by the POST method, then set up a matrix, carried out by iterating between the rows in the matrix operations that met the criteria optimal. By ch oosing the smallest packaging which is used 0.25 units or 0.50 units, the system check the number of products that have the smallest rounding according to the package selected, then the system prepare and present the inventory and revenue report.
Keywords: Simplex metho; The smallest packaging; Web-based
Note: This article has supplementary file(s).
Article Metrics:
Last update:
Authors who submit the manuscripts to Journal JSINBIS must understand and agree that if the manuscript is accepted for publication, the copyright of the article belongs to JSINBIS and Diponegoro University as the journal publisher.
Copyright includes the exclusive right to reproduce and provide articles in all forms and media, including reprints, photographs, microfilm and any other similar reproductions, as well as translations. The author reserves the rights to the following:
JSINBIS and Diponegoro University and the Editors make every effort to ensure that no false or misleading data, opinions or statements are published in this journal. The content of articles published in JSINBIS is the sole and exclusive responsibility of the respective authors.
Copyright transfer agreement can be found here: [Copyright transfer agreement in doc] and [Copyright transfer agreement in pdf].
JSINBIS (Jurnal Sistem Informasi Bisnis) is published by the Magister of Information Systems, Post Graduate School Diponegoro University. It has e-ISSN: 2502-2377 dan p-ISSN: 2088-3587 . This is a National Journal accredited SINTA 2 by RISTEK DIKTI No. 48a/KPT/2017.
Journal JSINBIS which can be accessed online by http://ejournal.undip.ac.id/index.php/jsinbis is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
View My Stats
