Lecture 4 - Budget and space constraints Minimize s.t. i =1...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
Budget and space constraints Minimize s.t. C Q c n i i i = 1 ( ) = + = n i i i i i i n Q D A Q h Q Q TAC 1 1 2 ,..., W Q w n i i Budget constraint Space constraint i = 1 Lagrange multipliers method: Minimize by solving necessary conditions: ( ) - Θ + - Θ + + = Θ Θ = = = n i i i n i i i n i i i i i i n W Q w B Q c Q D A Q h Q Q TAC 1 2 1 1 1 2 1 1 2 , , ,..., 2 , 1 ; ,..., 1 0 , 0 = = = Θ = j n i for G Q G j i
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Steps to Find Optimal Solution Double constraints: 1. Solve the unconstrained problem. If both constraints are satisfied, this solution is the optimal one. 2. Otherwise rewrite objective function using Lagrange multipliers by including one of the constraints, say budget, and solve one-constraint problem to find optimal solution. If the space constraint is satisfied, this solution is the optimal one. 3. Otherwise repeat the process for the only space constraint. 4. If both single-constraint solutions do not yield the optimal solution, then both constraints are active, and the Lagrange equation with both constraints must be solved. 5. Obtain optimal Q i * by solving (n+2) equations 2 , 1 ; ,..., 1 0 , 0 = = = Θ = j n i for G Q G j i ( ) - Θ + - Θ + + = Θ
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/25/2010 for the course IE 654 taught by Professor Smith during the Spring '10 term at 카이스트, 한국과학기술원.

Page1 / 14

Lecture 4 - Budget and space constraints Minimize s.t. i =1...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online