MC Cargo, a fast delivery parcel firm, wants to open p new outlets in a region. In the region Mc Cargo has i = 1...m clients with a demand ai. The firm has defined j = 1... n potential locations, and has computed the delivery time between each client and potential location, tij . The objective is to maximize coverage within S hours, but also to have all clients covered within T hours, where S < T. 1. Formulate this problem with a binary linear program, defining the variables that are used and describing the constraint set. Formulate the problem Solve the problem using the dataset file covering problem MCLP LSCP.xls, where i = 1,..,20, j = 1,.., 20, S= 10, T = 15, p = 4 and write a report %3D %3D for the CEO with the results obtained.