{'fraction_non_alphanumeric': 0.02446183953033268, 'fraction_numerical': 0.0, 'mean_word_length': 4.845714285714286, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Taylor Approach for Solving Non-Linear Bi-level Programming Problem

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 so on. Also it has been proved that the general BLPP is an NP-hard problem. The literature shows a few attempts for using approximate methods. In this paper we attempt to develop an effective approach based on Taylor theorem to obtain an approximate solution for the non-linear BLPP. In this approach using the Karush-Kuhn–Tucker, the BLPP has been converted to a non-smooth single problem, and then it is smoothed by the Fischer – Burmeister function. Finally the smoothed problem is solved using an approach based on Taylor theorem. The presented approach achieves an efficient and feasible solution in an appropriate time which has been is evaluated by comparing to references and test problems.