MIE376 Lec 5 - NLPQPv2.page39

MIE376 Lec 5 - NLPQPv2.page39 - Bi-level Linear Programming...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Bi-level Linear Programming When both the Leader and the Follower problems are LP problems Leader’s problem Max cLx + dLy* subject to ALx + BLy* ≤ bL , x ≥ 0 Follower’s problem Max cFx + dFy subject to AFx + BFy ≤ bF, y≥0 MIE376 - Mathematical Programming 39 ...
View Full Document

Ask a homework question - tutors are online