ME 366L Weekly Overview - Week 06

ME 366L Weekly Overview - Week 06 - realistic size problems...

This preview shows page 1. Sign up to view the full content.

Week Six – General integer programming (IP) models, use of logic variables and constraints, applications to staff scheduling, fixed charge, the traveling salesman problem Integer programming Context: The simplest way of generalizing the linear program is to relax the assumption that all the variables are continuous. Doing so gives rises to the general class of optimization problems called integer linear programs. We discuss the generic integer programming model, indicate how binary variables can be used to model logic situations, and describe several common IP applications. Purpose: To provide you with a basic understanding of integer programming models, their uses, the power and flexibility of binary variables, and the computational difficulties that are encountered when trying to solve
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: realistic size problems. Objectives: At the end of this lesson, you will be able to: 1. Formulate logic situations using binary variables. 2. Describe how integer programming can be used to solve several classes of problems, including staffing scheduling problems, facility location problems, general fixed charge problems, the traveling salesman problem and its variants. 3. Convert a nonlinear function of a single variable into a piecewise linear function using combination of continuous and binary variables. 4. Describe the effectiveness and appropriateness of rounding a fractional solution to an integer solution. 5. Set up and solve integer programs using the Excel add-in....
View Full Document

This note was uploaded on 12/19/2011 for the course M E 366l taught by Professor Staff during the Spring '08 term at University of Texas.

Ask a homework question - tutors are online