Feasibility of lingo software for bi-level programming problems (BLPPs): A study

Abstract

Lingo© is a basic programming tool for solving linear programming problems (LPPs), non-linear programming problems (NLPPs) and other related programming problems. But this software has certain limitations like it can not be employed on complex hierarchical programming problems like bi-level programming problems (BLPPs), multi-level programming problems (MLPPs) etc. In this context researchers namely Kuo and Huang [1] have presented a method based on particle swarm optimization (PSO) algorithm for solving bi-level programming problems and performance of developed method have been analysed with the results of other methods like fuzzy neural networks (ANN), genetic algorithm (GA), lingo (software) on same numerical examples. In this article, the feasibility of Lingo© software for solving bi-level linear programming problems (BLPPs) has been studied and proved that this software cannot be used for solving BLPPs. The aim of this paper is to identify the results and performance analysis given by Kuo and Huang with Lingo are incorrect and Lingo© is not feasible for solving bi-level linear programming problems (BL-LPPs).