Article Per Year (5 Year)
p-Index From 2019 - 2024
0
P-Index
This Author published in this journals
All Journal Jurnal Pilar Sains Jurnal Online Mahasiswa (JOM) Bidang Matematika dan Ilmu Pengetahuan Alam
M. D. H. Gamal
Unknown Affiliation
Agriculture, Biological Sciences & Forestry Chemistry Mathematics Physics

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

Found 5 Documents
Search

 1 
Nilal Tunal Anultas Naik dan Anuitas Turun Dengan Mempertimbangkan Tingkat Inflasi Konstan Gamal, M. D. H.; Sitompul, Dewi Utami; Kho, Johannes
Jurnal Pilar Sains Vol 5, No 01 (2006)
Publisher : Jurnal Pilar Sains

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Given an interest rate i and an inflation rate j, both are constant and not equal to zero for n periods. For twocases I > j and i < j , we can obtain the geometrically varying annuity and real cash flow present valuesfrom the increasing and decreasing immediate annuities.
PENYUSUNAN JADWAL PETUGAS SEKURITI DENGAN PROGRAM GOL Marbun, Herlina; Lily, Endang; Gamal, M. D. H.
Jurnal Online Mahasiswa (JOM) Bidang Matematika dan Ilmu Pengetahuan Alam Vol 1, No 2 (2014): Wisuda Oktober 2014
Publisher : Jurnal Online Mahasiswa (JOM) Bidang Matematika dan Ilmu Pengetahuan Alam

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

This article discusses a goal programming technique for security rostering. The goal programming used is the weighted or non-preemptive. This technique is implemented to solve a case study in a real life problem of security rostering in a construction company. The results of computation with LINGO show that security rostering by goal programming is better than manual rostering.
OPTIMISASI PENYUSUNAN JADWAL MATA KULIAH DENGAN PROGRAM GOL Samuel Jun Harli; Endang Lily; M. D. H. Gamal
Jurnal Online Mahasiswa (JOM) Bidang Matematika dan Ilmu Pengetahuan Alam Vol 2, No 1 (2015): Wisuda Februari 2015
Publisher : Jurnal Online Mahasiswa (JOM) Bidang Matematika dan Ilmu Pengetahuan Alam

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

This paper discusses a mathematical modeling to establish a course schedule opti-mally. Goal programming model formed is utilized to maximize the satisfaction of the desired values while still meeting the specied limits: limits on days, the time span, the number of faculties, the number of rooms allocated, the number of stu-dents taking the courses, the number and type of courses that will be scheduled.
OPTIMISASI RUTE PENDISTRIBUSIAN SEJENIS PRODUK DENGAN MENGGUNAKAN PROGRAM GOL Fitri Marlina; Tumpal P. Nababan; M. D. H. Gamal
Jurnal Online Mahasiswa (JOM) Bidang Matematika dan Ilmu Pengetahuan Alam Vol 1, No 2 (2014): Wisuda Oktober 2014
Publisher : Jurnal Online Mahasiswa (JOM) Bidang Matematika dan Ilmu Pengetahuan Alam

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

This article discusses a goal programming technique for optimal vehicle routes of distribution of a product. The goal programming used is the weighted one. This technique is implemented in a real life case of distributing a product in a company. Computational experiments show that determination of vehicle routes using goalprogramming technique is more effective than using only driver knowledge, because it is able to satisfy all of goals expected in the distribution process.
MEMBANDINGKAN ALGORITMA D’SATUR DENGAN ALGORITMA VERTEX MERGE DALAM PEWARNAAN GRAF TAK BERARAH Daratun Nasihin; Endang Lily; M. D. H. Gamal
Jurnal Online Mahasiswa (JOM) Bidang Matematika dan Ilmu Pengetahuan Alam Vol 2, No 1 (2015): Wisuda Februari 2015
Publisher : Jurnal Online Mahasiswa (JOM) Bidang Matematika dan Ilmu Pengetahuan Alam

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

This article provides an undirected graph vertex coloring. Graph vertex coloring can be done by using the coloring algorithm, including d’satur algorithm and vertex merge algorithm. Of the two algorithms, a more efficient algorithm is determined that generates chromatic number χ(G) which is the minimum or produces fewercolors. This article is a review of the work of Handrizal et. al [Journal of Computer Science 7(5):664-670].
Co-Authors Daratun Nasihin Dewi Utami Sitompul Endang Lily Fitri Marlina Herlina Marbun Johannes Kho Samuel Jun Harli Tumpal P. Nababan