A New Coordination Model for Ill-Posed Bilevel Programming Problem

Shi Hui Jia; Yue Zheng

doi:10.4028/www.scientific.net/AMM.411-414.1943

Paper Titles

A Syntactic Reordering Model of Chinese Special Sentences for Patent Machine Translation
p.1923

Gene Expression Programming Based on Parallel Tabu Search for Improving Model Accuracy
p.1930

A Study on Approximation Performances of Improved Bp Neural Networks Based on LM Algorithms
p.1935

An Ant Colony Optimization Algorithm for Selection Problem
p.1939

A New Coordination Model for Ill-Posed Bilevel Programming Problem
p.1943

Study for Evaluation Method Based on Neural Networks
p.1948

Approximation Performance of BP Neural Networks Improved by Heuristic Approach
p.1952

A Novel Evolutionary Algorithm with Improved Genetic Operator and Crossover Strategy
p.1956

Solving Timetabling Problem Using A Co-Operative Co-Evolution Multi-Objective Genetic Algorithm
p.1966

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 411-414A New Coordination Model for Ill-Posed Bilevel...

A New Coordination Model for Ill-Posed Bilevel Programming Problem

Abstract:

This paper studied the leader how to motivate the follower to maximize its interests for ill-posed linear bilevel programming problem. We first presented a coordination model and gived its corresponding penalty problem. Under some conditions, we established the result on the existence of the solution. Then, an algorithm was developed to obtain a coordination solution to the original bilevel programming problem. Finally, numerical results show that the proposed method is feasible.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 411-414)

Pages:

1943-1947

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.411-414.1943

Citation:

Cite this paper

Online since:

September 2013

Authors:

Shi Hui Jia, Yue Zheng

Keywords:

Coordination Model, Ill-Posed Bilevelprogramming, Penalty Method

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] S. Dempe. Annotated bibliography on bilevel programming and mathematical programs with equilibrium constrains[J], Optimization, 2003, 52: 333-359.

DOI: 10.1080/0233193031000149894

Google Scholar

[2] J.F. Bard. Practical Bilevel Optimization: Algorithms and Applications[M], Kluwer Academic Publishers, Dordrecht, (1998).

Google Scholar

[3] B. Colson,P. Marcotte and G. Savard. An overview of bilevel optimization [J]. Annals of Operations Research, 2007, 153: 235-256.

DOI: 10.1007/s10479-007-0176-2

Google Scholar

[4] S. Dempe. Foundations of bilevel programming[M]. Kluwer Academic Publishers, (2002).

Google Scholar

[5] S. Dempe and A. Zemkoho. The bilevel programming problem: refomulations, constraint qualifiications and optimality conditions[J]. Mathematical Programming, 2013, 138(1-2): 447-473.

DOI: 10.1007/s10107-011-0508-5

Google Scholar

[6] S. Dassanayaka. Methods of variational analysis in pessimistic bilevel programming[D]. PhD thesis, Wayne State University, (2010).

Google Scholar

[7] S. Dempe., B.S. Mordukhovich. and A.B. Zemkoho. Necessary optimality conditions in pessimistic bilevel programming[J], Optimization, DOI: 10. 1080/02331934. 2012. 696641, (2012).

DOI: 10.1080/02331934.2012.696641

Google Scholar

[8] D. Cao. and L. Leung. A partial cooperation model for non-unique linear two-level decision problems[J]. European Journal of Operation Research. 140: 134-141(2002).

DOI: 10.1016/s0377-2217(01)00225-9

Google Scholar