In this paper, we define a problem finding a simple path that maximizes the sum of the satisfied Origin-Destination (O-D) flows between nodes covered by that path as a Maximum O-D Flow Path Problem(MODEP). We established a formulation and suggested a method finding MODEP in a directed network. The method utilizes the constraint relaxation technique and the Dual All Integer Algorithm.