Please use AMPL to solve this problem... I'll give you up thumb definitely

Consider the following variant of the problem of minimum cost flow where in addition to the network G = (V, A) with values bi associated with nodes i E V, such that Liebi=0 and costs Cij for the unit cost of transport along the arc (i, j) E A we also have that: in each arch is associated with a capacity value that indicates the maximum flow dj transportable along the arc the number of arcs along here has sent a strictly positive flow is no more than a percentage 100p1 % of the total of the arches and for each of these arcs you pay a fixed cost of K the number of arcs that are saturated (arcs along which is sent a flow equal to their capacity) is at least a percentage 100p2 % of the total of the arches (p2