Documente Academic
Documente Profesional
Documente Cultură
I. INTRODUCERE
n lucrarea de fa se consider problema de programare
ptratic cu restricii liniare:
1
f ( x) = x T Hx + g T x min
(1)
2
referitor la : Ax b,
B d T min
2
referitor la : 0,
(2)
unde
B = AH 1 AT mm ,
d = AH 1 g + b m .
Menionm c n presupunerele de mai sus matricea
AH 1 AT este o matrice pozitiv definit.
Fie multiplicatorul Lagrange
* = (1* , *2 ,K, *m )T m
soluia optim a proplemei duale (2). Atunci soluia optim
a problemei considerate (1) poate fi obinut astfel
x * = H 1 ( AT * g )
ceea ce este echivalent cu rezolvarea urmtorului sistem de
ecuaii liniare fa de x:
Hx = AT * g .
476
8th International Conference on Microelectronics and Computer Science, Chisinau, Republic of Moldova, October 22-25, 2014
AH 1 AT * AH 1 g b z * = 0,
(* ) T ( AH 1 AT * AH 1 g b) = 0,
* 0, z * 0.
(3)
d
u( y) = 0 ,
dy
d
v( y ) = 0 pentru orice y 0 .
dy
d
u ( y1 )
dy1
0
U ( y ) =
F ( y ) p = 0
d
d
v( y ) =
u ( y ) v( y ) = 0
dy
dy
avem:
AH 1 AT V ( y ) p = U ( y ) p
y i , i = 1,2, K m
definim
De unde
[AH
operatorii
(5)
AT V ( y ) p V ( y ) p =
= [U ( y ) p ]T V ( y ) p =
U ( y ) i V ( y ) : m m :
= [V ( y )U ( y ) p ]T p = 0
u ( y1 )
v( y1 )
u( y2 )
v( y 2 )
U ( y) =
, V ( y) =
M
M
u( y )
v( y )
m
m
0 = AH 1 AT V ( y ) p V ( y ) p V ( y ) p
2
2
> 0,
U ( y ) p = 0 .
Prin
urmare,
u ( y s ) = 0 . Dac
AH 1 AT d U ( y ) = 0,
V ( y ) = 0.
dac
v ( y s ) 0 rezult
v ( y s ) = 0 rezult c
p s = 0 i
u ( y s ) 0 i
p s = 0 .Deci
AH 1 AT V ( y ) U ( y ) = AH 1 g + b
v( y1 )
L
0
0
dy
1
v( y 2 ) L
0
0
.
V =
dy
2
M
M
O
M
L
v
y
0
0
(
)
m
dy
m
pentru orice y 0 .
auxiliare
u( y2 ) L
0
,
dy 2
M
O
M
d
0
L
u ( y m )
dy m
4.
u( y)
d
d
u ( y i ) , respectiv
v( y i ) , i = 1,2, K , m :
dyi
dyi
(4)
p s = 0, s = 1,2, K , m ,
adic rang ( F ( y )) = m. Teorema este demonstrat.
Astfel sistemul de ecuaii (4) poate fi rezolvat cu ajutorul
metodei Newton, avnd viteza supraliniar de convergen
n vecintatea soluiei.
dimensiune m m cu elementele
477
8th International Conference on Microelectronics and Computer Science, Chisinau, Republic of Moldova, October 22-25, 2014
[AH
1 T
A V ( y ( k ) ) U ( y ( k ) ) ( y y ( k ) ) =
1 T
= AH A V ( y
(k )
) + U ( y (k ) ) .
{ }= {V ( y }.
( k +1)
( k +1)
x = H (A V ( y ) g)
Metoda descris n aceast lucrare a fost implementat n
cod MAPLE i testat pe un ir de probleme din [9].
*
referitor la :
x1 2,
10 x1 x 2 10.
x* = (2 0) T , f ( x * ) = 99.96.
Exemplul 2. (Problema nr. 35 [9, p. 58]).
f ( x) = 2 x12 + 2 x 22 + x32 + 2 x1 x 2 + 2 x1 x3
8 x1 6 x 2 4 x3 + 9 min
referitor la :
x1 x 2 2 x3 3.
4 7 4 T
1
) , f ( x* ) =
3 9 9
9
Exemplul 3. (Problema nr. 76 [9, p. 96]).
1
1
f ( x) = x12 + x 22 + x32 + x 42 x1 x3 + x3 x 4
2
2
x1 3 x 2 + x3 x 4 min
x* = (
referitor la :
x1 2 x 2 x3 x 4 5,
3 x1 x 2 2 x3 + x 4 4,
x 2 + 4 x3
3
.
2
478
REFERENCES
[1] N.I.M. Gould, Ph. L. Toint, A Quadratic
Programming Bibliography. Numerical Analysis
Group Internal Report 2000-1 Rutherford Appleton
Laboratory,
Chilton,
England,
2003.
http://www.optimizationonline.org/DB_4TML/2001/02/285.html.
[2] J.-B. Hiriart-Urruty, Optimisation et analyse
convexe. Presses Universitaires de France. 1998.
[3] Th. F Coleman., J. Liu, An interior Newton method
for
quadratic
programming.
Mathematical
Programming, Ser. A85, 1999, pp.491-523.
[4] V. Moraru, An Algorithm for Solving Quadratic
Programming Problems. Computer Science Journal
of Moldova, vol.5, No.2, 1997,pp.223-235.
[5] M.C
Bazaraa.,
C.M.
Shetty,
Nonlinear
Programming. Theory and Algorithms. John
Wiley&Sons, Inc. 1993.
[6] V. Moraru., Dm. Stoian. Newtons Method for
Solving Quadratic Programming Problems with
Simple Constraints. 7th International Conference on
Microelectronics and Computer Science, Chiinu,
Republic of Moldova, September 22-24, 2011.
pp.185-187.
[7] M.C.Ferris, Ch. Kanzow, Complementary and
related problems: A survey. 1998.
[8] V. Moraru, A Smooth Newton Method for Nonlinear
Programming Problems with Inequality Constraints.
Computer Science Journal of Moldova, vol. 20, no.
2(56), 2011 (n curs de apariie).
[9] W. Hock, K. Schittkowski, Test Examples for
Nonlinear Programming Codes. Lecture Notes in
Economics and Mathematical Systems, Vol. 187,
Springer-Verlag, Berlin / Heidelberg / New York,
1981.
[10] N.I.M. Gould, Ph. L. Toint. A quadratic
programming page. Quadratic programming codes.
http://www.numerical.rl.ac.uk/people/nimg/qp/qp.ht
ml
Lucrarea este realizat n cadrul Proiectului
bilateral Romnia Republica Moldova 2013-2014
ASDEC: Argumentarea structurilor pentru suportul
deciziilor cu constrngeri normative.