A Proposed Technique for Solving Quasi-Concave Quadratic Programming Problems with Bounded Variables by Objective Separable Method

Abstract

In this paper, a new method namely, objective separable method based on Linear Programming with Bounded Variables Algorithm is proposed
for finding an optimal solution to a Quasi-Concave Quadratic Programming Problems with Bounded Variables in which the objective function
involves the product of two indefinite factorized linear functions and the constraint functions are in the form of linear inequalities. For
developing this method, we use programming language MATHEMATICA. We also illustrate numerical examples to demonstrate our method.