| |||||||||||||
KES-IDT-June-IS08 2014 : Call for Papars for Invited Session is08 | |||||||||||||
Link: http://idt-14.kesinternational.org/ | |||||||||||||
| |||||||||||||
Call For Papers | |||||||||||||
INVITED SESSION SUMMARY
Title of Session: Mixed-Integer Bilevel Programming: Application to Equilibrium, Variational Inequality, and Combinatorial Problems Name, Title and Affiliation of Chair: Dr. Vyacheslav V. Kalashnikov, Assistant Professor, Tecnológico de Monterrey (ITESM), Campus Monterrey, Mexico; and Central Economics and Mathematics Institute (CEMI), Moscow, Russia; and Sumy State University, Sumy, Ukraine. Details of Session (including aim and scope): Although a wide range of applications fit the bilevel programming framework, real-life implementations are scarce, due mainly to the lack of efficient algorithms for tackling medium- and large-scale bilevel programming problems. Solving a bilevel (more generally, hierarchical) optimization problem, even in its simplest form, is a difficult task. A lot of different alternative methods may be used based on the structure of the problem analyzed, but there is no general method that guarantees convergence, performance, or optimality for every type of problem. Many new ideas have appeared and have been discussed in works of plenty of authors. Among these authors, we could name S. Dempe, B. Mordukhovich, J. Dutta, M. Labbé, P. Marcotte, G. Savard, N. Dinh, L. Vicente, and others, whose works have developed various ways of reducing original bilevel programming problems to equivalent single level ones, and thus making their solution an easier task for conventional mathematical programming software packages. Mixed-integer bilevel programming problems (with part of variables at the upper and/or lower level being integer/Boolean ones) are even harder for the well-known conventional optimization techniques. For instance, a usual replacement of the lower level optimization problem with a corresponding KKT condition may not work if some lower level variables are not continuous. Therefore, solid theoretical base is necessary to be found, in order to propose efficient algorithmic procedures aimed at finding local or global solutions of such a problem. Last but not least: many new applied problems in the area of energy networks have recently arisen that can be efficiently solved only as mixed-integer bilevel programs. Among them are the natural gas cash-out problem, the deregulated electricity market equilibrium problem, bio-fuel problems, a problem of designing coupled energy carrier networks, etc., if we mention only part of such applications. Bilevel models to describe migration processes are also in the running of the most popular new themes in the area of bilevel programming. The primary purpose of the invited session is to discuss these problems with the researchers working in this and in adjacent areas. The people interested in this field are cordially invited to contribute to this session. Email & Contact Details: kalash@itesm.mx Professor Vyacheslav Kalashnikov, Tecnológico de Monterrey(ITESM), Campus Monterrey, Mexico |
|