Line Search and Genetic Approaches forSolving Linear Tri-level Programming Problem

سال انتشار: 1393
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 863

فایل این مقاله در 20 صفحه با فرمت PDF قابل دریافت می باشد

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این مقاله:

شناسه ملی سند علمی:

JR_IJMAE-1-4_001

تاریخ نمایه سازی: 22 دی 1393

چکیده مقاله:

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,

کلیدواژه ها:

Linear bi-level programming problem ، Linear tri -levelprogramming problem ، Karush-Kuhn-Tucker conditions ، Genetic theorem ، Line search method

نویسندگان

Eghbal Hosseini

Department of Mathematics, Payam Noor University of Tehran, Tehran, Iran

Isa Nakhai Kamalabadi

Department of Industry, University of Kurdistan, Sanandaj, Iran