机读格式显示(MARC)

• 000 01720nam 2200325 a 4500

• 000 1000108316

• 001 0000330763

• 005 20100302143340.0

• 008 091221s1985 gaua b 000 0 eng d

• 020 __ |c CNY2.80

• 040 __ |a CAU |c CAU

• 050 00 |a T56.24.G4

• 090 __ |a O221/SCM

• 093 __ |a O221 |2 4

• 100 1_ |a Shetty, C. M., |d 1929-

• 245 12 |a A Decomposition procedure for convex quadratic programs / |c by C.M.Shetty and Mohammed Ben Daya.

• 260 __ |a Atlanta : |b School of Industrial and Systems Engineering, Georgia Institute of Technology, |c 1985.

• 300 __ |a 10 p. : |b ill. ; |c 28 cm.

• 490 0_ |a PDRC report series ; |v 85-01

• 500 __ |a This work was supported by the Office of Naval Research under Contract No. N00014-83-K-0147.

• 504 __ |a Includes bibliographical references (p. 10)

• 520 __ |a This paper deals with the solution of convex quadratic programs by iteratively solving a master problem and a subproblem as proposed previously by Sacher. The approach has the advantage that the subproblems are linear programs so that existing schemes for solving large problems can be taken advantage of. This paper gives a closed form solution to the master problem so that the procedure is well suited for solving large quadratic programs and can take advantage of the constraint structure. (Author).

• 650 _0 |a Numerical Mathematics.

• 650 _0 |a Quadratic programming.

• 700 1_ |a Daya, Mohammed Ben.

• 710 2_ |a Georgia Institute of Technology. |b School of Industrial and Systems Engineering.

• 901 __022009003081

• 905 __ |a CAU |f O221/SCM |b E0217462

• 907 __ |a CAU |f O221/SCM |b E0217462

• 999 __ |t A |A gxr |a 20091221 13:50:46 |I gxr |i 20100302 14:33:40 |G gxr |g 20100302 14:33:4