<span lang="EN">Quadratic Knapsack Problem is a variation of the knapsack problem that aims to maximize an objective function. The objective function in this case is quadratic. While the constraints used are binary and linear capacity constraints. The Whale Optimization Algorithm is a metaheuristic algorithm that can solve this problem. Therefore, this paper aims to find out the best solution to solve the Knapsack 0-1 Quadratic Problem using the Whale Optimization Algorithm so that its effectiveness and efficiency are known. Based on the research has been done, the algorithm is said to be effective because, from each experiment, the algorithm is always converging or towards maximum profit. Also, with the right parameters, the algorithm can achieve optimal results. It is said to be efficient because getting optimal profit does not require more time and iteration. The combination of item parameters and maximum iteration dramatically Affect the total value of profit and its running time. However, the addition of item parameter combinations is faster to achieve optimal than the maximum iteration parameter.</span>