EPrints@IIT Delhi >
Faculty Research Publicatons  >
Mathematics >

Please use this identifier to cite or link to this item: http://eprint.iitd.ac.in/handle/2074/259

Full metadata record

DC FieldValueLanguage
dc.contributor.authorGupta, Renu-
dc.contributor.authorBandopadhyaya, Lakshmisree-
dc.contributor.authorPuri, M C-
dc.identifier.citationEuropean Joumal of Operational Research, 95(1), 231-236en
dc.description.abstractThe present paper develops an algorithm for ranking the integer feasible solutions of a quadratic integer programming (QIP) problem. A linear integer programming (LIP) problem is constructed which provides bounds on the values of the objective function of the quadratic problem. The integer feasible solutions of this related integer linear programming problem are systematically scanned to rank the integer feasible solutions of the quadratic problem in non-decreasing order of the objective function values. The ranking in the QIP problem is useful in solving a nonlinear integer programming problem in which some other complicated nonlinear restrictions are imposed which cannot be included in the simple linear constraints of QIP, the objective function being still quadratic.en
dc.format.extent394418 bytes-
dc.subjectInteger programmingen
dc.subjectQuadratic programmingen
dc.subjectLinear programmingen
dc.titleRanking in quadratic integer programming problemsen
Appears in Collections:Mathematics

Files in This Item:

File Description SizeFormat
guptaran96.pdf385.17 kBAdobe PDFView/Open
View Statistics

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback