METODE SIMPLEKS DIMODIFIKASI PADA KASUS MINIMISASI PEMROGRAMAN KUBIK

Irvan, Mona Cyntia

Home
→
UR - Student Paper Degree
→
Faculty of Mathematics and Natural Sciences
→
Mathematics
→
View Item

dc.contributor.author	Irvan, Mona Cyntia
dc.date.accessioned	2023-11-07T08:07:57Z
dc.date.available	2023-11-07T08:07:57Z
dc.date.issued	2023-07
dc.identifier.citation	Perpustakaan	en_US
dc.identifier.other	Elfitra
dc.identifier.uri	https://repository.unri.ac.id/handle/123456789/11206
dc.description.abstract	This article discusses the simplex method is modified in the case of cubic programming minimization. Cubic programming is an optimization problem with a nonlinear function and linear constraint function. The technique used for solving cubic programming is to determine the value of the objective function z using the simplex method which has been modified based on the basic description and the simplex method algorithm. By using the modified simplex method the results obtained are optimal values. Therefore, cubic programming can be solved using the modified simplex method by producing one solution or a single solution.	en_US
dc.description.provenance	Submitted by wahyu sari yeni (ayoe32@ymail.com) on 2023-11-07T08:07:57Z No. of bitstreams: 1 Mona Cyntia Irvan_compressed.pdf: 188499 bytes, checksum: 82f51a50c414124fc7a3ee8be2ce4c88 (MD5)	en
dc.description.provenance	Made available in DSpace on 2023-11-07T08:07:57Z (GMT). No. of bitstreams: 1 Mona Cyntia Irvan_compressed.pdf: 188499 bytes, checksum: 82f51a50c414124fc7a3ee8be2ce4c88 (MD5) Previous issue date: 2023-07	en
dc.description.sponsorship	Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Riau	en_US
dc.language.iso	en	en_US
dc.publisher	Elfitra	en_US
dc.subject	linear programming	en_US
dc.subject	simplex method	en_US
dc.subject	cubic programming	en_US
dc.subject	new modified simplex method	en_US
dc.title	METODE SIMPLEKS DIMODIFIKASI PADA KASUS MINIMISASI PEMROGRAMAN KUBIK	en_US
dc.type	Article	en_US