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/367

Full metadata record

DC FieldValueLanguage
dc.contributor.authorMathur, Kanchan-
dc.contributor.authorPuri, M C-
dc.identifier.citationEuropean Journal of Operational Research 86 , 337-344en
dc.description.abstractThis paper studies a bilevel programming problem with linear constraints, and in which the objective functions at both levels are concave bottleneck functions which are to be minimized. The problem is a non-convex programming problem. It is shown that an optimal solution to the problem is attainable at an extreme point of the underlying region. The outer level objective function values are ranked in increasing order until a value is reached, one of the solutions corresponding to which is feasible for the problem. This solution is then the required global optimal solution.en
dc.format.extent546254 bytes-
dc.subjectNon-linear programmingen
dc.subjectNon-convex programmingen
dc.subjectBilevel programmingen
dc.subjectBottleneck programmingen
dc.titleTheory and methodology: A bilevel bottleneck programming problemen
Appears in Collections:Mathematics

Files in This Item:

File Description SizeFormat
matabi95.pdf533.45 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