ABSTRACT

A Network is a set, directed, acyclic multigraph over which messages can be transmitted from source node to sink node. Linear programming is one of the most important optimization techniques to help decision making in network. The linear programming problem calls for optimising linear functions of variables called objective function, subject to a set of linear equations and /or inequalities called constraints. The objective function maximize either the total out-flow from source node or total in-flow to sink node. We will prove fractional routing capacity for some solvable network using inequalities model.