We present a O (n) time algorithm for the projection of a vector on the intersection of a hyperplane and Rn+. A linear-time median-finding algorithm is used to determine the median of the components of the vector to be projected. This extends a previous result of Maculan and Paula Jr. concerning the projection on the n-dimensional simplex.
