Claim Missing Document
Check
Articles

Penerapan teorema spektral pada matriks simetris dalam pemodelan sistem dinamik linier Ayu Novita; Sisca Octarina; Fitri Puspita
Papanda Journal of Mathematics and Science Research Vol. 5 No. 1 (2026): Volume 5 Nomor 1 Maret 2026
Publisher : Papanda Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.56916/pjmsr.v5i1.2805

Abstract

This article examines the application of the spectral theorem for symmetric matrices in the modeling of linear dynamical systems. The study covers proofs of core properties of symmetrical matrices (real eigenvalues, orthogonality of eigenvectors associated with distinct eigenvalues, and orthogonal diagonalization), and applies these theoretical results to solve low-dimensional linear dynamical systems commonly found in vibration models and simple mechanical systems. In addition to theoretical proofs, the paper includes computational examples (2×2 and 3×3 systems), stability analysis via matrix spectra, and pedagogical implications for teaching linear algebra at the university level. The computational results show that the spectral theorem effectively predicts system behavior through eigenvalue signs: positive eigenvalues produce exponential divergence, while negative eigenvalues produce convergence to equilibrium. Visualization confirms that trajectories align with the dominant eigenvector direction, demonstrating the geometric significance of spectral decomposition. This study also highlights the pedagogical impact of integrating spectral analysis with computational tools, showing that visualization-supported explanations improve students’ conceptual understanding of eigenvalues, eigenvectors, and system stability. The approach supports deeper learning in university-level mathematics education.
Penerapan programming metode simpleks dalam penjadwalan produksi multi-produk dengan analisis sensitivitas Warda Hafizah; Sisca Octarina; Fitri Maya Puspita
Papanda Journal of Mathematics and Science Research Vol. 5 No. 1 (2026): Volume 5 Nomor 1 Maret 2026
Publisher : Papanda Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.56916/pjmsr.v5i1.3068

Abstract

Production scheduling in the multi-product manufacturing industry faces increasingly complex challenges related to the allocation of limited resources such as raw materials, machine hours, and labor. In the era of industry 4.0, operational efficiency is a key determinant of competitiveness, yet many medium-scale industries still rely on intuitive methods that fail to capture the multidimensional trade-offs of production. This study, designed as a simulative case study, aims to apply the linear programming approach using the simplex method to determine the optimal product combination that maximizes profit and to perform a deep sensitivity analysis to evaluate resource resilience within a conceptual manufacturing environment. The simplex algorithm is processed iteratively to reach the optimal solution, followed by sensitivity analysis to identify binding constraint and calculate shadow price. The results indicate that the optimal production composition generated by the simplex model is capable of increasing projected profits 22,4% compared to the conventional heuristic method. Furthermore, sensitivity analysis reveals that machine hours constitute a critical resource (scarce) with a significant positive shadow price, providing a concrete managerial recommendation to prioritize capacity expansion in that sector over labor expansion. It is concluded that the simplex method provides a robust, measurable, and adaptable basis for strategic decision-making in production operations amidst market fluctuations
Analysis of Factors Influencing Poverty in South Sumatra Using the Poisson Regression Model Manik, Jolius Saut Mangaraja; Fitri Maya Puspita; Sisca Octarina
STATMAT : JURNAL STATISTIKA DAN MATEMATIKA Vol 8 No 1 (2026)
Publisher : Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Pamulang, Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.32493/sm.v8i1.54763

Abstract

Poverty remains a key development issue for the government, including in South Sumatra Province. This study aims to analyze the factors influencing poverty levels at the district/city level using a Poisson regression model. The independent variables used include the open unemployment rate, education level, Gross Regional Domestic Product (GRDP) per capita, and the percentage of the population working in the informal sector. The data used are secondary data obtained from the Central Statistics Agency (BPS) for the most recent available year. The analysis shows that several variables significantly influence the number of poor people in South Sumatra, where increasing open unemployment and a high proportion of informal workers tend to increase the number of poor people. Conversely, increasing education and GRDP per capita contribute to reducing poverty levels. The Poisson regression model proved appropriate for modeling the number of incidents (count) data in this study. These findings are expected to provide input for local governments in formulating more targeted poverty alleviation policies.
OPTIMASI MIX PRODUKSI TOKO ROTI CHEN BAKERY DENGAN MENGGUNAKAN METODE LINEAR PROGRAMMING BERBASIS LINGO Muhammad Naufal Farras; Sisca Octarina; Fitri Maya Puspita
Jurnal Komputer Terapan Vol 12 No 1 (2026): Jurnal Komputer Terapan
Publisher : Politeknik Caltex Riau

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35143/jkt.v12i1.6840

Abstract

Small and Medium Enterprises (SMEs), like "Chen Bakery," often struggle with figuring out the best way to plan their daily production to make the most profit. There is a gap in research because not enough use mathematical models and computer tools to help with these decisions. This study tries to help "Chen Bakery" make more money each day by finding the best amounts to produce four main products—Sweet Bread, Sugar Donut, Mini Pizza, and Chocolate Pull-Apart Bread—while taking into account how much of the main ingredients they have and how much space is available in the oven. The method used is called Linear Programming, and it was set up and solved using LINGO 20.0 software. The results show that by planning production better, the bakery can make 24.7% more profit than it does now. LINGO software works well to find the best solutions and also helps understand how changes might affect the results, making it a useful tool for small business owners.
The Bender’s decomposition model to optimize temporary waste disposal sites based on general algebraic modeling system Sisca Octarina; Fitri Maya Puspita; Endro Setyo Cahyono; Evi Yuliza; Pebriyanti Simanjuntak; Siti Suzlin Supadi
Indonesian Journal of Electrical Engineering and Computer Science Vol 41, No 2: February 2026
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v41.i2.pp666-679

Abstract

Waste constitutes a substantial problem in urban and residential locales, as the volume of refuse escalates in tandem with population increase, deteriorating community quality of life. One solution to this problem is to provide temporary waste disposal sites (TWDS). This research discussed optimizing TWDS in the Sukarami Subdistrict, Palembang City, which consists of seven villages. The current TWDS in the Sukarami Subdistrict is irregular, with some sites located close together and others far apart. The optimization problem is solved by formulating the set covering problem (SCP) model, namely the set covering location problem (SCLP), the p-Median problem, and the Bender’s decomposition model. All models were solved using the general algebraic modeling system (GAMS) software. The research introduces a Bender’s decomposition model based on the SCLP model. The Sukarami Subdistrict has 29 TWDS located in only five villages. Using the SCLP and Bender’s decomposition models, the study identified 19 optimal TWDS in the Sukarami Subdistrict. Based on the solution of the p-Median problem, there are seven TWDS that can meet each village’s demand. This study recommends the optimal TWDS obtained from the Bender’s decomposition model. Additionally, two TWDS are recommended to be added, each in Sukodadi and Talang Betutu villages.
Optimization of Palm Oil Distribution Routes Using the Saving Matrix Approach and Genetic Algorithm on Capacitated Vehicle Routing Problem Evi Yuliza; Yuli Andriani; Indrawati Indrawati; Sisca Octarina; Diah Putri Ramadani
CAUCHY: Jurnal Matematika Murni dan Aplikasi Vol 10, No 2 (2025): CAUCHY: JURNAL MATEMATIKA MURNI DAN APLIKASI
Publisher : Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18860/cauchy.v10i2.36371

Abstract

The transportation of goods and services is a strategic issue in logistics systems, particularly in the palm oil industry. One of the key distribution optimization challenges is the Capacitated Vehicle Routing Problem (CVRP), which involves determining optimal distribution routes while considering vehicle capacity constraints. This study aims to identify the shortest distribution routes for transporting fresh oil palm fruit bunches from collection points to the palm oil mill, with the goal of minimizing total vehicle travel distance. A heuristic approach using the Saving Matrix method and a metaheuristic approach using a Genetic Algorithm were applied separately to two regions: Block P and Block Q, each consisting of 14 collection points with daily distribution schedules. The performance of both algorithms was analyzed and compared in the context of region-based distribution.The results show that the Genetic Algorithm yields more optimal solutions than the Saving Matrix, reducing the total travel distance by 33.92% in Block P and 32.81% in Block Q. In comparison, the Saving Matrix achieved reductions of 38.72% in Block P and 35.25% in Block Q. These findings indicate that the Genetic Algorithm performs better in solving CVRP for the distribution of fresh oil palm fruit bunches and can serve as a foundation for developing more efficient distribution systems using heuristic and metaheuristic approaches
Pengelolaan Penanaman Bayam Brazil Pada Tanah Tandus Secara Matematika dengan Menggunakan Eco-Enzyme Fitri Maya Puspita; Venty; Tri Handayani; Reza Andeka; Fidella Oktariana; Destia Maharani; Dewi Lisandra; Ayu Nursafitri; Laila Hanum; Evi Yuliza; Sisca Octarina; Yolanda Fitria
Aksi Kita: Jurnal Pengabdian kepada Masyarakat Vol. 1 No. 4 (2025): JULI-AGUSTUS
Publisher : Indo Publishing

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

Abstract

Penanaman Bayam Brazil (Alternanthera sissoo) di lahan kritis seperti tanah tandus dan rawan banjir memerlukan pendekatan pengelolaan yang inovatif. Penelitian ini membahas strategi pengelolaan berbasis eco-enzyme yang dikombinasikan dengan pemodelan matematika untuk mengoptimalkan pertumbuhan dan hasil tanaman. Eco-enzyme hasil fermentasi limbah organik, terbukti meningkatkan kesuburan dan retensi air tanah. Dalam praktiknya, pengelolaan dilakukan melalui persiapan tanah, aplikasi dosis eco-enzyme yang terukur, serta evaluasi pertumbuhan tanaman secara berkala. Evaluasi menunjukkan peningkatan pertumbuhan dan hasil tanaman secara signifikan. Penelitian ini menunjukkan bahwa pengelolaan berkelanjutan berbasis matematika dan teknologi bio-organik seperti eco-enzyme dapat menjadi solusi adaptif terhadap perubahan iklim dan degradasi lahan.
Teori Dualitas Lagrange dalam Optimasi Non-Linier: Tinjauan Naratif dari Perspektif Analisis Geometris Modern Aprilia Rahmawati; Sisca Octarina; Fitri Maya Puspita
Griya Journal of Mathematics Education and Application Vol. 6 No. 2 (2026): Juni 2026
Publisher : Pendidikan Matematika FKIP Universitas Mataram

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.29303/griya.v6i2.1044

Abstract

Lagrangian duality theory constitutes a fundamental framework in nonlinear optimization analysis, connecting primal problems with dual problems through the Lagrange function. This article presents a comprehensive narrative review of Lagrangian duality theory development from the perspective of modern geometric analysis. We explore the geometric structure of primal-dual spaces, Karush-Kuhn-Tucker (KKT) optimality conditions, and strong and weak duality theorems in the context of constrained optimization. The discussion encompasses geometric interpretations of saddle points, convexity in duality theory, and the duality gap as a solution quality measure. Furthermore, we analyze theoretical applications from functional analysis and topology perspectives, including the role of reflexive Banach spaces and Fréchet differentiability in characterizing optimal solutions. The findings demonstrate that geometric approaches provide profound insights into optimization problem structures and open new perspectives in numerical algorithm development. This review contributes to a more robust theoretical understanding of the mathematical foundations of nonlinear optimization and its relevance in contemporary applied mathematics.
Optimasi Keuntungan Produksi Kue Kering Nastar dan Semprit Menggunakan Metode Simpleks dan Aplikasi POM-QM Putri, Nadine Aliza; Puspita, Fitri Maya; Octarina, Sisca
Imajiner: Jurnal Matematika dan Pendidikan Matematika Vol 8, No 1 (2026): Imajiner: Jurnal Matematika dan Pendidikan Matematika
Publisher : Universitas PGRI Semarang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26877/imajiner.v8i1.25497

Abstract

Usaha kue kering rumahan "Dapur Ma’Ina" menghadapi persaingan ketat dan keterbatasan alokasi bahan baku harian, sehingga sulit menentukan kombinasi produksi yang tepat untuk memaksimalkan keuntungan. Penelitian ini bertujuan untuk mengaplikasikan program linier guna menghitung kombinasi produksi optimal kue nastar dan semprit yang memberikan keuntungan maksimum. Metode yang diaplikasikan adalah Program Linier dengan penyelesaian menggunakan perhitungan manual Metode Simpleks dan divalidasi menggunakan perangkat lunak POM-QM, menggunakan data primer berupa resep, ketersediaan bahan, dan keuntungan dari usaha "Dapur Ma’Ina". Hasil perhitungan menunjukkan keuntungan maksimal yang dapat diperoleh adalah sebanyak Rp 1.050.000, dengan kombinasi produksi optimal yang disarankan adalah 3 resep Nastar dan 2 resep Semprit. Bagi peneliti berikutnya, dianjurkan untuk mengembangkan penelitian ini dengan menyertakan variabel kendala lain seperti waktu produksi atau tenaga kerja. The home-based pastry business 'Dapur Ma'Ina' faces tight competition and limited daily raw material allocation, making it difficult to determine the right production combination to maximize profit. This research aims to apply linear programming to calculate the optimal production combination of nastar and semprit cakes that yields maximum profit. The method used is Linear Programming, solved using manual Simplex Method calculations and validated using POM-QM software, utilizing primary data including recipes, material availability, and profit from the 'Dapur Ma'Ina' business. The calculation results show that the maximum achievable profit is Rp 1,050,000, with the optimal production combination recommended being 3 Nastar recipes and 2 Semprit recipes. For future researchers, it is suggested to expand this research by adding other constraint variables, such as production time or labor.
- Heterogeneous Fleet Vehicle Routing Problem dan Penyelesaiannya Menggunakan Metode Nearest Neighbor : Kasus Pendistribusian Ayam Potong Evi Yuliza; Novi Rustiana Dewi; Sisca Octarina; Indrawati Indrawati
Limits: Journal of Mathematics and Its Applications Vol. 23 No. 2 (2026): Limits: Journal of Mathematics and Its Applications Volume 23 Nomor 2 Edisi Ju
Publisher : Pusat Publikasi Ilmiah LPPM Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/limits.v23i2.8956

Abstract

Distribution of goods using a heterogeneous fleet of vehicles is an important aspect in a logistics system because it affects distribution efficiency. This study aims to determine the optimal distribution route for broiler chickens using the Heterogeneous Fleet Vehicle Routing Problem (HFVRP) model to minimize the total vehicle mileage. The data used include customer locations, number of requests, vehicle capacity, heterogeneous vehicle types, and distances between locations. The problem is modeled in HFVRP by considering vehicle capacity, each customer is visited exactly once, and vehicles depart and return to the depot. The solution is carried out using the Nearest Neighbor method to generate distribution routes and compared with the optimal solution from the HFVRP model. The results show a total mileage of 88.6 km for the Nearest Neighbor method, while the optimal solution from the HFVRP model produces a total mileage of 121.2 km. Based on these results, the Nearest Neighbor method provides a more efficient route solution in the case of broiler chicken distribution.
Co-Authors Adik Ahmadi Adinda Putri Ramadhany, Adinda Putri Ahmadi, Adik Ani Sahara Br. Simanjuntak Aprilia Nur Sabana Aprilia Rahmawati Armalia, Divasanda Aryani, Robeah Asri Kuntari Asri Kuntari, Asri Ayu Novita Ayu Nursafitri Ayu Wulandari Bambang Suprihatin Bambang Suprihatin Belly Wardhani Chatrin Yohana Simamora Destia Maharani Devi Gusmalia Juita Dewi Lisandra Diah Putri Ramadani Dian Wahyuni Diyaz Rachmaningtiyaz Diyaz Rachmaningtyas Elisa Nurnawati Endro Sastro cahyono Endro Setyo Cahyono, Endro Setyo Evi Yuliza Evi Yuliza Evi Yuliza Evi Yuliza Evi Yuliza Evi Yuliza, Evi Fidella Oktariana Fitri Maya Puspita Fitri Maya Puspita Fitri Maya Puspita Fitri Maya Puspita Fitri Maya Puspita Fitri Maya Puspita Fitri Maya Puspita Fitri Maya Puspita Fitri Maya Puspita Fitri Maya Puspita Fitri Puspita Frisca Frasilia Gina Sonia Gusti Ahta Virgo Haryati Pane Helena Valenta Br Kemit Helmayanti, Rizky Hernanda, Eggyana Deri Ide Lestari Indrawati Indrawati Indrawati Indrawati Indrawati Indrawati Indrawati Indrawati Jaya Bangun Jurnal Pepadu Laila Hanum Manik, Jolius Saut Mangaraja Maya Puspita, Fitri Miranda Avifana Muhammad Naufal Farras Nanang Suwandi Narasti Wulandari Ning Eliyati Novi Rustiana Dewi Nur Attina Eliza Nuraini, Anggun Oki Dwipurwani Oki Dwipurwani Pebriyanti Simanjuntak Putra Bahtera Putra Bahtera Jaya Bangun Putra Bahtera Jaya Bangun Putra Bahtera Jaya Bangun Putra Bahtera Jaya Bangun Putra Bahtera Jaya Bangun, Putra Bahtera Jaya Putra BJ Bangun, Putra BJ Putri, Nadine Aliza Rachmaningtiyaz, Diyaz Rahmadia, Putri Rama Dani, M Ardi Rani Elekta Togatorop Ranti Sawitri Resmadona Reza Andeka Rika Apriani Rima Melati Rizka Aniza Robeah Aryani Robinson Sitepu Robinson Sitepu Sabana, Aprilia Nur Sarjani, Ita Sisca Puspita Sepriliani Siti Suzlin Supadi Siti Suzlin Supadi Sugandi Yahdin Tasiah, Mawar Tri Handayani Ulandari, Mazida Venty Warda Hafizah Yolanda Fitria Yuli Andriani Yulia Anisawati YUNITA Yunita Yunita