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

Title:	Solving linear bilevel programming by DC algorithm
Authors:	M. S. Radjef? and A. Anzi
Keywords:	Bilevel linear programming DC programming DCA al- gorithm KKT optimality conditions exact penalty
Issue Date:	19-Dec-2013
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.
Description:	7 ieme Colloque sur l Optimisation et les Systèmes d’Information COSI 2010 18-20 Avril 2010
URI:	http://hdl.handle.net/123456789/2778
ISSN:	kh
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