assignment6_ProblemSet

# assignment6_ProblemSet - ORIE 3300/5300 Individual work....

This preview shows pages 1–2. Sign up to view the full content.

ORIE 3300/5300 ASSIGNMENT 6 Fall 2008 Individual work. Due: 3 pm, Friday October 24. 1. A coach must assign four swimmers to a 200-meter medley relay team. He can choose from ﬁve available swimmers, each of whom could swim the 50-meter leg in any one of the four strokes. The swimmers’ best times in each stroke are listed below (in seconds). Stroke Andrew Brian Charles Darren Emil Breaststroke 43.4 41.8 33.1 42.2 34.7 Butterﬂy 33.3 33.6 28.5 38.9 30.4 Backstroke 37.7 35.4 32.9 33.8 37.0 Freestyle 29.2 31.1 26.4 29.6 28.5 The coach wants the fastest possible team. Explain how to formulate his task as an assignment problem, and solve it, using the AMPL model ﬁle transp.mod . 2. Consider the linear programming problem max x 1 - x 2 x 1 - x 2 1 x 1 - x 2 ≥ - 1 x 1 , x 2 unrestricted in sign . According to the fundamental theorem of linear programming, this problem should be infeasible, unbounded, or have an optimal solution. (a) Show that this problem is feasible and bounded.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This homework help was uploaded on 02/20/2009 for the course ORIE 3300 taught by Professor Todd during the Fall '08 term at Cornell.

### Page1 / 2

assignment6_ProblemSet - ORIE 3300/5300 Individual work....

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online