A large class of separable quadratic programming problems is presented The problems in the class can be solved in linear time The class in cludes the separable convex quadratic transportation problem with a xed number of sources and separable convex quadratic programming with nonnegativity con straints and a xed number of linear equality constraints
