https://jurnalmipa.unri.ac.id/jomso/index.php/files/issue/feedJournal of Mathematical Sciences and Optimization2024-01-31T04:58:16+00:00M.D.H Gamalmdhgamal@unri.ac.idOpen Journal Systems<p>Journal of Mathematical Sciences and Optimization (JOMSO) is a national journal intended as a communication forum for mathematicians and other scientists from many practitioners who use mathematics in research. Journal of Mathematical Sciences and Optimization (JOMSO) receives a manuscript in areas of study mathematics widely such as analysis, algebra, geometry, numerical methods, mathematical modeling, and optimization and math-based multidisciplinary studies derived from outside problems of mathematics.<br />JOMSO issues on July and January. </p> <p> </p>https://jurnalmipa.unri.ac.id/jomso/index.php/files/article/view/22Comparison of the Dijkstra’s Algorithm and the Floyd-Warshall’s Algorithm to Determine the Shortest Path between Hospitals in Several Cities in Lampung Province2023-12-25T10:30:14+00:00Alenia Daynur PutrianiAleniaDaynur@gmail.comWamilianawamiliana.1963@fmipa.unila.ac.idSiti Laelatul ChasanahSitiLaylatul@gmail.com<p style="font-weight: 400;"><em>Determining the shortest route from one node to another is a problem we often encounter in everyday life. The routes obtained are intended to minimize costs, travel time or distance. In this study, we compare Dijkstra’s and Floyd-Warshall’s algorithms to determine the shortest route between hospitals in some cities in Lampung Province. The efficiency of the two algorithms in solving this problem is assessed based on the program running time. The results show that both Dijkstra’s algorithm and Floyd-Warshall’s algorithm provide the shortest path in the same distance. However, the running time of the Dijkstra’s algorithm takes less time than Floyd-Warshall’s algorithm.</em></p>2024-05-30T00:00:00+00:00Copyright (c) 2024 Journal of Mathematical Sciences and Optimizationhttps://jurnalmipa.unri.ac.id/jomso/index.php/files/article/view/15Efficient Quadratic Programming Optimization via Staged Computational Procedures: Unconstrained Minimization and Constraint Exploration2024-01-23T02:57:10+00:00Yosza Dasrilyosza@uthm.edu.myNazarudin Bujangnazarudin@uthm.edu.myR. Chandrashekarchandra@uthm.edu.myShahrul Nizam Salahudinshahrulns@uthm.edu.my<p>In this paper, we present a computational framework for finding optimal solutions to quadratic programming problems. Our computational process is divided into three steps. Initially, we derive unconstrained minimization of the quadratic programming problem by solving simultaneous equations involving objective function derivatives and confirming its feasibility. Using this discovered point, we identify the violated constraints and direct our search to these specific constraints. The next stage defines the process for determining the unconstrained point on each active constraint violated by the objective function's optimal point. Moving on to the next stage, we use the constraint exploration technique to systematically seek the optimal constrained point at the intersections of two or more violated active constraints as candidates for the optimal solution. The feasibility of the unconstrained point is systematically checked at each level. If the unconstrained point is deemed feasible, then the optimal solution is obtained, and the optimal value of the objective function is found.</p>2024-01-31T00:00:00+00:00Copyright (c) 2024 Journal of Mathematical Sciences and Optimizationhttps://jurnalmipa.unri.ac.id/jomso/index.php/files/article/view/20TOTAL VERTEX IRREGULARITY STRENGTH OF HAYAT TREE GRAPH2024-01-23T02:55:35+00:00Susilawatisusilawati.math@lecturer.unri.ac.idNuraini Sibueanuraini.sibuea6881@grad.unri.ac.idMardani Fitramardanifitra@gmail.comRistifani Ulfatmiristifaniulfatmi@gmail.comSiska Khairunnisasiskakhairunnisa@gmail.com<p><em>Let <strong>G(V,E)</strong></em><em> be a finite, simple graph with no loop and parallel edges. <strong>V</strong></em><em> is a set of vertices in <strong>G</strong></em><em> and <strong>E</strong></em><em> is a set edges. Labeling a graf is mapping that sends some set of graph elements to a set of positive integers. If the domain is the vertex set then the labeling is call vertex labeling, if the domain is the edge set then the labeling is call edge labeling. Define a labeling <img src="https://jurnalmipa.unri.ac.id/jomso/public/site/images/nuraini15/capture-2-628e86bb563fdc8d0604f2d9b947338b.png" alt="" width="129" height="13">as a vertex irregular total <strong>k</strong> - labeling if for every two different vertices <strong>x</strong> and <strong>y</strong> the vertex-weight <img src="https://jurnalmipa.unri.ac.id/jomso/public/site/images/nuraini15/capture-2-f8d59d20d83ae096cfdca8dae7eeafbe.png" alt="" width="106" height="20">where the vertex-weigth is defined by <img src="https://jurnalmipa.unri.ac.id/jomso/public/site/images/nuraini15/capture-3-48a17157b5e00016cca5a8559258c820.png" alt="" width="185" height="19"></em></p> <p><em>The minimum value of label <strong>k</strong></em><em> for which <strong>G</strong></em><em> has a vertex irregular total </em><em>labeling is called the total vertex irregularity strength of <strong>G</strong></em><em> and denoted by <strong>tvs(G) </strong></em><em>. We consider Hayat Tree Graph, a graph as symbol of Capital of Nusantara (IKN) which is ratified by president in June 2023. In this paper, we determined the total vertex irregularity strength of Hayat Tree Graph.</em></p> <p><em> </em></p>2024-01-31T00:00:00+00:00Copyright (c) 2024 Journal of Mathematical Sciences and Optimizationhttps://jurnalmipa.unri.ac.id/jomso/index.php/files/article/view/10MODIFICATION OF PROSPECTIVE LIFE INSURANCE RESERVE PROSPECTIVE CALCULATIONS USING THE ZILLMER METHOD2023-09-18T08:34:47+00:00Dea Setianingsihdeasetianingsih@gmail.comSilvia Rositaslvrosita@gmail.comSiska Resti Ssiskaresti@gmail.com<p><em>The calculation of the premium reserve can be modified to avoid losses in the early years because in the first year there are many expenses that must be borne by the company so that it has difficulties in calculating the amount of the premium reserve. Not a few insurers have suffered losses due to inaccurate calculations in the calculation of premium reserves. This study aims to modify the calculation of prospective whole </em><em>life insurance</em><em> premium reserves using the Zillmer method. Modification of premium reserves is calculated using the 2019 Indonesian Mortality Table with an interest rate of 3.50%. Based on the results of data analysis on the value of prospective premium reserves and the modified value of premium reserves using the Zillmer method, the results are the same, namely for male age (x) = 48 years, the prospective reserve value is IDR 213,253.05 and the modified premium reserve value using the Zillmer method is IDR 213,252.93 then for female age (y) = 69 years the prospective reserve value is IDR 8,698,949.01 and for the modified premium reserve value using the Zillmer method is IDR 8,698,948.89.</em></p>2024-01-31T00:00:00+00:00Copyright (c) 2024 Journal of Mathematical Sciences and Optimizationhttps://jurnalmipa.unri.ac.id/jomso/index.php/files/article/view/18HAMILTONIAN AND HYPOHAMILTONIAN OF GENERALIZED PETERSEN GRAPH GPn,62023-12-25T08:12:30+00:00Putti Naura Adwitaputtinaura456@gmail.comSri Gemawatigemawati.sri@lecturer.unri.ac.id<p><em>This article discusses the Hamiltonian and </em><em>H</em><em>ypo</em><em>h</em><em>amiltonian properties of </em><em>G</em><em>eneralized Petersen</em><em> G</em><em>raphs GP<sub>n,6</sub>. </em><em>A Hamiltonian graph is a graph that has a Hamiltonian cycle. So, a graph is called to be Hamiltonian and has a cycle that passes through each vertex exactly once. A Hypohamiltonian graph is if it is not a Hamiltonian graph, but if one vertex is removed it will be Hamiltonian. The Petersen graph is a cubic graph with ten vertices and fifteen edges and each vertex is of degree three. The generalized Petersen graph is denoted GP<sub>n,k</sub></em><em>, for positive numbers n and k with 2 ≤ 2k < </em><em>????. The Petersen graph is not a Hamiltonian graph, but is Hypohamiltonian. In the Generalized Petersen graph for GP<sub>n,6</sub> </em><em> for n ≡ 1(mod 13), n ≡ 3(mod 13), n ≡ 7(mod 13), n ≡ 9(mod 13) is a Hamiltonian, for n ≡ 0(mod 13) is a hypohamiltonian, and for n ≡ 2(mod 13), n ≡ 4(mod 13), n ≡ 5(mod 13), n ≡ 6(mod 13), n ≡ 8(mod 13) neither. </em></p>2024-01-31T00:00:00+00:00Copyright (c) 2024 Journal of Mathematical Sciences and Optimization