undefined

Given the following network whose arcs are labeled as A, B, C, .... A F B G The following table shows the unit shipping cost and capacity for each arc. The first value with a "$" is the unit shipping cost and the second value is for the capacity. cost, Arc cost, cost, Arc Arc capacity capacity capacity $10, 21 D $17, 25 G $23, 26 B $22, 33 E $17, 20 H $22, 20 $12, 22 F $26, 11 1 $29, 32 Node 1 is a supply node with 54 units to be delivered to Node 7, which needs the 54 units. We would like to formulate a linear program to find the least expensive way to ship the supply at Node 1 to meet the demand at Node 7. Complete the specified objective function and constraints below. 1. If a variable does not exist in the objective function or constraint, put a "0" as its coefficient. 2. For variables with coefficient "1", you need to explicitly put the value "1" in the box. 3. The RHS should be a constant. All variables appear on the left hand side of a constraint. If a coefficient is negative, put a negative sign, for example, -3.] (objective function) (Click to select) A DC+ D+ DE+ G+ H+ Subject to: [For flow constraints, please use the arrangement of OUTFLOW - INFLOW] (flow constraint for Node 1) DA+DB+ OC+ DD+[ E+OF+OG+OH+ 11( (Click to select) (capacity constraint for arc F) F (Click to select))