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.
