In this paper, a cubic objective programming problem (COPP) is defined. Introduced new modification to solve problem. Suggested an algorithm for its solution. Also reported the of usual simplex method. Application talks about how developed can be used unravel non-linear. The proposed technique, with constructed numerical examples illustrative problems are given demonstrate algorithms.