OPTIMIZATION THROUGH APPROXIMATION ALGORITHM

Abstract

This research paper proposes an Approximation Algorithm to solve the Cubic Objective Function  Programming Problem (COFPP). The same had been introduced to solve the Linear Programming Problem (LPP) by Khobragade et al. In this paper, we used the Approximation algorithm to solve linearly factorized cubic objective function programming problem. This algorithm can achieve an optimal solution in fewer iterations as compared to Simplex method. Hence, the proposed algorithm can be better understood by solving a cyclic problem.