Lagrangian Theorem
Given a minimization problem, with constraints such that every constraint is an equation (not an inequality):
min z = a o â + a 1 â x 1 â + a 2 â x 2 â + âĶ x i 1 â + x k 1 â + âĶ = h 1 â âŪ x im â + x km â + âĶ = h m â â
We can construct a new minimization problem without constraints, such that the solution of the first problem is the same as that of the second problem:
min â z Ë = â a o â + a 1 â x 1 â + a 2 â x 2 â + âĶ + + Îŧ 1 â ( x i 1 â + x k 1 â + âĶ â h 1 â ) âŪ + Îŧ m â ( x im â + x km â + âĶ â h m â ) â
â So to find the minimum of the z Ë function we can simply resolve the following system:
( x Ë , Îŧ Ë ) : âĐ âĻ â§ â â x 1 â â Q ( x Ë , Îŧ Ë ) â = 0 â x 2 â â Q ( x Ë , Îŧ Ë ) â = 0 âŪ â x m â â Q ( x Ë , Îŧ Ë ) â = 0 â Îŧ 1 â â Q ( x Ë , Îŧ Ë ) â = 0 â Îŧ 2 â â Q ( x Ë , Îŧ Ë ) â = 0 âŪ â Îŧ m â â Q ( x Ë , Îŧ Ë ) â = 0 â