ON SOLUTION CONCEPTS OF LINEAR BILEVEL PROGRAMMING PROBLEMS

Please use this identifier to cite or link to this item: http://localhost:8081/jspui/handle/123456789/21136

Full metadata record

DC Field	Value	Language
dc.contributor.author	Rani, Shipra	-
dc.date.accessioned	2026-06-15T10:24:12Z	-
dc.date.available	2026-06-15T10:24:12Z	-
dc.date.issued	2020-05	-
dc.identifier.uri	http://localhost:8081/jspui/handle/123456789/21136	-
dc.guide	Gupta, S. K. and Yadav, Tamanna	en_US
dc.description.abstract	Bilevel optimization is defined as an optimization problem that contains another optimization problem as constraints.These problems have attracted considerable attention from the mathematical programming community.This project report examines bilevel optimization from the prespectives of its basic principles to its solution techniques.Then an extended solution tech nique for solving the linear bilevel programming problems has been dis cussed. Further, based on these solution techniques,some numerical exam ples are demonstrated. In the last we have discussed problems with weak linear bilevel programming problems with non-unique solutions of lower levels and an exact penalty method to solve these problems.	en_US
dc.language.iso	en	en_US
dc.publisher	IIT Roorkee	en_US
dc.title	ON SOLUTION CONCEPTS OF LINEAR BILEVEL PROGRAMMING PROBLEMS	en_US
dc.type	Dissertations	en_US
Appears in Collections:	MASTERS' THESES (Maths)

Files in This Item:

File	Description	Size	Format
20616025_SHIPRA RANI.pdf		581.41 kB	Adobe PDF	View/Open