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


 Annice Jade Mitchell
 1 years ago
 Views:
Transcription
1 Lecture 1: Linear Programming Models Readings: Chapter 1; Chapter 2, Sections 1&2 1
2 Optimization Problems Managers, planners, scientists, etc., are repeatedly faced with complex and dynamic systems which they have to manage or control in order to realize certain goals. These systems have the following properties in common: decision variables representing the options and operating levels the decisionmaker can control in order to drive the behavior of the system; constraints limiting the range of control the decisionmaker has on the decision variables; an objective that measures how well the system is operating with regard to the goals of the decision maker. 2
3 Mathematical Programs Mathematical programs are simply the presentation of an optimization problem in a mathematically precise form. The general description of a mathematical program is of the form where (MP ) max min x X f(x) x is the set of decision variables, which can be represented by numerical values, sets, functions, etc. X represents the feasible region describing the constraints on the decision variables. Feasible regions are usually described by giving equalities and inequalities involving functions of the decision variables. Any point x X is called a feasible solution to the problem. f represents the objective function, a function of the variable values that one wishes to maximize or minimize. 3
4 Solving Mathematical Programs The goal of solving a mathematical program (MP ) is to find an optimal solution to the problem, that is, an assignment x of values to the decision variables x in such a way that (i) x is feasible to (MP ); (ii) x has the best objective function value for (MP ) in the sense that any other feasible solution x to (MP ) has f(x) f(x ) (for a max problem) f(x) f(x ) (for a min problem) Questions Associated with Solving Mathematical Programs: What are properties of the feasible region X, and its description, that help us in finding feasible and optimal solutions to (MP )? What conditions can we give to show that a given solution x is optimal to (MP )? What computational methods are available to find feasible and optimal solutions to (MP )? What is the relationship between the parameters describing (M P ) and the associated optimal solutions? How sensitive are the solutions to the accuracy of the description of (MP )? 4
5 Woody s Problem: A Resource Allocation Model Woody s Furniture Company makes chairs and tables. Chairs are made entirely out of pine, and require 8 linear feet of pine per chair. Tables are made of pine and mahogany, with tables requiring 12 linear feet of pine and 15 linear feet of mahogany. Chairs require 3 hours of labor to produce and tables require 6 hours of labor. Chairs provide $35 profit and tables provide $60 profit. Woody has 120 linear feet of pine and 60 linear feet of mahogany delivered each day, and has a work force of 6 carpenters each of whom put in an 8hour day. How should Woody use his resources to provide the largest daily profits? The mathematical program: x 1 = chairs per day, x 2 = tables per day, max z = 35x x 2 profits 8x x pine 15x 2 60 mahogany 3x 1 + 6x 2 48 labor x 1 0 x 2 0 nonnegativity constraints 5
6 Linear Programming Models Each of the models above are examples of linear programs. Linear programs are characterized by the following properties: optimization problem/mathematical program: The problem involves finding the best value for a given objective, subject to a given set of constraints. deterministic: The behavior of the model is completely determined, that is, there is no probability contributing to the objective or constraints. proportionality: Each variable contributes in direct proportion to its value. additivity: The variables in the objective and each constraint contribute the sum of the contributions of each variable. divisibility: The variables can take on continuous values subject to the constraints. Any function satisfying the proportionality and additivity properties is called a linear function, and will always have the form f(x 1,..., x n ) = a 1 x a n x n ( + d). 6
7 Examples of Situations violating the LP Assumptions nonproportionality: fixed charges or volume discounting ( $2000 to set the printer up, and $.15 per each copy made, $100 for the first 50 copies, $1 for each copy thereafter ) nonadditivity: distances from a point (x, y) in the plane to given point (a, b): (x a)2 + (y b) 2 (this is nonproportional as well). Volumes and square footage (in terms of dimension) are also nonadditive (but are proportional). nondivisibility: integer/binary programs ( How many aircraft to be made?, Should a new plant be built or not?, must be made in lots of 5 ) 7
8 max min The Mathematical Description z = c 1x 1 + c 2 x c n x n a i1 x 1 + a i2 x a in x n = b i i = 1,..., m x j 0 unrestricted, ( 0) j = 1,..., n x j are the variables of the problem, and are allowed to take on any set of real values that satisfy the constraints. c j, b i, and a ij are parameters of the problem, and (along with dimensions n, m, and objective/row/variable types) provide the precise description of a particular instance of the LP model that you wish to solve. c j are the objective/cost/profit coefficients. b i are the righthandside/resource/demand coefficients. a ij are the proportionality/production/activity coefficients or coefficients of variation. 8
9 LP forms There are several specific LP forms that will useful for various purposes. The first is the standard (equality form) max LP: max z = c 1 x 1 + c 2 x c n x n a 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1. + a 22 x a 2n x n =. b 2 a m1 x 1 + a m2 x a mn x n = b m x 1 0 x x n 0. Also useful is the inequality max LP: max z = c 1 x 1 + c 2 x c n x n a 11 x 1 + a 12 x a 1n x n b 1 a 21 x 1. + a 22 x a 2n x n. b 2 a m1 x 1 + a m2 x a mn x n b m 9
10 The Canonical Max and Min Problems There are also two symmetric related LPs, the canonical max and min LPs, that play an important role in duality theory: Canonical Max LP: max z = c 1 x 1 + c 2 x c n x n a 11 x 1 + a 12 x a 1n x n b 1 a 21 x 1. + a 22 x a 2n x n. b 2 a m1 x 1 + a m2 x a mn x n b m x 1 0 x x n 0. Canonical Min LP: min z = c 1 x 1 + c 2 x c n x n a 11 x 1 + a 12 x a 1n x n b 1 a 21 x 1. + a 22 x a 2n x n. b 2 a m1 x 1 + a m2 x a mn x n b m x 1 0 x x n 0. 10
11 Definitions and Issues feasible solution: A specific set of values of the variables that satisfy the constraints of that instance. feasible region: The set of all feasible solutions for that instance. optimal solution: Any feasible solution whose objective function value is the greatest (for a max problem) or smallest (for a min problem) of all points in the feasible region. Some issues: Does a particular instance of an LP have any feasible point? Does the instance have an optimal solution? How can we describe the feasible region? What properties does it have? How will we know that a solution to a particular instance is in fact an optimal solution for that instance? Can we give an algorithm to find feasible/optimal solutions for any instance of an LP, or to determine that none exist for that instance? How efficient is that algorithm, particularly for solving large LP instances? 11
12 A Graphical View of LPs We can gain insight into the dynamics of LPs by looking at 2variable problems. Consider Woody s problem written in inequality max form: max z = 35x x 2 8x x x x 1 + 6x 2 48 x 1 0 x 2 0 Draw a picture of this LP, by performing the following steps: 1. Take each of the constraints (including the nonnegativity constraints), and draw the line describing the associated equality. 2. Determine which side of each equality line satisfies the inequality constraint. The feasible region is set of points which lie on the correct side of all of the equality lines. 3. For particular objective function value z 0, the isocost line (or level set) at value z 0 is described by the equality line c 1 x 1 + c 2 x 2 = z Slide this isocost line parallel and in the direction of improving objective value until the last point at which it still intersects the feasible region. 5. Any feasible point in this final intersection is an optimal solution. 12
13 Example max z = 35x x 2 (C1) 8x x (C2) 15x 2 60 (C3) 3x 1 + 6x 2 48 x 1 0 x x C2 C3 0 1 C1 x
14 Special subsets of the feasible region interior: set of points having neighborhoods that lie entirely in the feasible region. Equivalently, an interior point is one that satisfies all inequalities strictly. boundary: set of feasible points not in the interior, that is, which satisfy one or more inequalities at equality extreme point/corner point/vertex: boundary point lying on n equalities, where n = the dimension of the problem. LP types optimal solution: one can find a feasible solution for which no other solution has a better objective function value. infeasible LP: the constraints of the problem are such that the feasible region is empty, in other words, there is no feasible solution. unbounded LP: (maximization problem) the objective and constraints of the problem are such that there is no upper bound on the objective function values of the feasible points. That is, for every feasible solution there exists another feasible solution with larger objective function value. (A symmetric definition applies for minimization problems.) 14
15 Three Types of Linear Programs Optimal Solution max z = 35x x 2 (C1) 8x x (C2) 15x 2 60 (C3) 3x 1 + 6x 2 48 x 1 0 x x C2 C3 0 1 C1 x
16 Infeasible LP max z = 35x x 2 (C1) 8x x (C2) 15x 2 60 (C3) 3x 1 + 6x 2 48 x 1 0 x x C C3 C1 x
17 Unbounded LP max z = 35x x 2 (C1) 8x x (C2) 20x x 2 60 (C3) 3x 1 6x 2 48 x 1 0 x
18 The Graphical Method in 3Dimensions Consider the Woody s Problem with a third item, say desks, represented by variable x 3, requiring 16 l.f. of pine, 20 l.f. of mahogany, 9 hrs. of labor, and giving a profit of $75: max z = 35x x x 3 8x x x x x x 1 + 6x 2 + 9x 3 48 x 1 0 x 2 0 x 3 0 This also has a graphical representation, now in 3dimensional Euclidean space: 4 x x x
19 The level set is now a flat sheet perpendicular to the objective function vector (35,60,75). Adding this to the picture, we get 10 5 desks 0 tables chairs We can slide this level set to the optimal solution (12,2,0), although this is difficult to conceptualize even in 3 dimensions, and becomes completely unwieldy in higher dimensions. 19
20 Transforming a General LP into Equality Form minimization problems: Replace with min z = c 1 x 1 + c 2 x c n x n max z = z = c 1 x 1 c 2 x 2... c n x n constraints: Add a nonnegative slack variable indicating the difference between the LHS value and the b i value. Specifically, replace with a i1 x 1 + a i2 x a in x n b i a i1 x 1 + a i2 x a in x n + x n+i = b i, x n+i 0 constraints: Subtract the slack variable in that row. Specifically, replace with a i1 x 1 + a i2 x a in x n b i a i1 x 1 + a i2 x a in x n x n+i = b i, x n+i 0 unrestricted variables: Replace unrestricted x i by x i = x + i x i, x + i 0, x i 0 negative variables: Replace x i 0 by x i = x i, x i 0. 20
21 Examples Woody s problem can be put into standard max form by simply adding slack variables to each of the inequalities max z = 35x x 2 8x x 2 + x 3 = x 2 + x 4 = 60 3x 1 + 6x 2 + x 5 = 48 x 1 0 x 2 0 x 3 0 x 4 0 x 5 0 Now consider the following LP: min z = 35x x 2 8x x 2 = x x x 1 6x 2 48 x 1 unrest. x 2 0 Here we subtract a slack in Row 2, add a slack in Row 3, negate the objective function, replace x 1 with x 1 = x + 1 x 1 and replace x 2 by x 2 to get standard max LP max z = 35x x x 2 8x x 1 12x 2 = x x 1 15x 2 x 4 = 60 2x + 1 2x 1 + 6x 2 + x 5 = 48 x x 1 0 x 2 0 x 4 0 x
22 A Statistics Problem You are given a set of sample points ( x 1, ỹ 1 ), ( x 2, ỹ 2 ),..., ( x n, ỹ n ), which are suppose to satisfy a linear equation of the form Y = ax + b. Due to experimental error, they do not simultaneously satisfy the same equation. You want to find the best equation to fit to these sample points. Y (3,10) n=9 (9,7) (3,7) (9,6) (14,3) (6,2) (18,1) X (12,1) (16,2) Y=aX+b 22
23 Criteria for good fit : Each point should be as close to the line Y = ax + b as possible. We will measure this by the vertical distance from ( x i, ỹ i ) to the line Y = ax + b, that is, d i = ỹ i (a x i + b) (Note that this could be positive or negative.) We can measure goodness of fit using the d i in several ways L 1 measure: z = sum of the absolute values of the d i s Chebyshev measure: z = max of the absolute values of the d i s leastsquares measure: z = sum of the squares of the d i s Goal: To minimize the appropriate measure over all possible choices of a and b. 23
24 Formulating the LP for the L 1 Measure The optimization problem has as variables the two numbers a and b describing the linear equation. Once we have these numbers we can compute the d i s by adding the n equations d i = ỹ i (a x i + b), i = 1,..., n. Note that while the x s and ỹ s are parameters, the d i s are now auxiliary variables. The optimization problem can be stated mathematically as: min z = d i + d d n d i = ỹ i (a x i + b), i = 1,..., n a, b, d i unrestricted Although the constraints are linear, the objective function is not. 24
25 Dealing with Unrestricted Variables Each unrestricted variable is now separated into its positive and negative parts: a = a + a b = b + b, and d i = d + i d i i = 1,..., n Added bonus: The absolute value of d i can be written d i = d + i + d i. Thus the objective function can be rewritten min z = d d d + n + d n 25
26 Formulating the LP for the Chebyshev Measure The objective here is min z = max{ d i, d 2,..., d n } = max{d d 1,..., d + n + d n } Again, this is not linear. To formulate it as a linear program, we introduce still another auxiliary variable M, restricting it by the inequalities M d + i + d i, i = 1,..., n or, in equality form, d + i + d i + s i = M, i = 1,..., n where the s i s are the slack variables. Minimizing z = M subject to the above constraints will insure that M will in fact take the value of the maximum of the d i s. 26
27 Formulating the LP for the Leastsquares Measure The objective here can be written min z = d d d 2 n = [ỹ 1 (a x 1 + b)] 2 + [ỹ 2 (a x 2 + b)] [ỹ n (a x n + b)] 2 with no restrictions on the variables a and b. How can we solve this problem? 27
28 Transforming a General LP into Canonical Form We can also transform LPs into canonical max form. The transformations for variable types are the same, and the transformations for constraints are as follows: constraints: Simply negate the constraint. Equality constraints: Replace the constraint a i1 x 1 + a i2 x a in x n = b i with the two constraints and a i1 x 1 + a i2 x a in x n b i a i1 x 1 a i2 x 2... a in x n b i Note that no slack variables are necessary for this transformation. Example: The general form LP given above has equivalent canonical max form max z = 35x x x 2 8x x 1 12x x + 1 8x x x x x x + 1 2x 1 + 6x 2 48 x x 1 0 x
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
More informationLinear 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
More informationLinear 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
More informationWhat 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
More informationLinear 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
More informationLinear 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.
More information3 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
More informationOPRE 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
More informationModule1. x 1000. y 800.
Module1 1 Welcome to the first module of the course. It is indeed an exciting event to share with you the subject that has lot to offer both from theoretical side and practical aspects. To begin with,
More informationLecture 2: August 29. Linear Programming (part I)
10725: 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.
More information4.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
More informationIEOR 4404 Homework #2 Intro OR: Deterministic Models February 14, 2011 Prof. Jay Sethuraman Page 1 of 5. Homework #2
IEOR 4404 Homework # Intro OR: Deterministic Models February 14, 011 Prof. Jay Sethuraman Page 1 of 5 Homework #.1 (a) What is the optimal solution of this problem? Let us consider that x 1, x and x 3
More information1 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.
More informationLinear 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
More informationOperation Research. Module 1. Module 2. Unit 1. Unit 2. Unit 3. Unit 1
Operation Research Module 1 Unit 1 1.1 Origin of Operations Research 1.2 Concept and Definition of OR 1.3 Characteristics of OR 1.4 Applications of OR 1.5 Phases of OR Unit 2 2.1 Introduction to Linear
More informationUsing the Simplex Method to Solve Linear Programming Maximization Problems J. Reeb and S. Leavengood
PERFORMANCE EXCELLENCE IN THE WOOD PRODUCTS INDUSTRY EM 8720E October 1998 $3.00 Using the Simplex Method to Solve Linear Programming Maximization Problems J. Reeb and S. Leavengood A key problem faced
More informationThe Graphical Method: An Example
The Graphical Method: An Example Consider the following linear program: Maximize 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 0, where, for ease of reference,
More informationSensitivity Analysis 3.1 AN EXAMPLE FOR ANALYSIS
Sensitivity Analysis 3 We have already been introduced to sensitivity analysis in Chapter via the geometry of a simple example. We saw that the values of the decision variables and those of the slack and
More information3. 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,
More informationDuality in Linear Programming
Duality in Linear Programming 4 In the preceding chapter on sensitivity analysis, we saw that the shadowprice interpretation of the optimal simplex multipliers is a very useful concept. First, these shadow
More informationLecture 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
More informationLinear Programming Supplement E
Linear Programming Supplement E Linear Programming Linear programming: A technique that is useful for allocating scarce resources among competing demands. Objective function: An expression in linear programming
More informationLinear Programming: Theory and Applications
Linear Programming: Theory and Applications Catherine Lewis May 11, 2008 1 Contents 1 Introduction to Linear Programming 3 1.1 What is a linear program?...................... 3 1.2 Assumptions.............................
More informationChapter 5. Linear Inequalities and Linear Programming. Linear Programming in Two Dimensions: A Geometric Approach
Chapter 5 Linear Programming in Two Dimensions: A Geometric Approach Linear Inequalities and Linear Programming Section 3 Linear Programming gin Two Dimensions: A Geometric Approach In this section, we
More informationLinear 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
More informationDuality of linear conic problems
Duality of linear conic problems Alexander Shapiro and Arkadi Nemirovski Abstract It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least
More informationChapter 2 Solving Linear Programs
Chapter 2 Solving Linear Programs Companion slides of Applied Mathematical Programming by Bradley, Hax, and Magnanti (AddisonWesley, 1977) prepared by José Fernando Oliveira Maria Antónia Carravilla A
More informationLinear 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
More informationSpecial 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
More informationSensitivity Analysis with Excel
Sensitivity Analysis with Excel 1 Lecture Outline Sensitivity Analysis Effects on the Objective Function Value (OFV): Changing the Values of Decision Variables Looking at the Variation in OFV: Excel One
More informationLecture 3: Linear Programming Relaxations and Rounding
Lecture 3: Linear Programming Relaxations and Rounding 1 Approximation Algorithms and Linear Relaxations For the time being, suppose we have a minimization problem. Many times, the problem at hand can
More information5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1
5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1 General Integer Linear Program: (ILP) min c T x Ax b x 0 integer Assumption: A, b integer The integrality condition
More informationStudy Guide 2 Solutions MATH 111
Study Guide 2 Solutions MATH 111 Having read through the sample test, I wanted to warn everyone, that I might consider asking questions involving inequalities, the absolute value function (as in the suggested
More information4 UNIT FOUR: Transportation and Assignment problems
4 UNIT FOUR: Transportation and Assignment problems 4.1 Objectives By the end of this unit you will be able to: formulate special linear programming problems using the transportation model. define a balanced
More informationChapter 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
More informationMathematical 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
More informationChapter 3: Section 33 Solutions of Linear Programming Problems
Chapter 3: Section 33 Solutions of Linear Programming Problems D. S. Malik Creighton University, Omaha, NE D. S. Malik Creighton University, Omaha, NE Chapter () 3: Section 33 Solutions of Linear Programming
More information1 Introduction. Linear Programming. Questions. A general optimization problem is of the form: choose x to. max f(x) subject to x S. where.
Introduction Linear Programming Neil Laws TT 00 A general optimization problem is of the form: choose x to maximise f(x) subject to x S where x = (x,..., x n ) T, f : R n R is the objective function, S
More informationCHAPTER 11: BASIC LINEAR PROGRAMMING CONCEPTS
Linear programming is a mathematical technique for finding optimal solutions to problems that can be expressed using linear equations and inequalities. If a realworld problem can be represented accurately
More informationConverting a Linear Program to Standard Form
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 Linear
More informationPractical 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
More informationOptimization Modeling for Mining Engineers
Optimization Modeling for Mining Engineers Alexandra M. Newman Division of Economics and Business Slide 1 Colorado School of Mines Seminar Outline Linear Programming Integer Linear Programming Slide 2
More informationSolving 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,
More information24. The Branch and Bound Method
24. The Branch and Bound Method It has serious practical consequences if it is known that a combinatorial problem is NPcomplete. Then one can conclude according to the present state of science that no
More informationLecture 2. Marginal Functions, Average Functions, Elasticity, the Marginal Principle, and Constrained Optimization
Lecture 2. Marginal Functions, Average Functions, Elasticity, the Marginal Principle, and Constrained Optimization 2.1. Introduction Suppose that an economic relationship can be described by a realvalued
More informationEdExcel 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
More information(a) We have x = 3 + 2t, y = 2 t, z = 6 so solving for t we get the symmetric equations. x 3 2. = 2 y, z = 6. t 2 2t + 1 = 0,
Name: Solutions to Practice Final. Consider the line r(t) = 3 + t, t, 6. (a) Find symmetric equations for this line. (b) Find the point where the first line r(t) intersects the surface z = x + y. (a) We
More informationSENSITIVITY ANALYSIS AS A MANAGERIAL DECISION
SENSITIVITY ANALYSIS AS A MANAGERIAL DECISION MAKING TOOL SENSITIVITY ANALYSIS AS A MANAGERIAL DECISION MAKING TOOL SUMMARY Martina Briš, B.Sc.(Econ) Faculty of Economics in Osijek 87 Decision making is
More informationInner product. Definition of inner product
Math 20F Linear Algebra Lecture 25 1 Inner product Review: Definition of inner product. Slide 1 Norm and distance. Orthogonal vectors. Orthogonal complement. Orthogonal basis. Definition of inner product
More informationVector and Matrix Norms
Chapter 1 Vector and Matrix Norms 11 Vector Spaces Let F be a field (such as the real numbers, R, or complex numbers, C) with elements called scalars A Vector Space, V, over the field F is a nonempty
More information3. INNER PRODUCT SPACES
. INNER PRODUCT SPACES.. Definition So far we have studied abstract vector spaces. These are a generalisation of the geometric spaces R and R. But these have more structure than just that of a vector space.
More informationNonlinear 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
More information7.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
More informationLinear 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
More information7.1 Modelling the transportation problem
Chapter Transportation Problems.1 Modelling the transportation problem The transportation problem is concerned with finding the minimum cost of transporting a single commodity from a given number of sources
More informationSolving Systems of Linear Equations
LECTURE 5 Solving Systems of Linear Equations Recall that we introduced the notion of matrices as a way of standardizing the expression of systems of linear equations In today s lecture I shall show how
More informationQuestion 2: How do you solve a linear programming problem with a graph?
Question 2: How do you solve a linear programming problem with a graph? Now that we have several linear programming problems, let s look at how we can solve them using the graph of the system of inequalities.
More informationLinear Threshold Units
Linear Threshold Units w x hx (... w n x n w We assume that each feature x j and each weight w j is a real number (we will relax this later) We will study three different algorithms for learning linear
More information! Solve problem to optimality. ! Solve problem in polytime. ! Solve arbitrary instances of the problem. !approximation algorithm.
Approximation Algorithms Chapter Approximation Algorithms Q Suppose I need to solve an NPhard problem What should I do? A Theory says you're unlikely to find a polytime algorithm Must sacrifice one of
More informationTwoStage Stochastic Linear Programs
TwoStage Stochastic Linear Programs Operations Research Anthony Papavasiliou 1 / 27 TwoStage Stochastic Linear Programs 1 Short Reviews Probability Spaces and Random Variables Convex Analysis 2 Deterministic
More information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More information1 Review of Least Squares Solutions to Overdetermined Systems
cs4: introduction to numerical analysis /9/0 Lecture 7: Rectangular Systems and Numerical Integration Instructor: Professor Amos Ron Scribes: Mark Cowlishaw, Nathanael Fillmore Review of Least Squares
More informationOverview. Essential Questions. Precalculus, Quarter 3, Unit 3.4 Arithmetic Operations With Matrices
Arithmetic Operations With Matrices Overview Number of instruction days: 6 8 (1 day = 53 minutes) Content to Be Learned Use matrices to represent and manipulate data. Perform arithmetic operations with
More informationSeveral Views of Support Vector Machines
Several Views of Support Vector Machines Ryan M. Rifkin Honda Research Institute USA, Inc. Human Intention Understanding Group 2007 Tikhonov Regularization We are considering algorithms of the form min
More information2.1 Increasing, Decreasing, and Piecewise Functions; Applications
2.1 Increasing, Decreasing, and Piecewise Functions; Applications Graph functions, looking for intervals on which the function is increasing, decreasing, or constant, and estimate relative maxima and minima.
More informationWe call this set an ndimensional parallelogram (with one vertex 0). We also refer to the vectors x 1,..., x n as the edges of P.
Volumes of parallelograms 1 Chapter 8 Volumes of parallelograms In the present short chapter we are going to discuss the elementary geometrical objects which we call parallelograms. These are going to
More informationLinear Programming in Matrix Form
Linear Programming in Matrix Form Appendix B We first introduce matrix concepts in linear programming by developing a variation of the simplex method called the revised simplex method. This algorithm,
More information! Solve problem to optimality. ! Solve problem in polytime. ! Solve arbitrary instances of the problem. #approximation algorithm.
Approximation Algorithms 11 Approximation Algorithms Q Suppose I need to solve an NPhard problem What should I do? A Theory says you're unlikely to find a polytime algorithm Must sacrifice one of three
More informationPA Common Core Standards Standards for Mathematical Practice Grade Level Emphasis*
Habits of Mind of a Productive Thinker Make sense of problems and persevere in solving them. Attend to precision. PA Common Core Standards The Pennsylvania Common Core Standards cannot be viewed and addressed
More informationActually Doing It! 6. Prove that the regular unit cube (say 1cm=unit) of sufficiently high dimension can fit inside it the whole city of New York.
1: 1. Compute a random 4dimensional polytope P as the convex hull of 10 random points using rand sphere(4,10). Run VISUAL to see a Schlegel diagram. How many 3dimensional polytopes do you see? How many
More informationVocabulary Words and Definitions for Algebra
Name: Period: Vocabulary Words and s for Algebra Absolute Value Additive Inverse Algebraic Expression Ascending Order Associative Property Axis of Symmetry Base Binomial Coefficient Combine Like Terms
More informationChapter 2: Introduction to Linear Programming
Chapter 2: Introduction to Linear Programming You may recall unconstrained optimization from your high school years: the idea is to find the highest point (or perhaps the lowest point) on an objective
More informationNumerical Summarization of Data OPRE 6301
Numerical Summarization of Data OPRE 6301 Motivation... In the previous session, we used graphical techniques to describe data. For example: While this histogram provides useful insight, other interesting
More informationFlorida Department of Education/Office of Assessment January 2012. Grade 7 FCAT 2.0 Mathematics Achievement Level Descriptions
Florida Department of Education/Office of Assessment January 2012 Grade 7 FCAT 2.0 Mathematics Grade 7 FCAT 2.0 Mathematics Reporting Category Geometry and Measurement Students performing at the mastery
More informationUNIT 1 LINEAR PROGRAMMING
OUTLINE Session : Session 2: Session 3: Session 4: Session 5: Session 6: Session 7: Session 8: Session 9: Session 0: Session : Session 2: UNIT LINEAR PROGRAMMING Introduction What is Linear Programming
More informationEXCEL 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 plugin, Solver, that we will be using
More informationCreating, Solving, and Graphing Systems of Linear Equations and Linear Inequalities
Algebra 1, Quarter 2, Unit 2.1 Creating, Solving, and Graphing Systems of Linear Equations and Linear Inequalities Overview Number of instructional days: 15 (1 day = 45 60 minutes) Content to be learned
More informationStandard Form of a Linear Programming Problem
494 CHAPTER 9 LINEAR PROGRAMMING 9. THE SIMPLEX METHOD: MAXIMIZATION For linear programming problems involving two variables, the graphical solution method introduced in Section 9. is convenient. However,
More informationC&O 370 Deterministic OR Models Winter 2011
C&O 370 Deterministic OR Models Winter 2011 Assignment 1 Due date: Friday Jan. 21, 2011 Assignments are due at the start of class on the due date. Write your name and ID# clearly, and underline your last
More informationMathematical Procedures
CHAPTER 6 Mathematical Procedures 168 CHAPTER 6 Mathematical Procedures The multidisciplinary approach to medicine has incorporated a wide variety of mathematical procedures from the fields of physics,
More information. P. 4.3 Basic feasible solutions and vertices of polyhedra. x 1. x 2
4. Basic feasible solutions and vertices of polyhedra Due to the fundamental theorem of Linear Programming, to solve any LP it suffices to consider the vertices (finitely many) of the polyhedron P of the
More informationBX in ( u, v) basis in two ways. On the one hand, AN = u+
1. Let f(x) = 1 x +1. Find f (6) () (the value of the sixth derivative of the function f(x) at zero). Answer: 7. We expand the given function into a Taylor series at the point x = : f(x) = 1 x + x 4 x
More informationProbability and Statistics
CHAPTER 2: RANDOM VARIABLES AND ASSOCIATED FUNCTIONS 2b  0 Probability and Statistics Kristel Van Steen, PhD 2 Montefiore Institute  Systems and Modeling GIGA  Bioinformatics ULg kristel.vansteen@ulg.ac.be
More informationLECTURE: 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
More informationprinceton univ. F 13 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora
princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora Scribe: One of the running themes in this course is the notion of
More informationDiscrete Optimization
Discrete Optimization [Chen, Batson, Dang: Applied integer Programming] Chapter 3 and 4.14.3 by Johan Högdahl and Victoria Svedberg Seminar 2, 20150331 Todays presentation Chapter 3 Transforms using
More informationTransportation Polytopes: a Twenty year Update
Transportation Polytopes: a Twenty year Update Jesús Antonio De Loera University of California, Davis Based on various papers joint with R. Hemmecke, E.Kim, F. Liu, U. Rothblum, F. Santos, S. Onn, R. Yoshida,
More informationCORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREERREADY FOUNDATIONS IN ALGEBRA
We Can Early Learning Curriculum PreK Grades 8 12 INSIDE ALGEBRA, GRADES 8 12 CORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREERREADY FOUNDATIONS IN ALGEBRA April 2016 www.voyagersopris.com Mathematical
More informationStandards for Mathematical Practice: Commentary and Elaborations for 6 8
Standards for Mathematical Practice: Commentary and Elaborations for 6 8 c Illustrative Mathematics 6 May 2014 Suggested citation: Illustrative Mathematics. (2014, May 6). Standards for Mathematical Practice:
More informationLINEAR INEQUALITIES. Mathematics is the art of saying many things in many different ways. MAXWELL
Chapter 6 LINEAR INEQUALITIES 6.1 Introduction Mathematics is the art of saying many things in many different ways. MAXWELL In earlier classes, we have studied equations in one variable and two variables
More informationNo: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics
No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results
More informationArrangements And Duality
Arrangements And Duality 3.1 Introduction 3 Point configurations are tbe most basic structure we study in computational geometry. But what about configurations of more complicated shapes? For example,
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationSolving Systems of Linear Equations
LECTURE 5 Solving Systems of Linear Equations Recall that we introduced the notion of matrices as a way of standardizing the expression of systems of linear equations In today s lecture I shall show how
More informationOverview of Math Standards
Algebra 2 Welcome to math curriculum design maps for Manhattan Ogden USD 383, striving to produce learners who are: Effective Communicators who clearly express ideas and effectively communicate with diverse
More informationAnswer Key for California State Standards: Algebra I
Algebra I: Symbolic reasoning and calculations with symbols are central in algebra. Through the study of algebra, a student develops an understanding of the symbolic language of mathematics and the sciences.
More informationVector Spaces II: Finite Dimensional Linear Algebra 1
John Nachbar September 2, 2014 Vector Spaces II: Finite Dimensional Linear Algebra 1 1 Definitions and Basic Theorems. For basic properties and notation for R N, see the notes Vector Spaces I. Definition
More informationOptimization in ICT and Physical Systems
27. OKTOBER 2010 in ICT and Physical Systems @ Aarhus University, Course outline, formal stuff Prerequisite Lectures Homework Textbook, Homepage and CampusNet, http://kurser.iha.dk/eeictmaster/tiopti/
More informationSession 7 Bivariate Data and Analysis
Session 7 Bivariate Data and Analysis Key Terms for This Session Previously Introduced mean standard deviation New in This Session association bivariate analysis contingency table covariation least squares
More informationRegression Using Support Vector Machines: Basic Foundations
Regression Using Support Vector Machines: Basic Foundations Technical Report December 2004 Aly Farag and Refaat M Mohamed Computer Vision and Image Processing Laboratory Electrical and Computer Engineering
More information