CD Skripsi

Metode Simpleks DimodifikasiPada Kasus Minimisasi Pemrograman Kubik

---

ABSTRACT
This final project 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.
Keywords: Linear programming, simplex method, cubic programming, new
modified simplex method.

---

Ketersediaan

Informasi Detail

Judul Seri

-

No. Panggil

1903124690

Penerbit

Pekanbaru : Universitas Riau - FMIPA - Matematika., 2023

Deskripsi Fisik

-

Bahasa

Indonesia

ISBN/ISSN

-

Klasifikasi

1903124690

Tipe Isi

-

Tipe Media

-

Tipe Pembawa

-

Edisi

-

Subjek

MATEMATIKA

Info Detail Spesifik

-

Pernyataan Tanggungjawab

puja

Versi lain/terkait

Lampiran Berkas

Komentar

---

Anda harus masuk sebelum memberikan komentar