Задача нелинейного программирования. Условная оптимизация. Метод Била
Метод Била
x1x1 x2x2 b x3x x4x4 -16 df/dx df/dx
x1x1 x2x2 b-b/x 1 x3x x4x df/dx df/dx df/dx j (X)100 u1=u1=
u1u1 x2x2 b x3x3 1/2-35 x4x4 1/2-21 x1x1 -1/215
u1u1 x2x2 b-b/x 2 x3x3 1/2-355/3 x4x4 1/2-211/2 x1x1 -1/215- df/du 1 -1/200- df/dx df/dx j (X)010
u1u1 x4x4 b x3x3 -1/43/27/2 x2x2 1/4-1/21/2 x1x1 -1/4-1/211/2
u1u1 x4x4 b-b/u 1 x3x3 -1/43/27/214 x2x2 1/4-1/21/2- x1x1 -1/4-1/211/222 df/du 1 -5/81/49/418/5 df/dx 4 1/4-1/2-9/2- df/dx j (X)9/4-9/2 u2=u2=
u2u2 x4x4 b x3x3 2/57/513/5 x2x2 -2/5 7/5 x1x1 2/5-3/523/5 u1u1 -8/52/518/5
u2u2 x4x4 b x3x3 2/57/513/5 x2x2 -2/5 7/5 x1x1 2/5-3/523/5 u1u1 -8/52/518/5 df/du 2 -1,600 df/dx 4 0-0,4-3,6 df/dx j (X)0-3,6