2 questions in Linear Optimization.
In the bus route problem (notation as in class), how do you write the constraint “no bus ever stops at a given stop j”? Ο ΣΤΙΣ 13 = 0 Ο Σ Σ Φhi = 0 Ο Σ Σ αθij = 1 Σιά; Σ, Rij = 1 Let S=727, and consider the problem from section 9.1: the goal is to maximize the product al:-.. ‘An given that a; € [0, S) are integers and a1 +… tan = S = 727. Enter your answers as an integer number in the following blanks (you may use a calculator, and should use your answer to HW problem 1). The number of summands n is n = Of these summands, exactly are equal to 3; and exactly are equal to 2.