An approach to solve bilevel quadratic-linear programming problems

Please use this identifier to cite or link to this item: https://ir.iimcal.ac.in:8443/jspui/handle/123456789/1772

Full metadata record

DC Field	Value	Language
dc.contributor.author	Singh, Sanjeet P.
dc.date.accessioned	2021-08-26T06:24:46Z	-
dc.date.available	2021-08-26T06:24:46Z	-
dc.date.issued	2012
dc.identifier.uri	https://www.scopus.com/inward/record.uri?eid=2-s2.0-84867482557&partnerID=40&md5=557b0cd09c4ddff64c57ae665d82d789
dc.identifier.uri	https://ir.iimcal.ac.in:8443/jspui/handle/123456789/1772	-
dc.description	Singh, Sanjeet P., Operations Management Group, Indian Institute of Management Calcutta, DH Road, Joka, Kolkata-700104, India
dc.description	ISSN/ISBN - 20780958
dc.description	pp.1473-1476
dc.description.abstract	In this paper, we develop a method to solve bilevel quadratic-linear programming problems in which the upper level objective function is quadratic and lower level objective function is linear. In this method, we replace the lower level problem by its duality gap equaling zero. The resulting bilevel quadratic linear programming problem can be transformed into a traditional single objective programming problem, which can be solved using a series of finite number of standard convex quadratic programming problems.
dc.publisher	SCOPUS
dc.publisher	Lecture Notes in Engineering and Computer Science
dc.publisher	Newswood Limited
dc.relation.ispartofseries	2196
dc.subject	Bilevel programming
dc.subject	Linear programming
dc.subject	Optimization
dc.subject	Quadratic programming
dc.title	An approach to solve bilevel quadratic-linear programming problems
dc.type	Conference Paper
Appears in Collections:	Operations Management

Files in This Item:

There are no files associated with this item.