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 de…