Taylor Approach for Solving Non-Linear Bi-level Programming Problem
Journal: Advances in Computer Science : an International Journal(ACSIJ) (Vol.3, No. 5)Publication Date: 2014-10-02
Authors : Eghbal Hosseini; Isa Nakhai Kamalabadi;
Page : 91-97
Keywords : Non-linear bi-level programming problem; Taylor theorem; Karush-Kuhn?Tucker conditions; smoothing methods;
Abstract
In recent years the bi-level programming problem (BLPP) is interested by many researchers and it is known as an appropriate tool to solve the real problems in several areas such as computer science, engineering, economic, traffic, finance, management and ...
Other Latest Articles
- A Method for Hiding Association rules with Minimum Changes in Database
- Effective Proposal for using Cloud Computing in Educational Environments in Iran
- CBT-fi: Compact BitTable Approach for Mining Frequent Itemsets
- Adaptive Color Mapping for NAO Robot Using Neural Network
- Extracting Persian-English Parallel Sentences from Document Level Aligned Comparable Corpus using Bi-Directional Translation
Last modified: 2014-10-02 23:37:20