Putut Sriwasito
Jurusan Matematika, Fakultas Sains dan Matematika, Universitas Diponegoro

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

PERKALIAN BINER BILANGAN N DIGIT DENGAN 3, 4, 5 DAN 6 Sriwasito, Putut
MATEMATIKA Vol 11, No 1 (2008): JURNAL MATEMATIKA
Publisher : MATEMATIKA

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (69.619 KB)

Abstract

In this paper we discuss about binary multiplication of n digits number with numbers 3, 4, 5 and 6. To dispose of carry in and carry out in union result table of summation and table of multiplication, those operation are related to  half of k.  
Sistem Aplikasi Penyelesaian Masalah Program Linier Standar Maksimal Berbasis Web dengan Keluaran Sesuai Produk Kemasan terkecil Sriwasito, Putut; Surarso, Bayu; Sarwoko, Eko Adi
JSINBIS (Jurnal Sistem Informasi Bisnis) Vol 1, No 2 (2011): Volume 1 Nomor 2 Tahun 2011
Publisher : Universitas Diponegoro

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (847.888 KB) | DOI: 10.21456/vol1iss2pp99-107

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