The leanest effective expedition team. An expedition is planned across the wilderness of N...

The leanest effective expedition team. An expedition is planned across the wilderness of Nepal to ascend Mount Everest via the treacherous rear ascent route. The expedi tion leader has identified a large number of compatible climbers, set J, all with the endurance to survive the trip and conquer the mountain but has not yet selected those that would be asked. this is is because the leader has also listed a set of skills, I , which must be present for the expedition to he succe ssful. For purposes of logistics, the expedition must be kept as lean as possible : hence the selection must lead to the smallest number of climbers. Structure a zero- one program to pinpoint climbers for selection ill such a way that all skills are included somewhere in the expedition team and the team itself has the fewest total members.

Let:Ni = {j that posses skill i}, and

X j = 1, 0; it is I if climber j is selected for the expedition an do otherwise.