Solving linear bilevel programming by  DC algorithm

Please use this identifier to cite or link to this item: https://dspace.univ-ouargla.dz/jspui/handle/123456789/2778

Full metadata record

DC Field	Value	Language
dc.contributor.author	M. S. Radjef? and A. Anzi	-
dc.date.accessioned	2013-12-19T14:51:26Z	-
dc.date.available	2013-12-19T14:51:26Z	-
dc.date.issued	2013-12-19	-
dc.identifier.issn	kh	-
dc.identifier.uri	http://hdl.handle.net/123456789/2778	-
dc.description	7 ieme Colloque sur l Optimisation et les Systèmes d’Information COSI 2010 18-20 Avril 2010	en_US
dc.description.abstract	In this paper we propose an algorithm for solving bilevel linear programming problems, in which the second level problem is re- placed by its Karush-Kuhn-Tucker optimality conditions. This algorithm is a combination of the DCA algorithm in DC programming and the ex- act penalty methods.	en_US
dc.language.iso	en	en_US
dc.subject	Bilevel linear programming	en_US
dc.subject	DC programming	en_US
dc.subject	DCA al- gorithm	en_US
dc.subject	KKT optimality conditions	en_US
dc.subject	exact penalty	en_US
dc.title	Solving linear bilevel programming by DC algorithm	en_US
dc.type	Article	en_US
Appears in Collections:	1. Faculté des mathématiques et des sciences de la matière

Files in This Item:

File	Description	Size	Format
M. S. Radjef.pdf		615,81 kB	Adobe PDF	View/Open

DSpace JSPUI