this is for my linear programming class

p timization software. 2-34 Fast Food Fantasy (Triple-F) cooks differ- ent types of hamburgers j = 1,...,4 in batches. A batch of burger consists of at most uj units and requires the entire cooking grill for f minutes. Assuming that the hourly demand for each burger is a known quantity d, Triple-F would like to decide the best batch size for each product. All required batches (and fractions of batches) must fit within the available grill time each hour, and the time re- quired to sell out each burger should be minimized so that none will get too cold waiting to be sold. Using this information, they wish to choose a combination of locations that will minimize the total wire length required. (a) Explain why appropriate decision vari- ables for a model of this problem are (i = 1,...,m; j = 1,...,n) i if i goes to sitej Xjjalo otherwise (b) Explain why the length of any wire re- quired between modules i and i'. can be expressed as