This chapter examines the evolution and advantages of applying network programming, as well as its importance for decision making. Problems in network programming are modeled through graph structures and are often particular cases of linear programming. We will present the modeling of various real problems with network programming, including the classic transportation problem and the transshipment problem, to name a few. The classic transportation problem will be solved through the transportation algorithm, which is a simplification of the Simplex method. All of the network programming problems presented will be solved by Excel Solver.