# Converting a Linear Program to Standard Form

Save this PDF as:

Size: px
Start display at page:

## Transcription

1

2 Converting a Linear Program to Standard Form Hi, welcome to a tutorial on converting an LP to Standard Form. We hope that you enjoy it and find it useful. Amit, an MIT Beaver Mita, an MIT Beaver 2

3 Linear Programs in Standard Form We say that a linear program is in standard form if the following are all true: 1. Non-negativity constraints for all variables. 2. All remaining constraints are expressed as equality constraints. 3. The right hand side vector, b, is nonnegative. I think it is really cool that when Ella speaks, some of her words are in red, and some are underlined. I wish I could do that. An LP not in Standard Form Stan Ella max z = 3x 1 + 2x 2 - x 3 + x 4 x 1 + 2x 2 + x 3 - x 4 5 ; -2x 1-4x 2 + x 3 + x 4-1; x 1 0, x 2 0 not equality not equality, and negative RHS x 2 is required to be nonpositive; x 3 and x 4 may be positive or negative. 3

4 Why do students need to know how to convert a linear program to standard form? What s so special about standard form? The main reason that we care about standard form is that this form is the starting point for the simplex method, which is the primary method for solving linear programs. Students will learn about the simplex algorithm very soon. In addition, it is good practice for students to think about transformations, which is one of the key techniques used in mathematical modeling. Tom Next we will show some techniques (or tricks) for transforming an LP into standard form. 4

5 Converting a constraint into standard form We first consider a simple inequality constraint. The first inequality constraint of the previous LP is x 1 + 2x 2 + x 3 - x 4 5 Nooz can speak in red, just like Ella. How does he do that? Wow! I just spoke in boldface. Cool! To convert a constraint to an equality, add a slack variable. In this case, the inequality constraint becomes the equality constraint: x 1 + 2x 2 + x 3 - x 4 +s 1 = 5. We also require that the slack variable is non-negative. That is s 1 0. s 1 is called a slack variable, which measures the amount of unused resource. Note that s 1 = 5 - x 1-2x 2 - x 3 + x 4. 5

6 Converting a constraint into standard form, and converting inequalities with a negative RHS. We next consider the constraint -2x 1-4x 2 + x 3 + x 4-1 I know how to do that one. Just add a slack variable, like we did on the last slide. Nice try, Tom, but incorrect. First we have to multiply the inequality by -1 in order to obtain a positive RHS. Then we get 2x 1 + 4x 2 - x 3 - x 4 1. Then we add a surplus variable and get 2x 1 + 4x 2 - x 3 - x 4 - s 2 = 1. s 2 is called a surplus variable, which measures the amount by which the LHS exceeds the RHS. Note that s 2 = 2x 1 + 4x 2 - x 3 - x 4-1 To convert a constraint to an equality, add a slack variable. To convert a constraint to an equality, add a surplus variable. 6

7 Getting Rid of Negative Variables Next, I ll show you how to transform the constraint constraint: x 2 0 into standard form. Can t we just write: x 2 + s 3 = 0 and s 3 0? Tom, what you wrote is correct, but it doesn t help. Standard form requires all variables to be non-negative. But after your proposed change, it is still true that x 2 0. The solution in this case is a substitution of variables. We let y 2 = -x 2. Then y 2 0. And we substitute y 2 for x 2 wherever x 2 appears in the LP. The resulting LP is given below. (after you click.) max z = 3x x 2y 2 - x 3 + x 4 x x 2y 2 + x 3 - x 4 + s 1 = 5 ; 2x x 4y 2 - x 3 - x 4 - s 2 = 1; x 1 0, xy 2 0, 0 s 1 0, s 2 0 7

8 Getting Rid of Variables that are Unconstrained in Sign Next, we ll show you how to get rid of a variable that is unconstrained in sign. That is, it can be positive or negative. Actually, we ll show you two ways. The first way is substitution. For example, x 3 below is unconstrained in sign. (Sometimes we call this a free variable.) Notice that the second constraint can be rewritten as: x 3 = 2x 1-4y 2 - x 4 - s 2-1. Now substitute 2x 1-4y 2 - x 4 - s 2-1 for x 3 into the current linear program. Notice that you get an equivalent linear program without x 3. You can see it on the next slide. max z = 3x 1-2y 2 - x 3 + x 4 x 1-2y 2 + x 3 - x 4 + s 1 = 5 ; 2x 1-4y 2 - x 3 - x 4 - s 2 = 1; x 1 0, y 2 0, s 1 0, s 2 0 8

9 Getting Rid of Free Variables by Substitution When we substitute 2x 1-4y 2 - x 4 - s 2-1 for x 3 here is what we get. (Click now.) The variable x 4 is also unconstrained in sign. You can substitute for it as well. After this substitution, all that will remain is an objective function and non-negativity constraints for x 1, y 2, s 1 and s 2. This trick only works for variables that are unconstrained in sign. If you tried eliminating x 1 instead of x 3 by substitution, the optimal solution for the resulting LP would not necessarily satisfy the original constraint x 1 0. So eliminating x 1 in this manner would not create an equivalent LP. max z = 3x 1-2y 2 - x 3 + x 4 x 1-2y 2 + x 3 - x 4 + s 1 = 5 ; 2x 1-4y 2 - x 3 - x 4 - s 2 = 1; x 1 0, y 2 0, s 1 0, s 2 0 max z = 1x 1 + 2y 2 + 2x 4 + s x 1-6y 2-2x 4 + s 1 + s 2 = 5 ; x 1 0, y 2 0, s 1 0, s 2 0 Cathy 9

10 Getting Rid of Free Variables: Version 2 There is an even simpler way of getting rid of free variables. We replace a free variable by the difference of two nonnegative variables. For example, we replace x 3 by y 3 w 3, and require y 3 and w 3 to be non-negative. (Click now.) You can then substitute y 4 w 4 for x 4. After solving this new linear program, we can find the solution to the original linear program. For example, x 3 = y 3 w 3 and x 4 = y 4 w 4. max z = 3x 1-2y 2 - x 3 + x 4 x 1-2y 2 + x 3 - x 4 + s 1 = 5 ; 2x 1-4y 2 - x 3 - x 4 - s 2 = 1; x 1 0, y 2 0, s 1 0, s 2 0 max z = 3x 1-2y 2 - y 3 + w 3 + x 4 x 1-2y 2 + y 3 - w 3 - x 4 + s 1 = 5 ; 2x 1-4y 2 - y 3 + w 3 - x 4 - s 2 = 1; x 1 0, y 2 0, y 3 0, w 3 0, s 1 0, s

11 Getting Rid of Free Variables: Version 2 This doesn t make sense to me. Before we had a variable x 3, and now we have two variables y 3 and w 3. How can two variables be the same as a single variable? It depends on what you mean by the same. Here is what we mean. For every solution to the original LP, there is a solution to the transformed LP with the same objective value. For example, if there is a feasible solution with x 3 = -4, then there is a feasible solution to the transformed problem with the same objective value. In this case, let y 3 = 0 and w 3 = 4. max z = 3x 1-2y 2 - x 3 + x 4 x 1-2y 2 + x 3 - x 4 + s 1 = 5 ; 2x 1-4y 2 - x 3 - x 4 - s 2 = 1; x 1 0, y 2 0, s 1 0, s 2 0 max z = 3x 1-2y 2 - y 3 + w 3 + x 4 x 1-2y 2 + y 3 - w 3 - x 4 + s 1 = 5 ; 2x 1-4y 2 - y 3 + w 3 - x 4 - s 2 = 1; x 1 0, y 2 0, y 3 0, w 3 0, s 1 0, s

12 Similarly, if there is a feasible solution for the transformed problem, then there is a feasible solution for the original problem with the same objective value. For example, if there is a feasible solution with y 3 = 1, and w 3 = 5, then there is a feasible solution for the original problem with the same objective value. In this case, let x 3 = -4. But for every solution to the original problem, there are an infinite number of solutions to the transformed problem. If x 3 = -4, we could have chosen y 3 = 2 and w 3 = 6, or any other solution such that y 3 w 3 = -4. Tom, that s true. But every one of those solutions will still have the same objective function value. In each case - y 3 + w 3 = 4. So, even though the two linear programs differ in some ways, they are equivalent in the most important way. An optimal solution for the original problem can be transformed into an optimal solution for the transformed problem. And an optimal solution for the transformed problem can be transformed into an optimal solution for the original problem. 12

13 Transforming Max to Min We still have one last pair of transformations. We will show you how to transform a maximization problem into a minimization problem, and how to transform a minimization problem into a maximization problem. This is not part of converting to standard form, but it is still useful. We illustrate with our original linear program, which is given below. All you need to know is that if we maximize z, then we are minimizing z, and vice versa. See if you can use this hint to figure out how to change the problem to a minimization problem. Then click to see if you are right. max min z -z = -3x x 2x x 3 x+ 3 - xx 4 4 x 1 + 2x 2 + x 3 - x 4 5 ; -2x 1-4x 2 + x 3 + x 4-1; x 1 0, x 2 0 McGraph 13

14 Here is an example for which you can test out these techniques. Consider the LP to the right. See if you can transform it to standard form, with maximization instead of minimization. To see the new variables, click once. To see the transformed problem, click again. min z = x 1 - x 2 + x 3 x 1 + 2x 2 - x 3 3 Transformations. - x 1 + x 2 + x 3 2 x 1 - x 2 = 10 x 1 0, x 2 0 s 1 = slack variable for 1 st constraint. s 2 = surplus variable for 2 nd constraint. y 2 = - x 2 y 3 - y 4 = x 3. max -z = -x 1 y 2 (y 3 y 4 ) x 1 2y 2 (y 3 y 4 ) + s 1 = 3 - x 1 y 2 + (y 3 y 4 ) - s 2 = 2 x 1 + y 2 = 10 x 1 0, y 2 0, y 3 0, y 4 0, s 1 0, s

15 Last Slide Remember that the major reason we do this is because the simplex method starts with a linear program in standard form. But it turns out that these types of transformation are useful for other types of algorithms too. Perhaps we shall see their usefulness again some time later in this course. Well, that concludes this tutorial on transforming a linear program into standard form. We hope to see you again soon. 15

### Linear Programming Notes V Problem Transformations

Linear Programming Notes V Problem Transformations 1 Introduction Any linear programming problem can be rewritten in either of two standard forms. In the first form, the objective is to maximize, the material

### 15.053/8 February 26, 2013

15.053/8 February 26, 2013 Sensitivity analysis and shadow prices special thanks to Ella, Cathy, McGraph, Nooz, Stan and Tom 1 Quotes of the Day If the facts don't fit the theory, change the facts. --

### Degeneracy in Linear Programming

Degeneracy in Linear Programming I heard that today s tutorial is all about Ellen DeGeneres Sorry, Stan. But the topic is just as interesting. It s about degeneracy in Linear Programming. Degeneracy? Students

### value is determined is called constraints. It can be either a linear equation or inequality.

Contents 1. Index 2. Introduction 3. Syntax 4. Explanation of Simplex Algorithm Index Objective function the function to be maximized or minimized is called objective function. E.g. max z = 2x + 3y Constraints

### Objective Function Coefficients and Range of Optimality If c k changes to values outside the range of optimality, a new c j - z j row may be generated

Chapter 5 Simplex-Based Sensitivity Analysis and Duality Sensitivity Analysis with the Simplex Tableau Duality 1 Objective Function Coefficients and Range of Optimality The range of optimality for an objective

### Basic Components of an LP:

1 Linear Programming Optimization is an important and fascinating area of management science and operations research. It helps to do less work, but gain more. Linear programming (LP) is a central topic

### Lecture 4 Linear Programming Models: Standard Form. August 31, 2009

Linear Programming Models: Standard Form August 31, 2009 Outline: Lecture 4 Standard form LP Transforming the LP problem to standard form Basic solutions of standard LP problem Operations Research Methods

### Chapter 6. Linear Programming: The Simplex Method. Introduction to the Big M Method. Section 4 Maximization and Minimization with Problem Constraints

Chapter 6 Linear Programming: The Simplex Method Introduction to the Big M Method In this section, we will present a generalized version of the simplex method that t will solve both maximization i and

### Section Notes 4. Duality, Sensitivity, Dual Simplex, Complementary Slackness. Applied Math 121. Week of February 28, 2011

Section Notes 4 Duality, Sensitivity, Dual Simplex, Complementary Slackness Applied Math 121 Week of February 28, 2011 Goals for the week understand the relationship between primal and dual programs. know

### SUPPLEMENT TO CHAPTER

SUPPLEMENT TO CHAPTER 6 Linear Programming SUPPLEMENT OUTLINE Introduction and Linear Programming Model, 2 Graphical Solution Method, 5 Computer Solutions, 14 Sensitivity Analysis, 17 Key Terms, 22 Solved

### Math 407A: Linear Optimization

Math 407A: Linear Optimization Lecture 4: LP Standard Form 1 1 Author: James Burke, University of Washington LPs in Standard Form Minimization maximization Linear equations to linear inequalities Lower

### 1 Solving LPs: The Simplex Algorithm of George Dantzig

Solving LPs: The Simplex Algorithm of George Dantzig. Simplex Pivoting: Dictionary Format We illustrate a general solution procedure, called the simplex algorithm, by implementing it on a very simple example.

### Linear Programming. Solving LP Models Using MS Excel, 18

SUPPLEMENT TO CHAPTER SIX Linear Programming SUPPLEMENT OUTLINE Introduction, 2 Linear Programming Models, 2 Model Formulation, 4 Graphical Linear Programming, 5 Outline of Graphical Procedure, 5 Plotting

### Special Situations in the Simplex Algorithm

Special Situations in the Simplex Algorithm Degeneracy Consider the linear program: Maximize 2x 1 +x 2 Subject to: 4x 1 +3x 2 12 (1) 4x 1 +x 2 8 (2) 4x 1 +2x 2 8 (3) x 1, x 2 0. We will first apply the

### Chapter 15 Introduction to Linear Programming

Chapter 15 Introduction to Linear Programming An Introduction to Optimization Spring, 2014 Wei-Ta Chu 1 Brief History of Linear Programming The goal of linear programming is to determine the values of

### Simplex Method. Introduction:

Introduction: In the previous chapter, we discussed about the graphical method for solving linear programming problems. Although the graphical method is an invaluable aid to understand the properties of

### 4.4 The Simplex Method: Non-Standard Form

4.4 The Simplex Method: Non-Standard Form Standard form and what can be relaxed What were the conditions for standard form we have been adhering to? Standard form and what can be relaxed What were the

### LECTURE 5: DUALITY AND SENSITIVITY ANALYSIS. 1. Dual linear program 2. Duality theory 3. Sensitivity analysis 4. Dual simplex method

LECTURE 5: DUALITY AND SENSITIVITY ANALYSIS 1. Dual linear program 2. Duality theory 3. Sensitivity analysis 4. Dual simplex method Introduction to dual linear program Given a constraint matrix A, right

### Linear Programming with Post-Optimality Analyses

Linear Programming with Post-Optimality Analyses Wilson Problem: Wilson Manufacturing produces both baseballs and softballs, which it wholesales to vendors around the country. Its facilities permit the

### Linear Programming. March 14, 2014

Linear Programming March 1, 01 Parts of this introduction to linear programming were adapted from Chapter 9 of Introduction to Algorithms, Second Edition, by Cormen, Leiserson, Rivest and Stein [1]. 1

### The Graphical Simplex Method: An Example

The Graphical Simplex Method: An Example Consider the following linear program: Max 4x 1 +3x Subject to: x 1 +3x 6 (1) 3x 1 +x 3 () x 5 (3) x 1 +x 4 (4) x 1, x 0. Goal: produce a pair of x 1 and x that

### Graphical method. plane. (for max) and down (for min) until it touches the set of feasible solutions. Graphical method

The graphical method of solving linear programming problems can be applied to models with two decision variables. This method consists of two steps (see also the first lecture): 1 Draw the set of feasible

### Chapter 5: Solving General Linear Programs

Chapter 5: Solving General Linear Programs So far we have concentrated on linear programs that are in standard form, which have a maximization objective, all constraints of type, all of the right hand

### Definition of a Linear Program

Definition of a Linear Program Definition: A function f(x 1, x,..., x n ) of x 1, x,..., x n is a linear function if and only if for some set of constants c 1, c,..., c n, f(x 1, x,..., x n ) = c 1 x 1

### Quiz 1 Sample Questions IE406 Introduction to Mathematical Programming Dr. Ralphs

Quiz 1 Sample Questions IE406 Introduction to Mathematical Programming Dr. Ralphs These questions are from previous years and should you give you some idea of what to expect on Quiz 1. 1. Consider the

### 7.4 Linear Programming: The Simplex Method

7.4 Linear Programming: The Simplex Method For linear programming problems with more than two variables, the graphical method is usually impossible, so the simplex method is used. Because the simplex method

### Chap 4 The Simplex Method

The Essence of the Simplex Method Recall the Wyndor problem Max Z = 3x 1 + 5x 2 S.T. x 1 4 2x 2 12 3x 1 + 2x 2 18 x 1, x 2 0 Chap 4 The Simplex Method 8 corner point solutions. 5 out of them are CPF solutions.

### Linear Inequalities and Linear Programming. Systems of Linear Inequalities in Two Variables

Linear Inequalities and Linear Programming 5.1 Systems of Linear Inequalities 5.2 Linear Programming Geometric Approach 5.3 Geometric Introduction to Simplex Method 5.4 Maximization with constraints 5.5

### The Simplex Method. What happens when we need more decision variables and more problem constraints?

The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving two decision variables and relatively few problem

### LINEAR PROGRAMMING P V Ram B. Sc., ACA, ACMA Hyderabad

LINEAR PROGRAMMING P V Ram B. Sc., ACA, ACMA 98481 85073 Hyderabad Page 1 of 19 Question: Explain LPP. Answer: Linear programming is a mathematical technique for determining the optimal allocation of resources

### Lecture notes 1: Introduction to linear and (mixed) integer programs

Lecture notes 1: Introduction to linear and (mixed) integer programs Vincent Conitzer 1 An example We will start with a simple example. Suppose we are in the business of selling reproductions of two different

### Chapter 2 Solving Linear Programs

Chapter 2 Solving Linear Programs Companion slides of Applied Mathematical Programming by Bradley, Hax, and Magnanti (Addison-Wesley, 1977) prepared by José Fernando Oliveira Maria Antónia Carravilla A

### Linear Programming I

Linear Programming I November 30, 2003 1 Introduction In the VCR/guns/nuclear bombs/napkins/star wars/professors/butter/mice problem, the benevolent dictator, Bigus Piguinus, of south Antarctica penguins

### CHAPTER 17. Linear Programming: Simplex Method

CHAPTER 17 Linear Programming: Simplex Method CONTENTS 17.1 AN ALGEBRAIC OVERVIEW OF THE SIMPLEX METHOD Algebraic Properties of the Simplex Method Determining a Basic Solution Basic Feasible Solution 17.2

### Linear Programming Notes VII Sensitivity Analysis

Linear Programming Notes VII Sensitivity Analysis 1 Introduction When you use a mathematical model to describe reality you must make approximations. The world is more complicated than the kinds of optimization

### Linear Programming. April 12, 2005

Linear Programming April 1, 005 Parts of this were adapted from Chapter 9 of i Introduction to Algorithms (Second Edition) /i by Cormen, Leiserson, Rivest and Stein. 1 What is linear programming? The first

### LINEAR PROGRAMMING THE SIMPLEX METHOD

LINEAR PROGRAMMING THE SIMPLE METHOD () Problems involving both slack and surplus variables A linear programming model has to be extended to comply with the requirements of the simplex procedure, that

### Fundamentals of Operations Research Prof.G. Srinivasan Department of Management Studies Lecture No. # 03 Indian Institute of Technology, Madras

Fundamentals of Operations Research Prof.G. Srinivasan Department of Management Studies Lecture No. # 03 Indian Institute of Technology, Madras Linear Programming solutions - Graphical and Algebraic Methods

### Linear Programming: Chapter 5 Duality

Linear Programming: Chapter 5 Duality Robert J. Vanderbei October 17, 2007 Operations Research and Financial Engineering Princeton University Princeton, NJ 08544 http://www.princeton.edu/ rvdb Resource

### Linear Programming Problems

Linear Programming Problems Linear programming problems come up in many applications. In a linear programming problem, we have a function, called the objective function, which depends linearly on a number

### Lecture 3. Linear Programming. 3B1B Optimization Michaelmas 2015 A. Zisserman. Extreme solutions. Simplex method. Interior point method

Lecture 3 3B1B Optimization Michaelmas 2015 A. Zisserman Linear Programming Extreme solutions Simplex method Interior point method Integer programming and relaxation The Optimization Tree Linear Programming

### max cx s.t. Ax c where the matrix A, cost vector c and right hand side b are given and x is a vector of variables. For this example we have x

Linear Programming Linear programming refers to problems stated as maximization or minimization of a linear function subject to constraints that are linear equalities and inequalities. Although the study

### THEORY OF SIMPLEX METHOD

Chapter THEORY OF SIMPLEX METHOD Mathematical Programming Problems A mathematical programming problem is an optimization problem of finding the values of the unknown variables x, x,, x n that maximize

### What is Linear Programming?

Chapter 1 What is Linear Programming? An optimization problem usually has three essential ingredients: a variable vector x consisting of a set of unknowns to be determined, an objective function of x to

### Guide to SRW Section 1.7: Solving inequalities

Guide to SRW Section 1.7: Solving inequalities When you solve the equation x 2 = 9, the answer is written as two very simple equations: x = 3 (or) x = 3 The diagram of the solution is -6-5 -4-3 -2-1 0

### 3. Evaluate the objective function at each vertex. Put the vertices into a table: Vertex P=3x+2y (0, 0) 0 min (0, 5) 10 (15, 0) 45 (12, 2) 40 Max

SOLUTION OF LINEAR PROGRAMMING PROBLEMS THEOREM 1 If a linear programming problem has a solution, then it must occur at a vertex, or corner point, of the feasible set, S, associated with the problem. Furthermore,

### By W.E. Diewert. July, Linear programming problems are important for a number of reasons:

APPLIED ECONOMICS By W.E. Diewert. July, 3. Chapter : Linear Programming. Introduction The theory of linear programming provides a good introduction to the study of constrained maximization (and minimization)

### Section Notes 3. The Simplex Algorithm. Applied Math 121. Week of February 14, 2011

Section Notes 3 The Simplex Algorithm Applied Math 121 Week of February 14, 2011 Goals for the week understand how to get from an LP to a simplex tableau. be familiar with reduced costs, optimal solutions,

### 3.1 Solving Systems Using Tables and Graphs

Algebra 2 Chapter 3 3.1 Solve Systems Using Tables & Graphs 3.1 Solving Systems Using Tables and Graphs A solution to a system of linear equations is an that makes all of the equations. To solve a system

### EXCEL SOLVER TUTORIAL

ENGR62/MS&E111 Autumn 2003 2004 Prof. Ben Van Roy October 1, 2003 EXCEL SOLVER TUTORIAL This tutorial will introduce you to some essential features of Excel and its plug-in, Solver, that we will be using

### The Canonical and Dictionary Forms of Linear Programs

The Canonical and Dictionary Forms of Linear Programs Recall the general optimization problem: Minimize f(x) subect to x D (1) The real valued function f is called the obective function, and D the constraint

### Linear Programming, Lagrange Multipliers, and Duality Geoff Gordon

lp.nb 1 Linear Programming, Lagrange Multipliers, and Duality Geoff Gordon lp.nb 2 Overview This is a tutorial about some interesting math and geometry connected with constrained optimization. It is not

### Chapter 1 Linear Programming. Paragraph 2 Developing Ideas for an Algorithm solving Linear Optimization

Chapter 1 Linear Programming Paragraph 2 Developing Ideas for an Algorithm solving Linear Optimization What we did so far How to model an optimization problem Data, Variables, Constraints, Objective We

### 5 2x 3y= 9 4x+7y=56. 3x+4y=16 4x 7y= x

Systems of Inequalities 1 Given system of inequalities of the form Ax b Goals: determine if system has an integer solution enumerate all integer solutions 2 bounds for x: (2) and (3) Upper bounds for x:

### EQUATIONS. Main Overarching Questions: 1. What is a variable and what does it represent?

EQUATIONS Introduction to Variables, Algebraic Expressions, and Equations (2 days) Overview of Objectives, students should be able to: Main Overarching Questions: 1. Evaluate algebraic expressions given

### Mathematics Notes for Class 12 chapter 12. Linear Programming

1 P a g e Mathematics Notes for Class 12 chapter 12. Linear Programming Linear Programming It is an important optimization (maximization or minimization) technique used in decision making is business and

### Linear Programming Models: Graphical and Computer Methods

Linear Programming Models: Graphical and Computer Methods Learning Objectives Students will be able to: 1. Understand the basic assumptions and properties of linear programming (LP). 2. Graphically solve

### LINEAR PROGRAMMING: MODEL FORMULATION AND 2-1

LINEAR PROGRAMMING: MODEL FORMULATION AND GRAPHICAL SOLUTION 2-1 Chapter Topics Model Formulation A Maximization Model Example Graphical Solutions of Linear Programming Models A Minimization Model Example

### Linear Programming: Introduction

Linear Programming: Introduction Frédéric Giroire F. Giroire LP - Introduction 1/28 Course Schedule Session 1: Introduction to optimization. Modelling and Solving simple problems. Modelling combinatorial

### Linear Programming. Widget Factory Example. Linear Programming: Standard Form. Widget Factory Example: Continued.

Linear Programming Widget Factory Example Learning Goals. Introduce Linear Programming Problems. Widget Example, Graphical Solution. Basic Theory:, Vertices, Existence of Solutions. Equivalent formulations.

### Lecture 1: Linear Programming Models. Readings: Chapter 1; Chapter 2, Sections 1&2

Lecture 1: Linear Programming Models Readings: Chapter 1; Chapter 2, Sections 1&2 1 Optimization Problems Managers, planners, scientists, etc., are repeatedly faced with complex and dynamic systems which

### Study Resources For Algebra I. Unit 1D Systems of Equations and Inequalities

Study Resources For Algebra I Unit 1D Systems of Equations and Inequalities This unit explores systems of linear functions and the various methods used to determine the solution for the system. Information

### 56:171. Operations Research -- Sample Homework Assignments Fall 1992 Dennis Bricker Dept. of Industrial Engineering University of Iowa.

56:171 Operations Research -- Sample Homework Assignments Fall 1992 Dennis Bricker Dept. of Industrial Engineering University of Iowa Homework #1 (1.) Linear Programming Model Formulation. SunCo processes

### Solving Linear Programs

Solving Linear Programs 2 In this chapter, we present a systematic procedure for solving linear programs. This procedure, called the simplex method, proceeds by moving from one feasible solution to another,

### Math 265 (Butler) Practice Midterm II B (Solutions)

Math 265 (Butler) Practice Midterm II B (Solutions) 1. Find (x 0, y 0 ) so that the plane tangent to the surface z f(x, y) x 2 + 3xy y 2 at ( x 0, y 0, f(x 0, y 0 ) ) is parallel to the plane 16x 2y 2z

### Theory of Linear Programming

Theory of Linear Programming Debasis Mishra April 6, 2011 1 Introduction Optimization of a function f over a set S involves finding the maximum (minimum) value of f (objective function) in the set S (feasible

### Lecture 2: August 29. Linear Programming (part I)

10-725: Convex Optimization Fall 2013 Lecture 2: August 29 Lecturer: Barnabás Póczos Scribes: Samrachana Adhikari, Mattia Ciollaro, Fabrizio Lecci Note: LaTeX template courtesy of UC Berkeley EECS dept.

### Practice Math Placement Exam

Practice Math Placement Exam The following are problems like those on the Mansfield University Math Placement Exam. You must pass this test or take MA 0090 before taking any mathematics courses. 1. What

### 3.5 Reduction to Standard Form

3.5 Reduction to Standard Form 77 Exercise 3-4-4. Read the following statements carefully to see whether it is true or false. Justify your answer by constructing a simple illustrative example (for false),

### I. Solving Linear Programs by the Simplex Method

Optimization Methods Draft of August 26, 2005 I. Solving Linear Programs by the Simplex Method Robert Fourer Department of Industrial Engineering and Management Sciences Northwestern University Evanston,

### The variable λ is a dummy variable called a Lagrange multiplier ; we only really care about the values of x, y, and z.

Math a Lagrange Multipliers Spring, 009 The method of Lagrange multipliers allows us to maximize or minimize functions with the constraint that we only consider points on a certain surface To find critical

### Section 7.1 Solving Linear Systems by Graphing. System of Linear Equations: Two or more equations in the same variables, also called a.

Algebra 1 Chapter 7 Notes Name Section 7.1 Solving Linear Systems by Graphing System of Linear Equations: Two or more equations in the same variables, also called a. Solution of a System of Linear Equations:

### Practical Guide to the Simplex Method of Linear Programming

Practical Guide to the Simplex Method of Linear Programming Marcel Oliver Revised: April, 0 The basic steps of the simplex algorithm Step : Write the linear programming problem in standard form Linear

### What does the number m in y = mx + b measure? To find out, suppose (x 1, y 1 ) and (x 2, y 2 ) are two points on the graph of y = mx + b.

PRIMARY CONTENT MODULE Algebra - Linear Equations & Inequalities T-37/H-37 What does the number m in y = mx + b measure? To find out, suppose (x 1, y 1 ) and (x 2, y 2 ) are two points on the graph of

### SOLVING LINEAR SYSTEM OF INEQUALITIES WITH APPLICATION TO LINEAR PROGRAMS

SOLVING LINEAR SYSTEM OF INEQUALITIES WITH APPLICATION TO LINEAR PROGRAMS Hossein Arsham, University of Baltimore, (410) 837-5268, harsham@ubalt.edu Veena Adlakha, University of Baltimore, (410) 837-4969,

### The Transportation Problem: LP Formulations

The Transportation Problem: LP Formulations An LP Formulation Suppose a company has m warehouses and n retail outlets A single product is to be shipped from the warehouses to the outlets Each warehouse

### is redundant. If you satisfy the other four constraints, then you automatically satisfy x 1 0. (In fact, if the first two constraints hold, then x 1 m

Linear Programming Notes II: Graphical Solutions 1 Graphing Linear Inequalities in the Plane You can solve linear programming problems involving just two variables by drawing a picture. The method works

### LECTURE: INTRO TO LINEAR PROGRAMMING AND THE SIMPLEX METHOD, KEVIN ROSS MARCH 31, 2005

LECTURE: INTRO TO LINEAR PROGRAMMING AND THE SIMPLEX METHOD, KEVIN ROSS MARCH 31, 2005 DAVID L. BERNICK dbernick@soe.ucsc.edu 1. Overview Typical Linear Programming problems Standard form and converting

### Simplex method summary

Simplex method summary Problem: optimize a linear objective, subject to linear constraints 1. Step 1: Convert to standard form: variables on right-hand side, positive constant on left slack variables for

### LINEAR PROGRAMMING MODULE Part 2 - Solution Algorithm

LINEAR PROGRAMMING MODULE Part 2 - Solution Algorithm Name: THE SIMPLEX SOLUTION METHOD It should be obvious to the reader by now that the graphical method for solving linear programs is limited to models

### Outline. Linear Programming (LP): Simplex Search. Simplex: An Extreme-Point Search Algorithm. Basic Solutions

Outline Linear Programming (LP): Simplex Search Benoît Chachuat McMaster University Department of Chemical Engineering ChE 4G03: Optimization in Chemical Engineering 1 Basic Solutions

### 3 Does the Simplex Algorithm Work?

Does the Simplex Algorithm Work? In this section we carefully examine the simplex algorithm introduced in the previous chapter. Our goal is to either prove that it works, or to determine those circumstances

### EdExcel Decision Mathematics 1

EdExcel Decision Mathematics 1 Linear Programming Section 1: Formulating and solving graphically Notes and Examples These notes contain subsections on: Formulating LP problems Solving LP problems Minimisation

### The Simplex Solution Method

Module A The Simplex Solution Method A-1 A-2 Module A The Simplex Solution Method The simplex method is a general mathematical solution technique for solving linear programming problems. In the simplex

### Duality in Linear Programming

Duality in Linear Programming 4 In the preceding chapter on sensitivity analysis, we saw that the shadow-price interpretation of the optimal simplex multipliers is a very useful concept. First, these shadow

### Equations and Inequalities

Rational Equations Overview of Objectives, students should be able to: 1. Solve rational equations with variables in the denominators.. Recognize identities, conditional equations, and inconsistent equations.

### 4.6 Linear Programming duality

4.6 Linear Programming duality To any minimization (maximization) LP we can associate a closely related maximization (minimization) LP. Different spaces and objective functions but in general same optimal

### Mathematical finance and linear programming (optimization)

Mathematical finance and linear programming (optimization) Geir Dahl September 15, 2009 1 Introduction The purpose of this short note is to explain how linear programming (LP) (=linear optimization) may

### OPRE 6201 : 2. Simplex Method

OPRE 6201 : 2. Simplex Method 1 The Graphical Method: An Example Consider the following linear program: Max 4x 1 +3x 2 Subject to: 2x 1 +3x 2 6 (1) 3x 1 +2x 2 3 (2) 2x 2 5 (3) 2x 1 +x 2 4 (4) x 1, x 2

### Linear functions Increasing Linear Functions. Decreasing Linear Functions

3.5 Increasing, Decreasing, Max, and Min So far we have been describing graphs using quantitative information. That s just a fancy way to say that we ve been using numbers. Specifically, we have described

### Algebraic Simplex Method - Introduction Previous

Algebraic Simplex Method - Introduction To demonstrate the simplex method, consider the following linear programming model: This is the model for Leo Coco's problem presented in the demo, Graphical Method.

### Duration Must be Job (weeks) Preceeded by

1. Project Scheduling. This problem deals with the creation of a project schedule; specifically, the project of building a house. The project has been divided into a set of jobs. The problem is to schedule

### Nonlinear Programming Methods.S2 Quadratic Programming

Nonlinear Programming Methods.S2 Quadratic Programming Operations Research Models and Methods Paul A. Jensen and Jonathan F. Bard A linearly constrained optimization problem with a quadratic objective

### Linear Programming for Optimization. Mark A. Schulze, Ph.D. Perceptive Scientific Instruments, Inc.

1. Introduction Linear Programming for Optimization Mark A. Schulze, Ph.D. Perceptive Scientific Instruments, Inc. 1.1 Definition Linear programming is the name of a branch of applied mathematics that

### Support Vector Machine (SVM)

Support Vector Machine (SVM) CE-725: Statistical Pattern Recognition Sharif University of Technology Spring 2013 Soleymani Outline Margin concept Hard-Margin SVM Soft-Margin SVM Dual Problems of Hard-Margin

### Linear Programming I: Maximization 2009 Samuel L. Baker Assignment 10 is on the last page.

LINEAR PROGRAMMING I 1 Learning objectives: Linear Programming I: Maximization 2009 Samuel L. Baker Assignment 10 is on the last page. 1. Recognize problems that linear programming can handle. 2. Know

### 1 Polyhedra and Linear Programming

CS 598CSC: Combinatorial Optimization Lecture date: January 21, 2009 Instructor: Chandra Chekuri Scribe: Sungjin Im 1 Polyhedra and Linear Programming In this lecture, we will cover some basic material