Bilevel Programming and Applications

<div>The problem with upper level connecting constraints. The feasible set is depicted with bold lines. The point <svg height="8.8423pt" id="M73" style="vertical-align:-0.2064009pt" version="1.1" viewbox="-0.0498162 -8.6359 8.8162 8.8423" width="8.8162pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M645 631C614 643 545 666 457 666C215 666 23 519 23 283C23 90 158 -16 337 -16C412 -16 489 2 522 10C543 39 590 127 606 167L580 181C519 89 459 18 348 18C201 18 122 136 122 287C122 464 244 632 435 632C544 632 602 595 608 472L639 475C643 526 645 581 645 631Z" id="g113-68"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="668" vert-adv-y="668"></glyph.data></g></svg> is global optimal solution and point <svg height="8.68572pt" id="M74" style="vertical-align:-0.0498209pt" version="1.1" viewbox="-0.0498162 -8.6359 9.2729 8.68572" width="9.2729pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M686 28C612 35 607 44 591 112C563 234 541 360 519 489L489 666L457 658L147 121C100 40 89 36 24 28L17 0H240L250 28C168 34 159 41 190 101L262 237H482C495 180 503 137 510 91C517 47 514 35 441 28L433 0H677L686 28ZM475 280H285L429 541H431L475 280Z" id="g113-66"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="703" vert-adv-y="703"></glyph.data></g></svg> is a local optimal solution.</div>

Mathematical Problems in Engineering

Bilevel Programming and Applications

Figure 1