A Neurodynamic Optimization Approach to Bilevel Linear Programming
This paper presents new results on neurodynamic optimization approach to solve bilevel linear programming problems (BLPPs) with linear inequality constraints. A sub-gradient recurrent neural network is proposed for solving the BLPPs. It is proved that the state convergence time period is finite and can be quantitatively estimated. Compared with existing recurrent neural networks for BLPPs, the proposed neural network does not have any design parameter and can solve the BLPPs in finite time. Some numerical examples are introduced to show the effectiveness of the proposed neural network.
KeywordsBilevel linear programming problem sub-gradient recurrent neural network convergence in finite time
Unable to display preview. Download preview PDF.
- 4.Cichocki, A., Unbehauen, R.: Neural networks for optimization and signal processing. Wiley (1993)Google Scholar
- 19.Wen, U.P., Hsu, S.T.: Linear bi-level programming problems–a review. Journal of the Operational Research Society, 125–133 (1991)Google Scholar
<SimplePara><Emphasis Type="Bold">Open Access</Emphasis> This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 2.5 International License (http://creativecommons.org/licenses/by-nc/2.5/), which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made. </SimplePara> <SimplePara>The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.</SimplePara>