Claim Missing Document
Check
Articles

Found 25 Documents
Search

Fungsi Konveks dalam Optimisasi: Struktur, Sifat, dan Generalisasinya Mas'ud, Syamsuddin
Journal of Mathematics, Statistics and Applications Vol. 2 No. 1 (2025): Mei
Publisher : PT. Lontara Digitech Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.61220/

Abstract

This article aims to provide a comprehensive review of convex functions, generalizations of convexity concepts, and their applications in optimization and mathematical analysis. Although the basic concepts of convex functions are well understood, the understanding and application of advanced concepts such as quasiconvexity, log-convexity, and conjugate functions remain limited in more complex optimization problems, particularly in the context of statistical parameter estimation and machine learning. This study employs a literature review methodology with a descriptive analysis of theories and concepts developed in books and scientific journals, comparing various approaches in optimization and more complex functional structures. The findings highlight that convex functions possess valuable characteristics for optimization, and generalizations of convexity concepts, such as quasiconvexity and log-convexity, can extend the applications of convex functions in more complex analyses, such as in statistical models and machine learning.
Optimalisasi Manajemen Inventori melalui Pelatihan dan Peningkatan Kemampuan Memanfaatkan Olsera dalam Pencatatan Stok Barang pada UMKM secara Online Mas'ud, Syamsuddin; Ramadana, Yusuf
LOSARI: Jurnal Pengabdian Kepada Masyarakat Vol. 7 No. 1 (2025): Juni 2025
Publisher : LOSARI DIGITAL

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.53860/losari.v7i1.473

Abstract

Inventory data inaccuracy is a common issue faced by many UMKM, especially those operating in the food and beverage (F&B) industry. One effective solution to address this problem is implementing proper inventory management using digital tools such as the Olsera application. This community service project aimed to optimize inventory management by providing training and improving employees' skills in using Olsera for inventory recording. The project was carried out in four stages: discussions with the partner, preparation, training implementation, and monitoring and evaluation. As a result of these activities, the partner’s ability to use Olsera improved significantly, a standardized inventory recording process was established, and inventory data inaccuracies were reduced.
Optimisasi Linear dan Kuadratik: Tinjauan Literatur Mas'ud, Syamsuddin
Semeton Mathematics Journal Vol 2 No 2 (2025): Oktober
Publisher : Program Studi Matematika

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.29303/semeton.v2i2.284

Abstract

Convex Optimization plays a crucial role in various scientific and industrial applications, such as economics, engineering, and computer science, with a primary focus on linear and quadratic optimization. This study examines the characteristics and comparison between linear and quadratic optimization, two main subclasses of convex optimization. Linear optimization (LP) is characterized by a linear objective function and linear constraints, where classical methods such as Simplex and Interior-Point are used for efficient solutions. In contrast, quadratic optimization (QP) involves a convex quadratic objective function with linear constraints, requiring more complex methods such as Karush-Kuhn-Tucker (KKT) factorization, Schur-Complement, Null-Space, Active-Set, and Interior-Point for solving. This paper summarizes various solution methods for both types of optimizations and compares their strengths and limitations. The key findings indicate that linear optimization is simpler and more efficient, while quadratic optimization offers greater flexibility in modeling problems with more complex structures. The study concludes that a deep understanding of both approaches is essential for the development of more efficient and applicable convex optimization algorithms.
Optimasi Rute Pendistribusian Barang Menggunakan Kombinasi Algoritma Branch and Bound dan Cheapest Insertion Heuristic Oeitama, Whennie Youngger; Oeitama, Whannie Youngger; Sitandi, Flora Frisilia; Mas'ud, Syamsuddin
Square : Journal of Mathematics and Mathematics Education Vol. 6 No. 2 (2024)
Publisher : UIN Walisongo Semarang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21580/square.2024.6.2.22992

Abstract

The problem that often occurs in the process of distributing goods is that the distribution route is not optimal which results in higher costs and longer travel times. This can be solved by finding the shortest path that can be passed or widely recognized as the Traveling Salesman Problem (TSP). This study aims to determine the optimal distribution route for goods using a combination of the Branch and Bound and Cheapest Insertion Heuristic algorithms. The data used are in the form of location names and distances between locations that have been collected by Putra BJ Bangun in his research entitled Solving the Traveling Salesman Problem (TSP) with the Branch and Bound Method (Application of the Palembang Post Office Goods Transportation Problem). The results of the research indicate that the optimal route for the distribution of goods at the Palembang City Post Office, using a combination of both algorithms, is: KPRK Palembang → KPC Kapt A. Rivai → KPC Pakjo → KPC Talang Ratu → KPC Sukarami → KPC Alang Lebar → KPC Sekip → KPC Cinde → KPRK Palembang, spanning a total of 24.3 km. This route can be an alternative for salesmen to visit several KPCs and return to KPRK, with more efficient costs and time because it is the shortest route. In addition, this combination of algorithms is more efficient and simpler in terms of processing steps and computing time compared to using the Branch and Bound algorithm.Keywords: Traveling Salesman Problem (TSP), Branch and Bound, Cheapest Insertion Heuristic, Algorithm Combination, Optimal.
Pelatihan Aplikasi ZOTERO dalam Upaya Optimalisasi Penulisan Referensi pada Karya Tulis Ilmiah bagi Guru-Guru di Kabupaten Takalar Mas'ud, Syamsuddin; Ihsan, Hisyam; Tampa, Alimuddin; Sukarna; Ashari, Nur Wahidin
LOSARI: Jurnal Pengabdian Kepada Masyarakat Vol. 5 No. 2 (2023): Desember 2023
Publisher : LOSARI DIGITAL

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.53860/losari.v5i2.167

Abstract

This service is conducted in Takalar Regency, South Sulawesi Province. It is motivated by several issues faced by our partners, including the limited knowledge of teachers in utilizing Zotero through Microsoft Word for automatic reference citations, the relatively low awareness of the basic applications for referencing among teachers, and the need for teachers to prepare themselves in creating automated references. Therefore, the objective of this activity is to address these partner-related issues. The methods employed include outreach and teaching, discussions, and collaborative training between the implementers and the partners. The training participants are middle school math teachers from Takalar Regency, members of the Mathematics Subject Teachers' Meeting organization (MGMP Matematika SMP). Through this activity, it is expected that teachers' knowledge in utilizing the Zotero application will increase, raising awareness and understanding among teachers about the importance of flexible and automatic reference application usage, enhancing teachers' insight, abilities, and skills in utilizing Microsoft Word to be more informative and innovative.