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

Full metadata record

DC Field	Value	Language
dc.contributor.author	M. S. Radjef, A. Anzi	-
dc.date.accessioned	2016-11-03T08:40:09Z	-
dc.date.available	2016-11-03T08:40:09Z	-
dc.date.issued	2016-11-03	-
dc.identifier.uri	http://dspace.univ-ouargla.dz/jspui/handle/123456789/11902	-
dc.description.abstract	Abstract. In this paper we propose an algorithm for solving bilevel linear programming problems, in which the second level problem is replaced by its Karush-Kuhn-Tucker optimality conditions. This algorithm is a combination of the DCA algorithm in DC programming and the exact penalty methods.	en_US
dc.relation.ispartofseries	2015;	-
dc.subject	Bilevel linear programming	en_US
dc.subject	DC programming	en_US
dc.subject	DCA algorithm	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
Appears in Collections:	1. Faculté des mathématiques et des sciences de la matière

Files in This Item:

File	Description	Size	Format
Solving linear bilevel programming by DC algorithme.pdf		598,35 kB	Adobe PDF	View/Open

DSpace JSPUI