Pengembangan Metode Orde Tinggi Untuk Menyelesaikan Sistem Persamaan Nonlinear

This nal project discusses the development of high-order iteration methods with a weight function approach to nd solutions to systems of nonlinear sys- tems equations. Analytically it is proven that the resulting method have a convergance of six order. The computational test shows the obtained methods are comparable to the existing class methods. Keywords: Iterative method, order of conv…

Menentukan Nilai eigen dan vektor Eigen Matriks Fuzzy Triangular

ABSTRACT This nal project discusses the determination of the eigenvalues and eigenvectors of a triangular fuzzy number matrix. The negative-positive denition triangular fuzzy number is expressed based on its geometrical area. The goal is to determine the arithmetic operations constructed on the result of multiplication of the triangular fuzzy numbers. Then the negative-positive triangul…

Modifikasi Metode New Tondengan Memori Dan Para Meterak Selerasi Untuk Menyel…

ABSTRACT This final project discusses a modification of the Newton’s method with memory using the acceleration parameter to solve nonlinear equations. Modification is made by replacing the invariant parameter in the modified Newton method without memory with the acceleration parameter. The analysis of convergence shows that the convergene order of the proposed method is of 1+√2. Furthe…

Metode Bebas turunan optimal Berdasarkan interpolasi invers untuk Mencari Aka…

ABSTRACT This final project discusses the optimal derivative-free iterative method based on inverse interpolation for solving nonlinear equations. The discussion begins with estimating the derivative of the function in the proposed method using the Cordero-Torregrosa conjecture, then it is continued by conducting a convergence analysis which shows that the proposed method is of order eight…

Cadangan Zillmer Asuransi Jiwa Last Survivor Dwiguna Dengan Hukum Makeham

ABSTRACT This paper discusses Zillmer's reserve of last survivor endowment life insurance. Last survivor is life insurance of two person who are x years and y years old with a condition that premium is payed until the last death of insurance clients. Zillmer's reserve is modied prospective's reserve using the size of Zillmer's rate. The value of reserves is obtained by determining the sin…

Premi Asuransi Jiwa Berjangka Contingent Berdasarkan Hukum Makeham

ABSTRACT This final project formulates premium of contingent term life insurance based on Makeham’s law for two persons at the age x and y years old. Contingent life insurance is an insurance whose payment are based on the sequence of the deceased insured. In determining the order in which death is delayed, the compound contingent function is used. In this final project, term life annuit…

Perkalian Dengan Syarat Maks Tidak Menghasilkan Bilangan Berpangkat

Edisi

-

ISBN/ISSN

-

Deskripsi Fisik

ix, 79 hlm.; ill.: 29 cm

Judul Seri

-

No. Panggil

03 03. 121 (0036)

Metode Hungarian Untuk Menyelesaikan Masalah Penugasan Dengan Interval Aritma…

ABSTRACT This nal project discusses the Hungarian method to solve assignment problems with generalized interval arithmetic. This problem aims to optimize decision making in assignment placement by minimizing costs for n jobs completed by m employees. Interval assignments are performed by converting each table entry into the form of midpoint and width. Then the Hungarian method in the ass…

Sifat-Sifat B-Aljabar Dan Ideal, Ideal Lengkap, N-Ideal Dari B-Aljabar

ABSTRACT This final project discusses some properties of B-algebra and the ideal, complete ideal, n-ideal of B-algebra. There is a relation between ideal, complete ideal, and n-ideal that every ideal of B-algebra is complete ideal and every ideal of B-algebra is n-ideal. This project is a review of article of Abdullah and Athsan [Applied Mathematical Sciences, 11 (2017), 1705-1713]. Keywo…

Sifat-Sifat Pada Bn1-Aljabar Serta Hubungan Bn1-Aljabar Dengan Bg, Bci Dan Co…

ABSTRACT This final project discusses the properties of BN1-algebra and the relation- ship between BN1-algebra with BG-algebra, BCI-algebra and Coxeter-algebra. Then, by using the properties contained in BN1-algebra and some other alge- bras, several other related algebraic properties are derived. In final section, it is found that the conditions of some algebra in BN1-algebra are the same…

Pengembangan Teorema Japanese Untuk Dua Lingkaran Di Segiempat Siklik

ABSTRACT This article discusses the development of the Japanese theorem for two circles in cyclic quadrilateral, with reconstruct two incircles of the triangle in Japanese theorem. The result obtained are the value of the incircles radii of the triangle in two cyclic quadrilateral and diagonal relationship of cyclic quadrilateral in two circles. Keywords: Cyclic quadrilateral, incircle of…

Metode Branch And Bound Untuk Menyelesaikan Masalah Penugasan Fuzzy Simetrik …

ABSTRACT This final project discusses the solution of assignment problems in the form of equally spread symmetric fuzzy numbers for minimization and maximization cases both balanced and unbalanced cases. The fuzzy numbers does not need to be converted into crisp numbers and then completed using the branch and bound method by forming branch in each step to construct a solution tree at the …

Metode Hungarian Untuk Mencari Solusi Optimal Masalah Penugasan Dengan Fungsi…

ABSTRACT This final project discusses the solution of assignment problems in the form of mixed objective assignment costs. The assignment costs used are triangular fuzzy numbers and crisp numbers. Triangular fuzzy numbers are converted to crisp numbers using the Yager’s ranking method, so that crisp number operations can be applied. Furthermore, to get the optimal solution of the problem…

Model Pendekatan Minimum Persediaan-Permintaan Untuk Solusi Optimal Masalah T…

ABSTRACT This paper discusses the problem of transporting trapezoidal fuzzy numbers with supply and demand approach. The coefficients of cost, supply and demand are in the form of fuzzy numbers because there is uncertainty. The simplex method is implemented to convert the fuzzy objective and constraint function in the fuzzy transportation problem to four form numbers in the transportation …

Metode Iterasi Dua Langkah Tanpa Memori Untuk Menyelesaikan Persamaan Nilai M…

ABSTRACT This final project discusses a two-step iteration method without memory for solving absolute equations. The convergence analysis performed shows that the two-step iteration method without memory has a linear convergence order. Then a computation example is given to see the implementation of the algorithm discussed. At the end of the discussion, a numerical comparison is carried ou…

Sifat-Sifat Bm-Aljabar Dan Hubungannya Dengan Bci-Aljabar, Aljabar Coxeter Da…

ABSTRACT This nal project discusses the properties of BM-algebra and the relation of BM-algebra with BCI -algebra, BF-algebra and Coxeter algebra. Their rela- tionship is proven by showing that the properties of BM-algebra, BCI -algebra, BF-algebra, Coxeter algebra are interrelated. Keywords: BM-algebra, BCI -algebra, BF-algebra, Coxeter algebra.

Generalisasi Polinomial Barisan Tribonacci Dan Tribonacci-Lucas Melibatkan La…

ABSTRACT This nal project discusses a new kind of lattice path and innite lower tria- ngular array with the given steps. By using lattice path the lower triangular array which is obtained has the sum of row on its diagonal. The sum of lat- tice path is found by generating function of the sum of row Riordan matrix. Then a combinatorial interpretation is obtained for the generalized tribon…

Metode Newton Berdasarkan Beda Hingga Nonstandar Untuk Menyelesaikan Persamaa…

ABSTRACT This final project discusses the new Newton iterative method based on nonstan- dard difference for solving nonlinear equations. The proposed method is proven analytically to have the order of cubic convergence involving four evaluation functions. Several examples of numerical computation show that the resulting method is comparable to the class of existing methods. Keywords: Nonl…

Algoritma Genetika Untuk Menyelesaikan Masalah Travelling Salesman

ABSTRACT This nal project discusses the solution of the travelling salesman problem using the genetic algorithm method with MATLAB software. This discussion aims to nd the optimal solution of a route by a salesman. The best path result from a travel route are optained and it can be concluded that the genetic algorithm can be used as a method for solving the problem of travelling salesman…

Perencanaan Perjalanan Mengelilingi Daratan Provinsi Riau Dengan Menggunakan …

ABSTRACT This final project discusses travel planning around the mainland of riau province using ant colony algorithm, utilizing the heuristic method, with Matlab software to a variative solution. This discussion aims to find the shortest route using data of distance, cost, and a combination of distance and cost. Optimization of the travel index is the shortest route using a combination da…