Application of Discrete Bilevel Programming to Some Applied Problems

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Stephan Dempe Articles by Vyacheslav Kalashnikov Articles by Hugo Terashima

Fourth Mexican International Conference on Computer Science

Tlaxcala, Mexico

September 08-September 12

ISBN: 0-7695-1915-6

	ASCII Text	x
	Stephan Dempe, Vyacheslav Kalashnikov, Hugo Terashima, "Application of Discrete Bilevel Programming to Some Applied Problems," Mexican International Conference on Computer Science, pp. 254, Fourth Mexican International Conference on Computer Science, 2003.

	BibTex	x
	@article{ 10.1109/ENC.2003.1232902, author = {Stephan Dempe and Vyacheslav Kalashnikov and Hugo Terashima}, title = {Application of Discrete Bilevel Programming to Some Applied Problems}, journal ={Mexican International Conference on Computer Science}, volume = {0}, year = {2003}, isbn = {0-7695-1915-6}, pages = {254}, doi = {http://doi.ieeecomputersociety.org/10.1109/ENC.2003.1232902}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Mexican International Conference on Computer Science TI - Application of Discrete Bilevel Programming to Some Applied Problems SN - 0-7695-1915-6 SP EP A1 - Stephan Dempe, A1 - Vyacheslav Kalashnikov, A1 - Hugo Terashima, PY - 2003 KW - null VL - 0 JA - Mexican International Conference on Computer Science ER -

Stephan Dempe, TU Freiberg, Freiberg, Germany

Vyacheslav Kalashnikov, Monterrey Institute of Technologies (ITESM)

Hugo Terashima, Monterrey Institute of Technologies (ITESM)

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ENC.2003.1232902

In this paper, we present a mathematical framework for the problem of minimization of the cash-out penalties of a natural gas shipper. The problem is modeled as a mixed-integer bilevel programming problem. To solve it efficiently, we re-formulate it as a standard mathematical programming problem making use of an exact penalty function approach, and describe a branch-and-bound algorithm for its solution.

Citation:

Stephan Dempe, Vyacheslav Kalashnikov, Hugo Terashima, "Application of Discrete Bilevel Programming to Some Applied Problems," enc, pp.254, Fourth Mexican International Conference on Computer Science, 2003

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.