Essay
Saba conducts regular tours of his favorite city in the world, Paris. Each semester he selects among the finest students in the university and escorts them to the City of Lights. In addition to a world-class education on conducting business in Europe, he arranges a number of cultural outings for them to help them immerse themselves in all that France has to offer. He collects an extra $100 from each student for this purpose and limits his tour group to ten lucky individuals. Some of the events (and their prices) he proposes to the students include:
Eiffel Tower visit, $40 per student, E
Paris Sewer spelunking, $20 per student, S
Half day passes to the Louvre, $60 per student, L
Bon Beret tour, $50 per student, B
So much to do and so little time!
-The tour group has three days remaining in Paris and the opportunity to do three cultural events. It is important to soak up as much culture as possible, so Saba decides to model this as a 0-1 integer program mandating that the group does three events. A couple of students object, not to the integer program, but to the set of cultural events that they have to choose from. They would rather have the option to do up to three events but perhaps only one or two and spend the rest of their time doing some "retail benchmarking." What was Saba's original constraint and how does that constraint change to cater to the whims of the students?
Correct Answer:

Verified
Saba's original constraint was E + L + S...View Answer
Unlock this answer now
Get Access to more Verified Answers free of charge
Correct Answer:
Verified
View Answer
Unlock this answer now
Get Access to more Verified Answers free of charge
Q28: If the solution values of a linear
Q29: Binary variables are<br>A) 0 or 1 only.<br>B)
Q30: The three types of integer programming models
Q31: <br> Max Z =   x1
Q32: If we graph the problem that requires
Q34: Consider a capital budgeting example with five
Q35: The _ method is based on the
Q36: Assume that we are using 0-1 integer
Q37: In a _ integer model, some solution
Q38: The branch and bound method of solving