9.4 THE SIMPLEX METHOD: MINIMIZATION


 Lucy Payne
 1 years ago
 Views:
Transcription
1 SECTION 9 THE SIMPLEX METHOD: MINIMIZATION 59 The accounting firm in Exercise raises its charge for an audit to $5 What number of audits and tax returns will bring in a maximum revenue? In the simplex method, it may happen that in selecting the departing variable all the calculated ratios are negative This indicates an unbounded solution Demonstrate this in Exercises and Maximize) Maximize) Objective function: Objective function: z x x z x x x x x x x x x x 5 x, x x, x 5 If the simplex method terminates and one or more variables not in the final basis have bottomrow entries of zero, bringing these variables into the basis will determine other optimal solutions Demonstrate this in Exercises 5 and 5 Maximize) Maximize) Objective function: Objective function: z 5x z x x x x 5x 5 x x 5x x x x 5 x, x x, x C 7 Use a computer to maximize the objective function z x 7x x x x 7x 8x 5x 5 x 7x 8x x 9 5x 7x x x 8 where x, x, x, x C 8 Use a computer to maximize the objective function z x x x x subject to the same set of constraints given in Exercise 7 9 THE SIMPLEX METHOD: MINIMIZATION In Section 9, we applied the simplex method only to linear programming problems in standard form where the objective function was to be maximized In this section, we extend this procedure to linear programming problems in which the objective function is to be minimized A minimization problem is in standard form if the objective function w c x c x c n x n is to be minimized, a x a x a n x n b a x a x a n x n b a m x a m x a mn x n b m where x i and b i The basic procedure used to solve such a problem is to convert it to a maximization problem in standard form, and then apply the simplex method as discussed in Section 9 In Example 5 in Section 9, we used geometric methods to solve the following minimization problem
2 5 CHAPTER 9 LINEAR PROGRAMMING Minimization Problem: Find the minimum value of w x 5x Objective function subject to the following constraints x x x x x x 9 } Constraints where x and x The first step in converting this problem to a maximization problem is to form the augmented matrix for this system of inequalities To this augmented matrix we add a last row that represents the coefficients of the objective function, as follows 5 9 Next, we form the transpose of this matrix by interchanging its rows and columns 9 5 Note that the rows of this matrix are the columns of the first matrix, and vice versa Finally, we interpret the new matrix as a maximization problem as follows To do this, we introduce new variables, y, y, and y ) We call this corresponding maximization problem the dual of the original minimization problem Dual Maximization Problem: Find the maximum value of z y y 9y Dual objective function y y y Dual constraints y y y 5 } where y, y, and y As it turns out, the solution of the original minimization problem can be found by applying the simplex method to the new dual problem, as follows
3 SECTION 9 THE SIMPLEX METHOD: MINIMIZATION 5 y y y s s b Variables s Departing 5 s y y y s s b Variables 5 y s Departing 5 y y y s s b Variables y y 9 x x Thus, the solution of the dual maximization problem is z 5 This is the same value we obtained in the minimization problem given in Example 5, in Section 9 The xvalues corresponding to this optimal solution are obtained from the entries in the bottom row corresponding to slack variable columns In other words, the optimal solution occurs when x and x The fact that a dual maximization problem has the same solution as its original minimization problem is stated formally in a result called the von Neumann Duality Principle, after the American mathematician John von Neumann 9 957) Theorem 9 The von Neumann Duality Principle The objective value w of a minimization problem in standard form has a minimum value if and only if the objective value z of the dual maximization problem has a maximum value Moreover, the minimum value of w is equal to the maximum value of z Solving a Minimization Problem We summarize the steps used to solve a minimization problem as follows
4 5 CHAPTER 9 LINEAR PROGRAMMING Solving a Minimization Problem A minimization problem is in standard form if the objective function w c x c x c n x n is to be minimized, a x a x a n x n b a x a x a n x n b a m x a m x a mn x n b m where x i and b i To solve this problem we use the following steps Form the augmented matrix for the given system of inequalities, and add a bottom row consisting of the coefficients of the objective function a a a m c Form the transpose of this matrix a a a n b a a a m c a a a n b a n a n a mn c n a m a m a mn b m Form the dual maximization problem corresponding to this transposed matrix That is, find the maximum of the objective function given by z b y b y b m y m a y a y a m y m c a y a y a m y m c a n y a n y a mn y m c n b b b m c c c n where y, y,, and y m Apply the simplex method to the dual maximization problem The maximum value of z will be the minimum value of w Moreover, the values of x, x,, and x n will occur in the bottom row of the final simplex tableau, in the columns corresponding to the slack variables
5 SECTION 9 THE SIMPLEX METHOD: MINIMIZATION 5 We illustrate the steps used to solve a minimization problem in Examples and EXAMPLE Solving a Minimization Problem Find the minimum value of w x x Objective function x x x x } Constraints where x and x Solution The augmented matrix corresponding to this minimization problem is Thus, the matrix corresponding to the dual maximization problem is given by the following transpose This implies that the dual maximization problem is as follows Dual Maximization Problem: Find the maximum value of z y y Dual objective function y y Dual constraints y y } where y and y We now apply the simplex method to the dual problem as follows y y s s b Variables s Departing s
6 5 CHAPTER 9 LINEAR PROGRAMMING y y s s b Variables y s Departing 9 y y s s b Variables y y x x From this final simplex tableau, we see that the maximum value of z is Therefore, the solution of the original minimization problem is w Minimum Value and this occurs when x and x Both the minimization and the maximization linear programming problems in Example could have been solved with a graphical method, as indicated in Figure 99 Note in Figure 99 a) that the maximum value of z y y is the same as the minimum value of w x x, as shown in Figure 99 b) See page 55) EXAMPLE Solving a Minimization Problem Find the minimum value of w x x 8x x x x } x x x 8 x x x Objective function Constraints where x, x, and x
7 SECTION 9 THE SIMPLEX METHOD: MINIMIZATION 55 Figure 99 a), ) y, ), b) 5 x Maximum: z = y + y =, ), ) Minimum: w = x + x =, ), ) 5 Solution x y The augmented matrix corresponding to this minimization problem is 8 Thus, the matrix corresponding to the dual maximization problem is given by the following transpose This implies that the dual maximization problem is as follows Dual Maximization Problem: Find the maximum value of z y 8y y y x y y y y y y y 8 Dual objective function Dual constraints where y, y, and y We now apply the simplex method to the dual problem as follows y y y s s s b Variables s s 8 s Departing 8 y y y s s s b Variables s Departing 8 } 8 8 s y
8 5 CHAPTER 9 LINEAR PROGRAMMING y y y s s s b Variables y 5 s y x x x From this final simplex tableau, we see that the maximum value of z is Therefore, the solution of the original minimization problem is w and this occurs when Minimum Value x, x, and x Applications EXAMPLE A Business Application: Minimum Cost A small petroleum company owns two refineries Refinery costs $, per day to operate, and it can produce barrels of highgrade oil, barrels of mediumgrade oil, and barrels of lowgrade oil each day Refinery is newer and more modern It costs $5, per day to operate, and it can produce barrels of highgrade oil, barrels of mediumgrade oil, and 5 barrels of lowgrade oil each day The company has orders totaling 5, barrels of highgrade oil, 7, barrels of mediumgrade oil, and, barrels of lowgrade oil How many days should it run each refinery to minimize its costs and still refine enough oil to meet its orders? Solution To begin, we let x and x represent the number of days the two refineries are operated Then the total cost is given by C,x 5,x The constraints are given by Highgrade) x x 5, } Mediumgrade) x x 7, Lowgrade) x 5x, Objective function Constraints where x and x problem is The augmented matrix corresponding to this minimization
9 SECTION 9 THE SIMPLEX METHOD: MINIMIZATION 57, 5 5, 5, 7,, The matrix corresponding to the dual maximization problem is 5, 7, 5,, 5, We now apply the simplex method to the dual problem as follows y y y s s b Variables, s 5 5, s Departing 5, 7,, y y y s s b Variables 8, s Departing 5 5 7, 5, 5 5 y,5, y y y s s b Variables y 8 5 y ,75, x x From the third simplex tableau, we see that the solution to the original minimization problem is 5 7 7
10 58 CHAPTER 9 LINEAR PROGRAMMING C $,75, Minimum cost and this occurs when x 5 and x 5 Thus, the two refineries should be operated for the following number of days Refinery : 5 days Refinery : 5 days Note that by operating the two refineries for this number of days, the company will have produced the following amounts of oil Highgrade oil: Mediumgrade oil: Lowgrade oil: 5 5 5, barrels 5 5 7,5 barrels 5 5 5, barrels Thus, the original production level has been met with a surplus of 5 barrels of mediumgrade oil) SECTION 9 EXERCISES In Exercises, determine the dual of the given minimization problem Objective function: Objective function: w x x w x x x x x x 5x x 9 x x x, x x, x Objective function: Objective function: In Exercises 7, a) solve the given minimization problem by the graphical method, b) formulate the dual problem, and c) solve the dual problem by the graphical method 7 Objective function: 8 Objective function: w x x w x x x x x x x x 5 7x x x, x x, x w x x x x x x x x x 8x x x 8x x, x, x w 9x x x x 5 x x 8 x x x, x 5 Objective function: Objective function: x, 5, ), ) x x,, ), ) x w x x x w 9x x x x x x 9 x x x 7 x x x x x x x, x, x x, x, x
11 SECTION 9 EXERCISES 59 9 Objective function: Objective function: 5 Objective function: Objective function: w x x w x x w x x w x x x x x x x x x x 9 x, x x, x x x, ), 5 x 8, ), ) 8 x 5x x 9 x x x x x x x, x x, x 7 Objective function: 8 Objective function: w 8x x x w 8x x 8x x x x x x x x x x 7 x x x x x x 8 x x x 8 x, x, x x, x, x 9 Objective function: Objective function: Objective function: Objective function: w x x w x x x x x x x, x x, ), x x 5 x x x, x In Exercises, solve the given minimization problem by solving the dual maximization problem with the simplex method Objective function: Objective function: w x w x 8x x 5x x 5x x, x 5 x 8 x, 5), ) x 7x 9 x x x, x x w x x x x x x 8 x x x x x x x, x, x w x 5x 7x x x 7x 5 x x x 8 x x x x, x, x In Exercises, two dietary drinks are used to supply protein and carbohydrates The first drink provides unit of protein and units of carbohydrates in each liter The second drink supplies units of protein and units of carbohydrates in each liter An athlete requires units of protein and 5 units of carbohydrates Find the amount of each drink the athlete should consume to minimize the cost and still meet the minimum dietary requirements The first drink costs $ per liter and the second costs $ per liter The first drink costs $ per liter and the second costs $ per liter The first drink costs $ per liter and the second costs $ per liter The first drink costs $ per liter and the second costs $ per liter In Exercises 5 8, an athlete uses two dietary drinks that provide the nutritional elements listed in the following table Drink Protein Carbohydrates Vitamin D I II 5
12 5 CHAPTER 9 LINEAR PROGRAMMING Find the combination of drinks of minimum cost that will meet the minimum requirements of units of protein, units of carbohydrates, and units of vitamin D 5 Drink I costs $5 per liter and drink II costs $8 per liter Drink I costs $7 per liter and drink II costs $ per liter 7 Drink I costs $ per liter and drink II costs $5 per liter 8 Drink I costs $8 per liter and drink II costs $ per liter 9 A company has three production plants, each of which produces three different models of a particular product The daily capacities in thousands of units) of the three plants are as follows Model Model Model Plant 8 8 Plant Plant 8 The total demand for Model is, units, for Model is 7, units, and for Model is 9,5 units Moreover, the daily operating cost for Plant is $55,, for Plant is $,, and for Plant is $, How many days should each plant be operated in order to fill the total demand, and keep the operating cost at a minimum? The company in Exercise 9 has lowered the daily operating cost for Plant to $5, How many days should each plant be operated in order to fill the total demand, and keep the operating cost at a minimum? A small petroleum company owns two refineries Refinery costs $5, per day to operate, and it can produce barrels of highgrade oil, barrels of mediumgrade oil, and 5 barrels of lowgrade oil each day Refinery is newer and more modern It costs $, per day to operate, and it can produce barrels of highgrade oil, 5 barrels of mediumgrade oil, and barrels of lowgrade oil each day The company has orders totaling 5, barrels of highgrade oil,, barrels of mediumgrade oil, and, barrels of lowgrade oil How many days should the company run each refinery to minimize its costs and still meet its orders? A steel company has two mills Mill costs $7, per day to operate, and it can produce tons of highgrade steel, 5 tons of mediumgrade steel, and 5 tons of lowgrade steel each day Mill costs $, per day to operate, and it can produce 5 tons of highgrade steel, tons of mediumgrade steel, and tons of lowgrade steel each day The company has orders totaling, tons of highgrade steel, 5, tons of mediumgrade steel, and,5 tons of lowgrade steel How many days should the company run each mill to minimize its costs and still fill the orders? C Use a computer to minimize the objective function w x 5x 5x x 5x x 5x x 5 5x x x x 5x x 5x x 5 5x x 5x 5x 75 where x, x, x, x C Use a computer to minimize the objective function w 5x x 5x x subject to the same set of constraints given in Exercise
Standard 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 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 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 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 informationLECTURE 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
More information0.1 Linear Programming
0.1 Linear Programming 0.1.1 Objectives By the end of this unit you will be able to: formulate simple linear programming problems in terms of an objective function to be maximized or minimized subject
More informationDefinition 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 informationSimplex method summary
Simplex method summary Problem: optimize a linear objective, subject to linear constraints 1. Step 1: Convert to standard form: variables on righthand side, positive constant on left slack variables for
More informationChap 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.
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 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 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 informationLinear 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
More informationThe 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
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 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 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 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 information56: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
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 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 information1. LINEAR EQUATIONS. A linear equation in n unknowns x 1, x 2,, x n is an equation of the form
1. LINEAR EQUATIONS A linear equation in n unknowns x 1, x 2,, x n is an equation of the form a 1 x 1 + a 2 x 2 + + a n x n = b, where a 1, a 2,..., a n, b are given real numbers. For example, with x and
More informationThe 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
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 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 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 information(a) Let x and y be the number of pounds of seed and corn that the chicken rancher must buy. Give the inequalities that x and y must satisfy.
MA 44 Practice Exam Justify your answers and show all relevant work. The exam paper will not be graded, put all your work in the blue book provided. Problem A chicken rancher concludes that his flock
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 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 information56:171 Operations Research Midterm Exam Solutions Fall 2001
56:171 Operations Research Midterm Exam Solutions Fall 2001 True/False: Indicate by "+" or "o" whether each statement is "true" or "false", respectively: o_ 1. If a primal LP constraint is slack at the
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 informationSensitivity Report in Excel
The Answer Report contains the original guess for the solution and the final value of the solution as well as the objective function values for the original guess and final value. The report also indicates
More informationReduced echelon form: Add the following conditions to conditions 1, 2, and 3 above:
Section 1.2: Row Reduction and Echelon Forms Echelon form (or row echelon form): 1. All nonzero rows are above any rows of all zeros. 2. Each leading entry (i.e. left most nonzero entry) of a row is in
More informationThe application of linear programming to management accounting
The application of linear programming to management accounting Solutions to Chapter 26 questions Question 26.16 (a) M F Contribution per unit 96 110 Litres of material P required 8 10 Contribution per
More informationThis exposition of linear programming
Linear Programming and the Simplex Method David Gale This exposition of linear programming and the simplex method is intended as a companion piece to the article in this issue on the life and work of George
More informationLinear Equations in Linear Algebra
1 Linear Equations in Linear Algebra 1.2 Row Reduction and Echelon Forms ECHELON FORM A rectangular matrix is in echelon form (or row echelon form) if it has the following three properties: 1. All nonzero
More informationManufacturing and Resource Allocation
MA 2071 A 05 Bill Farr September 2, 2005 1 2 Outline Many industrial problems in manufacturing and resource allocation can be expressed as linear systems. This presentation provides an introduction to
More informationSolving Systems of Linear Equations; Row Reduction
Harvey Mudd College Math Tutorial: Solving Systems of Linear Equations; Row Reduction Systems of linear equations arise in all sorts of applications in many different fields of study The method reviewed
More informationMATH 304 Linear Algebra Lecture 8: Inverse matrix (continued). Elementary matrices. Transpose of a matrix.
MATH 304 Linear Algebra Lecture 8: Inverse matrix (continued). Elementary matrices. Transpose of a matrix. Inverse matrix Definition. Let A be an n n matrix. The inverse of A is an n n matrix, denoted
More informationUNIT 2 MATRICES  I 2.0 INTRODUCTION. Structure
UNIT 2 MATRICES  I Matrices  I Structure 2.0 Introduction 2.1 Objectives 2.2 Matrices 2.3 Operation on Matrices 2.4 Invertible Matrices 2.5 Systems of Linear Equations 2.6 Answers to Check Your Progress
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 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 informationMath 240: Linear Systems and Rank of a Matrix
Math 240: Linear Systems and Rank of a Matrix Ryan Blair University of Pennsylvania Thursday January 20, 2011 Ryan Blair (U Penn) Math 240: Linear Systems and Rank of a Matrix Thursday January 20, 2011
More informationChapter 3 LINEAR PROGRAMMING GRAPHICAL SOLUTION 3.1 SOLUTION METHODS 3.2 TERMINOLOGY
Chapter 3 LINEAR PROGRAMMING GRAPHICAL SOLUTION 3.1 SOLUTION METHODS Once the problem is formulated by setting appropriate objective function and constraints, the next step is to solve it. Solving LPP
More informationSolving Systems of Linear Equations Using Matrices
Solving Systems of Linear Equations Using Matrices What is a Matrix? A matrix is a compact grid or array of numbers. It can be created from a system of equations and used to solve the system of equations.
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 informationLinear 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
More information1. (a) Multiply by negative one to make the problem into a min: 170A 170B 172A 172B 172C Antonovics Foster Groves 80 88
Econ 172A, W2001: Final Examination, Possible Answers There were 480 possible points. The first question was worth 80 points (40,30,10); the second question was worth 60 points (10 points for the first
More informationSimple Linear Programming Model
Simple Linear Programming Model Katie Pease In partial fulfillment of the requirements for the Master of Arts in Teaching with a Specialization in the Teaching of Middle Level Mathematics in the Department
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 informationInverses and powers: Rules of Matrix Arithmetic
Contents 1 Inverses and powers: Rules of Matrix Arithmetic 1.1 What about division of matrices? 1.2 Properties of the Inverse of a Matrix 1.2.1 Theorem (Uniqueness of Inverse) 1.2.2 Inverse Test 1.2.3
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 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 informationMath Department Student Learning Objectives Updated April, 2014
Math Department Student Learning Objectives Updated April, 2014 Institutional Level Outcomes: Victor Valley College has adopted the following institutional outcomes to define the learning that all students
More informationSECTION 81 Systems of Linear Equations and Augmented Matrices
86 8 Systems of Equations and Inequalities In this chapter we move from the standard methods of solving two linear equations with two variables to a method that can be used to solve linear systems with
More informationHomework 6 Solution Section 3.2 3.3
Homework 6 Solution Section 3.2 3.3 3.2.10. Use graphical methods to solve the linear programming problem maximizing z = 10x + 8y subject to 2x + 3y 100 5x + 4y 200 x 10 0 y 20. Corner points: (10, 0),
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 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 informationLecture 1: Systems of Linear Equations
MTH Elementary Matrix Algebra Professor Chao Huang Department of Mathematics and Statistics Wright State University Lecture 1 Systems of Linear Equations ² Systems of two linear equations with two variables
More informationOptimization in R n Introduction
Optimization in R n Introduction Rudi Pendavingh Eindhoven Technical University Optimization in R n, lecture Rudi Pendavingh (TUE) Optimization in R n Introduction ORN / 4 Some optimization problems designing
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 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 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 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 informationIntroduction to Linear Programming (LP) Mathematical Programming (MP) Concept
Introduction to Linear Programming (LP) Mathematical Programming Concept LP Concept Standard Form Assumptions Consequences of Assumptions Solution Approach Solution Methods Typical Formulations Massachusetts
More informationLinearly Independent Sets and Linearly Dependent Sets
These notes closely follow the presentation of the material given in David C. Lay s textbook Linear Algebra and its Applications (3rd edition). These notes are intended primarily for inclass presentation
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 information9.2 LINEAR PROGRAMMING INVOLVING TWO VARIABLES
86 CHAPTER 9 LINEAR PROGRAMMING 9. LINEAR PROGRAMMING INVOLVING TWO VARIABLES Figure 9.0 Feasible solutions Man applications in business and economics involve a process called optimization, in which we
More informationRow Echelon Form and Reduced Row Echelon Form
These notes closely follow the presentation of the material given in David C Lay s textbook Linear Algebra and its Applications (3rd edition) These notes are intended primarily for inclass presentation
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 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 information2x + y = 3. Since the second equation is precisely the same as the first equation, it is enough to find x and y satisfying the system
1. Systems of linear equations We are interested in the solutions to systems of linear equations. A linear equation is of the form 3x 5y + 2z + w = 3. The key thing is that we don t multiply the variables
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +
More informationSpecial cases in Transportation Problems
Unit 1 Lecture 18 Special cases in Transportation Problems Learning Objectives: Special cases in Transportation Problems Multiple Optimum Solution Unbalanced Transportation Problem Degeneracy in the Transportation
More informationAn Introduction to Linear Programming
An Introduction to Linear Programming Steven J. Miller March 31, 2007 Mathematics Department Brown University 151 Thayer Street Providence, RI 02912 Abstract We describe Linear Programming, an important
More informationGENERALIZED INTEGER PROGRAMMING
Professor S. S. CHADHA, PhD University of Wisconsin, Eau Claire, USA Email: schadha@uwec.edu Professor Veena CHADHA University of Wisconsin, Eau Claire, USA Email: chadhav@uwec.edu GENERALIZED INTEGER
More informationThese axioms must hold for all vectors ū, v, and w in V and all scalars c and d.
DEFINITION: A vector space is a nonempty set V of objects, called vectors, on which are defined two operations, called addition and multiplication by scalars (real numbers), subject to the following axioms
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 information11.2 ALLOCATION MODELS 242 CHAPTER 11 LINEAR OPTIMIZATION
242 CHAPTER 11 LINEAR OPTIMIZATION optimal point is encountered. The simplex algorithm does not require a starting point in the worksheet; to put it another way, it determines its own starting solution.
More informationSystems of Linear Equations
Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and
More informationby the matrix A results in a vector which is a reflection of the given
Eigenvalues & Eigenvectors Example Suppose Then So, geometrically, multiplying a vector in by the matrix A results in a vector which is a reflection of the given vector about the yaxis We observe that
More informationSolving Systems of Linear Equations. Substitution
Solving Systems of Linear Equations There are two basic methods we will use to solve systems of linear equations: Substitution Elimination We will describe each for a system of two equations in two unknowns,
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 informationThe Correlation Coefficient
The Correlation Coefficient Lelys Bravo de Guenni April 22nd, 2015 Outline The Correlation coefficient Positive Correlation Negative Correlation Properties of the Correlation Coefficient Nonlinear association
More informationMATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix.
MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix. Nullspace Let A = (a ij ) be an m n matrix. Definition. The nullspace of the matrix A, denoted N(A), is the set of all ndimensional column
More information1. Determine graphically the solution set for each system of inequalities and indicate whether the solution set is bounded or unbounded:
Final Study Guide MATH 111 Sample Problems on Algebra, Functions, Exponents, & Logarithms Math 111 Part 1: No calculator or study sheet. Remember to get full credit, you must show your work. 1. Determine
More information3. Linear Programming and Polyhedral Combinatorics
Massachusetts Institute of Technology Handout 6 18.433: Combinatorial Optimization February 20th, 2009 Michel X. Goemans 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the
More informationNumber Who Chose This Maximum Amount
1 TASK 3.3.1: MAXIMIZING REVENUE AND PROFIT Solutions Your school is trying to oost interest in its athletic program. It has decided to sell a pass that will allow the holder to attend all athletic events
More informationChapter 4: The Mechanics of the Simplex Method
Chapter 4: The Mechanics of the Simplex Method The simplex method is a remarkably simple and elegant algorithmic engine for solving linear programs. In this chapter we will examine the internal mechanics
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 information26 Linear Programming
The greatest flood has the soonest ebb; the sorest tempest the most sudden calm; the hottest love the coldest end; and from the deepest desire oftentimes ensues the deadliest hate. Th extremes of glory
More informationPETROLEUM ECONOMICS AND MANAGEMENT
PETROLEUM ECONOMICS AND MANAGEMENT APPLIED GRADUATE STUDIES PEM1 Business Accounting PEM2 Organizational Behavior PEM3 Strategic Marketing & Management PEM4 Energy Economics & Development PEM5 Energy Geopolitics
More informationSolutions to Linear Algebra Practice Problems 1. form (because the leading 1 in the third row is not to the right of the
Solutions to Linear Algebra Practice Problems. Determine which of the following augmented matrices are in row echelon from, row reduced echelon form or neither. Also determine which variables are free
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 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 informationUsing row reduction to calculate the inverse and the determinant of a square matrix
Using row reduction to calculate the inverse and the determinant of a square matrix Notes for MATH 0290 Honors by Prof. Anna Vainchtein 1 Inverse of a square matrix An n n square matrix A is called invertible
More informationa 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More informationOptimization Theory for Large Systems
Optimization Theory for Large Systems LEON S. LASDON CASE WESTERN RESERVE UNIVERSITY THE MACMILLAN COMPANY COLLIERMACMILLAN LIMITED, LONDON Contents 1. Linear and Nonlinear Programming 1 1.1 Unconstrained
More information10.2 ITERATIVE METHODS FOR SOLVING LINEAR SYSTEMS. The Jacobi Method
578 CHAPTER 1 NUMERICAL METHODS 1. ITERATIVE METHODS FOR SOLVING LINEAR SYSTEMS As a numerical technique, Gaussian elimination is rather unusual because it is direct. That is, a solution is obtained after
More information