This study attempts to establish an innovative solid transportation problem that intends to maximize profit under the rough interval approximation methodology. Two transportation problems were constructed in this regard with interval coefficients corresponding to the upper approximations and the lower approximations of the rough intervals under study. Furthermore, from the contingent solid transportation problems, four different classical solid transportation problems were derived, which were subsequently solved on the LINGO iteration platform. The concepts of completely satisfactory solution and rather satisfactory solution, surely optimal range, possibly optimal range, and rough optimal range have been discussed with a perspective to its relevance to real-world practical problems. The rough chance-constrained programming and the expected value operator for rough interval have been applied to solve the problem under study. The distinct advantages of the proposed method over those existing have been outlined. Numerical examples have also been provided to illustrate the solution procedure and the methodologies adopted. © 2016 IEEE.