Line Search and Genetic Approaches forSolving Linear Tri-level Programming Problem
Publish place: International Journal of Management, Accounting and Economics (IJMAE)، Vol: 1، Issue: 4
Publish Year: 1393
نوع سند: مقاله ژورنالی
زبان: English
View: 872
This Paper With 20 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_IJMAE-1-4_001
تاریخ نمایه سازی: 22 دی 1393
Abstract:
in the recent years, the multi level programming problems specially the bi level and trilevel programming problems TLPP are interested by many researchers and these problems, particularly TLPLP are known as an appropriate tool to solve the real problems in several areas of optimization such as economic, traffic finance the liternture shows ig has been proposed a few attempts for solving using TLPP. in this paper, we attempt to propose a new function for smoothing the trilevel programming problem after usning karush kuhn tucker condition also we develop two effective apporaches, and based on genetic algorighm,
Keywords:
Linear bi-level programming problem , Linear tri -levelprogramming problem , Karush-Kuhn-Tucker conditions , Genetic theorem , Line search method
Authors
Eghbal Hosseini
Department of Mathematics, Payam Noor University of Tehran, Tehran, Iran
Isa Nakhai Kamalabadi
Department of Industry, University of Kurdistan, Sanandaj, Iran