this is very famous bicycle question in computer science cours There are n peopl

Question

this is very famous bicycle question in computer science cours
There are n people who have to travel a distance of 10 miles, and have one single-seat bicycle at their disposal. The data are specified by the walking speed Wj and the bicycling speed Bj of each person j. the task is to minimize the arrival time of the last person. show that the optimal value of the following LP problem provides a lower bound on the optimal value of the bicycle problem.
minimize T
subject to
T - Xj - Xj' - Yj - Yj' => 0
T - (Y1 + Y2 + .... Yn) - (Y1' + Y2' + .... Yn') => 0
WjXj - WjXj' + BjYj - BjYj' = 10
(B1Y1 + B2Y2+...BnYn) - (B1Y1' + B2Y2'+....BnYn') <= 10
Xj, Xj', Yj, Yj' => 0
** the second and the fourth conditions are writiten in sigma forms in Masuda (1970) book.
*** solve the case when n=3, W1 = 4, W2 = W3 = 2, B1 = 16, B2 = B3= 12

Explanation / Answer

There are usually two buttons- One for Switch ON/OFF the computer and second ... share your computer with a few other people that have their ... task eden disposal

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.