شماره ركورد كنفرانس :
4214
عنوان مقاله :
A Heuristic Method to Solve the Completely Positive Programming Problems Based on Linear Programming
پديدآورندگان :
Safia Mohamadreza Semnan University , Nabavia Seyed Saeed Semnan University , Fooladia P. Semnan University
كليدواژه :
Completely positive program , Completely positive matrix , Linear programming.
عنوان كنفرانس :
دهمين كنفرانس بين المللي تحقيق در عمليات
چكيده فارسي :
It this paper, we present a heuristic method to find a feasible solution for completely positive programming (CPP) problem in which _nding a feasible solution is done using a sequence of linear programs. After that, we extend this approach to obtain an optimal solution for completely positive programming problems. Eventually, we bring some examples to illustrate the efficiency of our algorithm.
