LA7 Complete Case problem 1 from Chapter 11. Please prepare a max 1-page report for the case problem. Include your answer to the requirements mentioned in the case problem. Include details of the LP model and its solution. LP Relaxation The linear program that results from dropping the integer requirements for the variables in an integer linear program. Mixed-integer linear program An integer linear program in which some, but not necessarily all, variables are required to be integer. Multiple-choice constraint A constraint requiring that the sum of two or more 0-1 variables equals 1 . Thus, any feasible solution makes a choice of which variable to set equal to 1 . Mutually exclusive constraint A constraint requiring that the sum of two or more 0-1 variables be less than or equal to 1 . Thus, if one of the variables equals 1 , the others must equal 0 . However, all variables could equal 0 . Product design and market share optimization problem Sometimes called the share of choice problem, it involves choosing a product design that maximizes the number of consumers preferring it. Supply chain design problem A mixed-integer linear program in which the binary integer variables usually represent sites selected for warehouses or plants and continuous variables represent the amount shipped over arcs in the supply chain. Problems 1. Indicate which of the following is an all-integer linear program and which is a mixedinteger linear program. Write the LP Relaxation for the problem but do not attempt to solve. a. Max30x1+25x2 s.t. 3x1+1.5x21.5x1+2x21x1+1x2x1,x24002501500andx2integer b. Min 3x1+4x2 s.t. 2x1+4x282x1+6x212x1,x20andinteger