URGENT HELP PLEASE Answer all please

Question 21 (5 points) A firm has prepared the following binary integer program to evaluate a number of potential new capital projects. The firm's goal is to maximize the net present value of their decision while not spending more than their currently available capital. Max1001+1202+903+1354 s.t. 1501+2002+2253+1754500{ Constraint 1} x1+x2+x3+x42{ Constraint 2} x2+x41{ Constraint 3} x2+x31{ Constraint 4} x1=x4{ Constraint 5} xj={1,ifprojectjisselected0,otherwise What is the expected net present value of the optimal solution? a) 220 b) 210 c) 310 d) 235 Consider the following all-integer linear program: Max10x1+3x2 s.t. 6x1+7x2403x1+1x211x1,x20andinteger The value of the optimal solution to the LP Relaxation is 3.67 and it is given by X1= 3.67,x2=0.0 Here is the graphical solution of the problem: Here is the graphical solution of the problem: Find the optimal solution for the integer linear program. a) x1=0,x2=5 b) x1=3,x2=1 c) x1=3,x2=0 The network flows into and out of demand nodes are what makes the production and inventory application modeled is transshipment model. assignment -task model maximal flow model. transportation model. shortest-route model. Question 24 ( 5 points) A manufacturing firm has four plants and wants to find the most efficient means of meeting the requirements of its four customers. The relevant information for the plants and customers, along with shipping costs in dollars per unit, are shown in the table below: A manufacturing firm has four plants and wants to find the most efficient means of meeting the requirements of its four customers. The relevant information for the plants and customers, along with shipping costs in dollars per unit, are shown in the table below: Customer (requirement) How many decision variables will the network have? a) 3