scholarly journals A Review on the Proposed Quasi-Concave Quadratic Programming Problems with Bounded Variable: by Counter-example, by Computer Algebra

2017 ◽  
Vol 65 (2) ◽  
pp. 167-168
Author(s):  
HK Das
Keyword(s):  
Quadratic Programming ◽  
Computer Algebra ◽  
Counter Example ◽  
Quadratic Programming Problems ◽  
Concave Quadratic Programming

Abstract not available Dhaka Univ. J. Sci. 65(2): 167-168, 2017 (July)

A Proposed Technique for Solving Quasi-Concave Quadratic Programming Problems with Bounded Variables

2015 ◽  
Vol 63 (2) ◽  
pp. 111-117
Author(s):  
M Asadujjaman ◽  
M Babul Hasan
Keyword(s):  
Quadratic Programming ◽  
Optimal Solution ◽  
Linear Functions ◽  
Dual Simplex Method ◽  
Numerical Examples ◽  
Bounded Variables ◽  
Quadratic Programming Problems ◽  
Primal Dual ◽  
Dual Simplex ◽  
Concave Quadratic Programming

In this paper, a new method is proposed for finding an optimal solution to a Quasi-Concave Quadratic Programming Problem with Bounded Variables in which the objective function involves the product of two indefinite factorized linear functions and constraints functions are in the form of linear inequalities. The proposed method is mainly based upon the primal dual simplex method. The Linear Programming with Bounded Variables (LPBV) algorithm is extended to solve quasi-concave Quadratic Programming with Bounded Variables (QPBV). For developing this method, we use programming language MATHEMATICA. We also illustrate numerical examples to demonstrate our method.Dhaka Univ. J. Sci. 63(2):111-117, 2015 (July)

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

2016 ◽  
Vol 64 (1) ◽  
pp. 51-58
Author(s):  
M Asadujjaman ◽  
M Babul Hasan
Keyword(s):  
Linear Programming ◽  
Quadratic Programming ◽  
Objective Function ◽  
Programming Language ◽  
Optimal Solution ◽  
Linear Functions ◽  
Numerical Examples ◽  
Bounded Variables ◽  
Quadratic Programming Problems ◽  
Concave Quadratic Programming

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)

Sign in / Sign up

Export Citation Format

Share Document