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

Md. Asadujjaman | Zendy; M Babul Hasan | Zendy

Open Access

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

Author(s) -

Md. Asadujjaman,

M Babul Hasan

Publication year - 2016

Publication title -

dhaka university journal of science

Language(s) - English

Resource type - Journals

eISSN - 2408-8528

pISSN - 1022-2502

DOI - 10.3329/dujs.v64i1.28524

Subject(s) - bounded function , mathematics , linear programming , separable space , quadratic programming , mathematical optimization , constraint (computer aided design) , linear fractional programming , constraint satisfaction , criss cross algorithm , mathematical analysis , statistics , geometry , probabilistic logic

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.Dhaka Univ. J. Sci. 64(1): 51-58, 2016 (January)

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research