s02rec02

s02rec02 - Recitation 2. 15.053 Introduction to...

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

View Full Document Right Arrow Icon
Recitation 2. 15.053 Introduction to Optimization Feb 15, 2002 Topics: 1. Revision of formulation, abstraction, topics from pset #1. 2. Geometry of linear programming (including sensivity analysis). 3. Standard form 4. Simplex method 1 Scheduling Postal Workers At a local post office, workers are scheduled over n periods. The schedule repeats periodically. There are n possible shifts for the workers, one beginning in each of the n periods. Let a ij = 1 if workers in shift j work during period i. Let d i denote the demand for workers in period i. Let c i be the cost of a worker during period i. Thus the cost of a shift is the sum of the costs of workers in the periods of the shift. Express as a linear program the problem of minimizing the cost of the workforce so as to meet or exceed demands in each period. For your decision variables, you should let x j denote the number of workers working on shift j. Let f j be the cost of worker on shift j. Clear state what f j is in terms of the c’s.
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 2

s02rec02 - Recitation 2. 15.053 Introduction to...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online