The Theory of the Simplex Method

Slides:



Advertisements
Similar presentations
Chapter Matrices Matrix Arithmetic
Advertisements

Computational Methods for Management and Economics Carla Gomes Module 6a Introduction to Simplex (Textbook – Hillier and Lieberman)
Water Resources Development and Management Optimization (Linear Programming) CVEN 5393 Feb 18, 2013.
Basic Feasible Solutions: Recap MS&E 211. WILL FOLLOW A CELEBRATED INTELLECTUAL TEACHING TRADITION.
Mathematics. Matrices and Determinants-1 Session.
MF-852 Financial Econometrics
Chapter 2 Basic Linear Algebra
Computational Methods for Management and Economics Carla Gomes
Chapter 2 Matrices Definition of a matrix.
Economics 2301 Matrices Lecture 13.
CALCULUS – II Matrix Multiplication by Dr. Eman Saad & Dr. Shorouk Ossama.
Part 3 Chapter 8 Linear Algebraic Equations and Matrices PowerPoints organized by Dr. Michael R. Gustafson II, Duke University All images copyright © The.
Pam Perlich Urban Planning 5/6020
Matrices and Determinants
Special Topic: Matrix Algebra and the ANOVA Matrix properties Types of matrices Matrix operations Matrix algebra in Excel Regression using matrices ANOVA.
INDR 262 INTRODUCTION TO OPTIMIZATION METHODS LINEAR ALGEBRA INDR 262 Metin Türkay 1.
Finding the Inverse of a Matrix
Lecture 7: Matrix-Vector Product; Matrix of a Linear Transformation; Matrix-Matrix Product Sections 2.1, 2.2.1,
CE 311 K - Introduction to Computer Methods Daene C. McKinney
1 Chapter 3 Matrix Algebra with MATLAB Basic matrix definitions and operations were covered in Chapter 2. We will now consider how these operations are.
Chapter 7 Matrix Mathematics Matrix Operations Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Presentation by: H. Sarper
Introduction to Linear Programming
AGB 260: Agribusiness Information Technology Arrays and Array Formulas.
The Theory of the Simplex Method
Linear Programming: Basic Concepts
Overview Definitions Basic matrix operations (+, -, x) Determinants and inverses.
Matrices. A matrix, A, is a rectangular collection of numbers. A matrix with “m” rows and “n” columns is said to have order m x n. Each entry, or element,
8.1 Matrices & Systems of Equations
Ch X 2 Matrices, Determinants, and Inverses.
1 C ollege A lgebra Systems and Matrices (Chapter5) 1.
Solving Linear Programming Problems: The Simplex Method
Water Resources Development and Management Optimization (Linear Programming) CVEN 5393 Mar 4, 2011.
Linear Algebra 1.Basic concepts 2.Matrix operations.
AGB 260: Agribusiness Information Technology Arrays and Array Formulas.
Chapter 6 Systems of Linear Equations and Matrices Sections 6.3 – 6.5.
ES 240: Scientific and Engineering Computation. Chapter 8 Chapter 8: Linear Algebraic Equations and Matrices Uchechukwu Ofoegbu Temple University.
Meeting 18 Matrix Operations. Matrix If A is an m x n matrix - that is, a matrix with m rows and n columns – then the scalar entry in the i th row and.
1 THE REVISED SIMPLEX METHOD CONTENTS Linear Program in the Matrix Notation Basic Feasible Solution in Matrix Notation Revised Simplex Method in Matrix.
Special Topic: Matrix Algebra and the ANOVA Matrix properties Types of matrices Matrix operations Matrix algebra in Excel Regression using matrices ANOVA.
Flow in Network. Graph, oriented graph, network A graph G =(V, E) is specified by a non empty set of nodes V and a set of edges E such that each edge.
Foundation of the Simplex Method.  Constraints Boundary Equations  Graphical approach is very limited based on number of variables. The simplex method.
TH EDITION LIAL HORNSBY SCHNEIDER COLLEGE ALGEBRA.
Matrices and Determinants
Matrices and Matrix Operations. Matrices An m×n matrix A is a rectangular array of mn real numbers arranged in m horizontal rows and n vertical columns.
MATRIX A set of numbers arranged in rows and columns enclosed in round or square brackets is called a matrix. The order of a matrix gives the number of.
2.5 – Determinants and Multiplicative Inverses of Matrices.
Foundations-1 The Theory of the Simplex Method. Foundations-2 The Essence Simplex method is an algebraic procedure However, its underlying concepts are.
Matrix Algebra Basics Chapter 3 Section 5. Algebra.
Matrices. Variety of engineering problems lead to the need to solve systems of linear equations matrixcolumn vectors.
10.4 Matrix Algebra. 1. Matrix Notation A matrix is an array of numbers. Definition Definition: The Dimension of a matrix is m x n “m by n” where m =
A very brief introduction to Matrix (Section 2.7) Definitions Some properties Basic matrix operations Zero-One (Boolean) matrices.
MATRICES A rectangular arrangement of elements is called matrix. Types of matrices: Null matrix: A matrix whose all elements are zero is called a null.
College Algebra Chapter 6 Matrices and Determinants and Applications
MTH108 Business Math I Lecture 20.
12-4: Matrix Methods for Square Systems
AGB 260: Agribusiness Data Literacy
Linear Algebraic Equations and Matrices
Chapter 7 Matrix Mathematics
Matrices and Matrix Solutions
Finding the Inverse of a Matrix
Linear Algebraic Equations and Matrices
Water Resources Development and Management Optimization (Linear Programming) CVEN 5393 Mar 7, 2011.
The Theory of the Simplex Method Asst. Prof. Dr. Nergiz Kasımbeyli
Solving Linear Programming Problems: Asst. Prof. Dr. Nergiz Kasımbeyli
Lecture 11 Matrices and Linear Algebra with MATLAB
Chapter 7: Matrices and Systems of Equations and Inequalities
Dr Huw Owens Room B44 Sackville Street Building Telephone Number 65891
Matrices and Determinants
Presentation transcript:

The Theory of the Simplex Method Chapter 5: Hillier and Lieberman Chapter 5: Decision Tools for Agribusiness Dr. Hurley’s AGB 328 Course

Terms to Know Constraint Boundary Equation, Hyperplane, Constraint Boundary, Corner-Point Feasible Solution, Defining Equations, Edge, Adjacent, Convex Set, Basic Solutions, Basic Feasible Solution, Defining Equations, Indicating Variable, Basic Variables, Non-Basic Variables, Vector of Basic Variables, Basis Matrix

Adjacent CPF Solutions Given n decision variables and bounded feasible region, an edge can be defined as the feasible line segment that is defined by n-1 constraint boundary equations Two CPF solutions are considered adjacent if the line segment connecting them is an edge of the feasible region Hence you get an adjacent point by deleting one of the n constraints currently defining the CPF solution

The Simplex Method in Matrix Form A general maximization problem can be written more succinctly in the following matrix notation: Maximize Z = cTx Subject to: Ax ≤ b x ≥ 0

The Simplex Method in Matrix Form Cont. c= 𝑐 1 𝑐 2 ⋮ 𝑐 𝑛 , 𝐀= 𝑎 11 𝑎 21 𝑎 12 … 𝑎 22 … 𝑎 1𝑛 𝑎 2𝑛 ⋮ ⋮ ⋮ ⋮ 𝑎 𝑚1 𝑎 𝑚2 … 𝑎 𝑚𝑛 , x= 𝑥 1 𝑥 2 ⋮ 𝑥 𝑛 ,b= 𝑏 1 𝑏 2 ⋮ 𝑏 𝑛 ,0= 0 0 ⋮ 0 cT= 𝑐 1 , 𝑐 2 ,…, 𝑐 𝑛

Wyndor Problem in Matrix Form 𝒄= 3 5 ,𝒙= 𝑥 1 𝑥 2 ,𝑨= 1 0 0 2 3 2 , 𝒃= 4 12 18

Important Rules/Facts of Matrices Matrices with the same number of rows and columns can be added/subtracted component by component Matrices can be multiplied together as long as the first matrix has the same number of columns as the second matrix has of rows E.g., C = AB is defined as long as the number of columns in matrix A is equal to the number of rows in matrix B Matrix C will have the same number of rows as matrix A and the same number of columns as matrix B

Important Rules/Facts of Matrices Cont. Suppose matrix A has r number of rows and m number of columns, matrix B has m number of rows and c number of columns, then a matrix Q, which equals AB, has r rows and c columns where each component in the Q matrix is found by the following method: qij = ai1*blj + ai2*b2j + ai3*b3j +… +aim*bmj Note that this is just the Sumproduct() of the corresponding row from matrix A to the corresponding column in matrix B

Important Rules/Facts of Matrices Cont. Example of matrix multiplication using Wyndor’s constraints evaluated at Wyndor’s optimal 𝑨= 1 0 0 2 3 2 ,𝑩= 2 6 , 𝐴𝐵= 1∗2+0∗6 0∗2+2∗6 3∗2+2∗6 = 2 12 18

Important Rules/Facts of Matrices Cont. An important matrix is known as a identity matrix This matrix is known as I The identity matrix can be considered like the number 1 when it comes to matrix multiplication because when you multiply the identity by any matrix A, you get A, i.e., A*I=I*A=A

Important Rules/Facts of Matrices Cont. While there is no formal division in matrix algebra, it does have the idea of an inverse for some matrices, .i.e., certain square matrices Normally this inverse matrix of a matrix A is denoted by A-1 and has the property that A*A-1= A-1*A = I

Important Rules/Facts of Matrices Cont. The transpose of a matrix takes each component aij in a matrix and swaps it with component aji Basically this exchanges the rows with the columns leaving the diagonal intact It should be noted that AB does not have to equal BA or even be defined

Excels Key Matrix Functions Transpose() This function takes a columns and swaps them for the rows or vice-versa Mmult() This function will give you the product of the matrices inputted Minverse() This function gives the inverse of a matrix

Excels Key Matrix Functions Cont. It should be noted that to use these matrix functions correctly, you need to first enter the formula in a single cell Next you need to highlight all the cells that are needed and press the F2 function Finally you need to press Control-Shift-Enter at the same time

Quick Matrix Exercise Define 𝑨= 2 6 9 3 5 8 1 4 7 Using Excel, what is the inverse of A? Using Excel, what is the transpose of A? Using Excel, what is AA-1? What happens if you select too many rows or columns before you press F2 when you attempt to find these answers in Excel?

Another Matrix Example Suppose we had the following: x1+ 3x2= 8 x1+ x2= 4 We could put this problem in the following matrix notation 𝑨= 1 3 1 1 , 𝒙= 𝑥 1 𝑥 2 ,𝒃= 8 4 Hence we could write the problem as: Ax = b We can solve for x by pre-multiplying both sides by A-1 to get x = A-1b Put this into Excel to see what you get

Sub-Matrices A matrix can be broken-up into sub- matrices A sub-matrix is a smaller matrix inside of a matrix When you break-up a matrix into smaller matrices, you are said to be partitioning it Recall the Original Wyndor tableaux −3 −2 1 0 0 0 0 1 0 0 0 2 3 2 0 1 0 0 0 1

Sub-Matrices Cont. −3 −2 1 0 0 0 0 1 0 0 0 2 3 2 0 1 0 0 0 1 We can rewrite this matrix as: −𝒄 𝟎 𝑨 𝑰