An algorithm on integer solutions to quadratic programming problems with bounded decision variables
Author:
S.C. Sharma1 and Abha Bansal2
Affiliation:
1Department of Mathematics, Unversity of Rajasthan Jaipur India
2Department of Mathematics, Dungurpur Engineeering College & Technology Dungurpur Rajasthan India
Email:-neelamchikusinghal2002@gmail.com
Keyword:
quadratic programming, decision variables
Issue Date:
April 2013
Abstract:
This paper provides an algorithm for the integer solution of quadratic programming problems with the help of Branch and Bound method. We consider an indefinite quadratic objective function and linear constraints with bounded decision variables. The feasible region is a convex polyhedron.
Pages:
209-214
ISSN:
2319-8044 (Online) - 2231-346X (Print)
Source:
PDF:
DOI:
jusps-A
Share This:
Copy the following to cite this article:
S.C. Sharma1 and Abha Bansal2 , "An algorithm on integer solutions to quadratic programming problems with bounded decision variables ", Journal of Ultra Scientist of Physical Sciences, Volume 23, Issue 1, Page Number 209-214, 2016Copy the following to cite this URL:
S.C. Sharma1 and Abha Bansal2 , "An algorithm on integer solutions to quadratic programming problems with bounded decision variables ", Journal of Ultra Scientist of Physical Sciences, Volume 23, Issue 1, Page Number 209-214, 2016Available from: https://www.ultrascientist.org/paper/699/
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License
