Write a general MIP (in compact form) for this problem. (formulation in compact form)

The specific objectives are to maximize the number of wishes that are satisfied

Your task is to assist in developing the schedule for a small league containing six teams. The teams are labeled as Teams A-F. An initial schedule using placeholders has been developed using the circle method and is provided to you in data-GXX. xlsx. You will develop a (mixed-)integer program in which you assign teams to these placeholders trying your best to fulfill as many wishes and constraints as possible from the lists below. Note that team-specific wishes are wishes that involve only one team, whereas multiple-team wishes are ones that involve multiple teams. The wishes are as follows: Team-specific wishes: 1. Team B would not like to play its first-round game at home because their home stadium is undergoing renovations that are necessary to prepare their stadium for continental competitions. 2. Team F would not like to play its first-round game away because there is a special event that they would like to celebrate at their home ground in that first-round weekend. 3. Team C would not like to play two away games in a row. 4. Team B would not like to play three away games in a row. 5. Team A prefers to play its first two games at home. 6. Team C would like to end the season by playing at home. Multiple-team wishes: 1. Due to security/policing constraints, and since they are located in the same city, Teams B and D should not play home games in the same round. 2. Since Teams A and E share the same home stadium, they also cannot play home games together in the same round. 3. When either Team B or Team D play at home, Team F wants to play away. 4. Team A's game against Team F should not be played in round 2. 5. Team C's game against Team D should not be played in round 4. 6. The game between teams E and F is considered a 'highlight game' and the league would prefer if this game takes place in rounds 3 or 4 to ensure it is as competitive as possible and draws the most attention. 7. Teams E and F are the two strongest teams in the league, so Team A would prefer not to play them in consecutive games. Observe that it may not be possible to satisfy all of these wishes, as they are often conflicting and will lead to infeasibilities. Therefore, using techniques that we learned in the course, you are tasked with coming up with a model that always produces a feasible solution/schedule which attempts to satisfy all of these wishes, or as many wishes as possible (the specific objectives are provided in item