Suhika, Dewi and Wamiliana, Wamiliana (2018) PENGGUNAAN METODE CUTTING PLANE UNTUK MENYELESAIKAN MINIMUM SPANNING TREE DENGAN KENDALA BOBOT PADA GRAF Kn. Jurnal Aksioma, 7 (1). pp. 87-95. ISSN 2442-5419

Preview	Text 1353-4007-1-PB (1) Penggunaan Metode Cutting Plane...pdf Download (427kB) | Preview
Preview	Text 1353-4007-1-PB (1) Penggunaan Metode Cutting Plane...pdf Download (427kB) | Preview

Abstract

This study aims to determine the minimum spanning tree of a complete graph with weight constraints and completion using the cutting plane method. The cutting plane method is one of the algorithms included in the exact method. This algorithm works by reducing the solution area so that it becomes narrower. As a result, the feasible solutions that will be investigated become less and less. This is because the cutting plane method works based on the optimal linear programming solution of relaxation solved by the simplex method. In this paper we give illustration of the algorithm applied for two cases, one for K4 and one for K5. .

Item Type:	Article
Subjects:	Q Science > QA Mathematics
Divisions:	Fakultas Matematika dan Ilmu Pengetahuan Alam (FMIPA) > Prodi Matematika
Depositing User:	WAMILIANA
Date Deposited:	03 Jul 2018 09:51
Last Modified:	03 Jul 2018 09:51
URI:	http://repository.lppm.unila.ac.id/id/eprint/8384

Actions (login required)

View Item