This thesis presents a modification of the gravitational interior point method for quadratic programming [7]. Murty presented the algorithm as a generalization of his gravitational method for linear programming [8]. Murty claims that this method is matrix inverse free unlike other interior point methods, however convergence of his algorithm is not guaranteed. This thesis introduces modifications in the centering step of the algorithm and, using a MatlabR2009a implementation, demonstrates the centering step
