3 Introduction to Linear Programming

# 3 Introduction to Linear Programming - Introduction to...

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

± ± ± ± ± ± ± ± ± ± ± EXAMPLE 1 Giapetto’s Woodcarving Introduction to Linear Programming Linear programming (LP) is a tool for solving optimization problems. In 1947, George Dantzig de- veloped an efFcient method, the simplex algorithm, for solving linear programming problems (also called LP). Since the development of the simplex algorithm, LP has been used to solve optimiza- tion problems in industries as diverse as banking, education, forestry, petroleum, and trucking. In a survey of ±ortune 500 Frms, 85% of the respondents said they had used linear programming. As a measure of the importance of linear programming in operations research, approximately 70% of this book will be devoted to linear programming and related optimization techniques. In Section 3.1, we begin our study of linear programming by describing the general char- acteristics shared by all linear programming problems. In Sections 3.2 and 3.3, we learn how to solve graphically those linear programming problems that involve only two variables. Solv- ing these simple LPs will give us useful insights for solving more complex LPs. The remainder of the chapter explains how to formulate linear programming models of real-life situations. 3.1 What Is a Linear Programming Problem? In this section, we introduce linear programming and defne important terms that are used to describe linear programming problems. Giapetto’s Woodcarving, Inc., manuFactures two types oF wooden toys: soldiers and trains. A soldier sells For \$27 and uses \$10 worth oF raw materials. Each soldier that is manu- Factured increases Giapetto’s variable labor and overhead costs by \$14. A train sells For \$21 and uses \$9 worth oF raw materials. Each train built increases Giapetto’s variable la- bor and overhead costs by \$10. The manuFacture oF wooden soldiers and trains requires two types oF skilled labor: carpentry and fnishing. A soldier requires 2 hours oF fnishing labor and 1 hour oF carpentry labor. A train requires 1 hour oF fnishing and 1 hour oF car- pentry labor. Each week, Giapetto can obtain all the needed raw material but only 100 fn- ishing hours and 80 carpentry hours. Demand For trains is unlimited, but at most 40 sol- diers are bought each week. Giapetto wants to maximize weekly proft (revenues ± costs). ±ormulate a mathematical model oF Giapetto’s situation that can be used to maximize Gi- apetto’s weekly proft. Solution In developing the Giapetto model, we explore characteristics shared by all linear pro- gramming problems. Decision Variables We begin by defning the relevant decision variables. In any linear programming model, the decision variables should completely describe the decisions to be made (in this case, by Giapetto). Clearly, Giapetto must decide how many soldiers and trains should be manuFactured each week. With this in mind, we defne

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

View Full Document
x 1 ± number of soldiers produced each week x 2 ± number of trains produced each week Objective Function In any linear programming problem, the decision maker wants to max-
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 11/02/2010 for the course ORIE 1101 taught by Professor Trotter during the Fall '10 term at Cornell University (Engineering School).

### Page1 / 78

3 Introduction to Linear Programming - Introduction to...

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

View Full Document
Ask a homework question - tutors are online