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

Save this PDF as:

Size: px
Start display at page:

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

## Transcription

1 Quiz 1 Sample Questions IE406 Introduction to Mathematical Programming Dr. Ralphs These questions are from previous years and should you give you some idea of what to expect on Quiz Consider the linear program pictured here, where the feasible region is the shaded area, the objective function vector is the vector pictured with its tail at the point labeled A, and the goal is to MINIMIZE. 1 4 C B D A obj fcn E 6 The numbers indicate the indices of the variables corresponding to each (nonnegativity) constraint when the program is expressed in standard form, while the letters indicate the extremal elements of the feasible region. The following questions refer to solution of this linear program by the primal simplex method. (a) (10 points) What is the optimal solution to this linear program? Argue geometrically why the solution must be optimal. Is the solution unique? Why or why not? (b) (10 points) List all sequences of BFS s that can occur when solving this linear program with the simplex method. For this part, you SHOULD NOT assume that the rule for selecting the variable to enter the basis is to select the one with the most negative reduced cost. In the case of a degenerate pivot, a single BFS may be listed more than once in the list. Indicate the sequences that involve the smallest and largest number of simplex iterations. Justify your answer. (c) (10 points) Of the above sequences, which ones can occur if the rule for selecting the variable to enter the basis is to select the variable with the most negative reduced cost (assuming the basic direction vectors all have the same norm)? Justify your answer. (d) (10 points) Which path occurs if the tiebreaking rule for selecting the leaving variable in each iteration is to select the variable with the smallest subscript? With the largest subscript? Justify your answer.. For the questions below, provide either a short argument supporting the validity of the statement or a specific counterexample. All questions refer to the primal simplex 1

2 algorithm applied to a linear program in standard form with feasible region P and a constraint matrix of full rank. (a) (10 points) If the only allowable pivots are degenerate, then the current basis is optimal. (b) (10 points) If the current solution is degenerate, then the objective function value will remain unchanged after the next pivot. (c) (10 points) If there is a tie in the ratio test, then the next BFS will be degenerate. (d) (10 points) The existence of a redundant constraint implies the existence of a degenerate BFS.. (a) (10 points) Consider a linear program in standard form. An alternative to the method of finding an initial BFS discussed in class is to introduce a single artificial variable with index n + 1 such that A n+1 = b. In the modified LP, the solution ˆx R n+1 such that ˆx n+1 = 1 and ˆx i = 0 for all i 1..n is then feasible. Describe a method of finding an initial BFS by introducing such an artificial variable in the case, assuming all of the original constraints are inequalities. Be specific. (b) (10 points) Use the method described above to find a BFS for the following LP and set up an initial tableau for the simplex method: min x 1 + x + 4x s.t. x 1 + x + x, x 1 x x 1, x 1, x, x Consider the following simple linear program: min x 1 x s.t. x 1 + x, x 1 x 0, x 1 1, and x 1, x 0. (a) ( points) Draw the feasible region and identify all basic feasible solutions. Indicate which solutions are degenerate, which are nondegenerate, and which are optimal. Explain your answer. (b) ( points) Write the problem in standard form and set up the initial tableau using the origin as the initial basic feasible solution. What is the initial set of binding constraints (in terms of the original problem)?

4 (a) (10 points) Show that the optimization problem () is a linear program. (b) (10 points) Argue that if there is an optimal solution to (), then there is an optimal solution that is an extreme point of P. 7. Consider the following linear program: min x 1 + x + x s.t. x 1 + x + 6x x 1 + 4x + x x 1, x, x 0 (a) ( points) Write this problem in standard form (the remaining parts refer to the problem in standard form). (b) ( points) Is it possible for both x 1 and x to both be basic at the same time? Explain. (c) ( points) How many basic solutions are there to this problem? Explain. 8. (a) ( points) In the two-dimensional polyhedron pictured below, identify the points corresponding to degenerate basic solutions and say why they are degenerate. A B D C (b) ( points) How can you tell from looking at a tableau if the current solution is degenerate? Explain. (c) ( points) Once the variable to enter the basis has been chosen, how can you tell if the pivot will be degenerate, i.e., will lead to a new basis representing the same basic feasible solution? Explain. 9. WiGgy, Inc. is a company whose two products are widgets and gadgets. The demand for widgets and gadgets is practically unlimited, but the company is constrained by its production capacity and cash flow. The factory contains only one kind of machine, which can manufacture either widgets or gadgets. It takes hours to manufacture a widget and 4 hours to manufacture a gadget, and there is a total of 10,000 hours of machine time available in the factory per quarter. The raw materials must be purchased in advance each quarter at a cost of \$ per widget and \$ per gadget. 4

5 These raw materials must be purchased with existing capital reserves, which total \$90,000 dollars. The selling price of a widget is \$6 and a gadget \$. (a) ( points) Assuming that raw materials are the only cost associated with manufacturing widgets and gadgets, formulate a linear program to maximize profits for the current quarter (Hint: Use units that make the numbers easy to work with). (b) (10 points) Solve this LP using the tableau method. Briefly explain your steps. (c) (10 points) Graph the associated polyhedron, show the objective function, and indicate the optimal solution. (d) ( points) If the number of available machine hours goes up by,000 hours, explain how to obtain the new optimal solution without re-solving the problem from scratch. (e) Extra Credit ( points): Assuming the increase in machine hours described above is due to the purchase of new machines, what is the most WiGgy, Inc. should be willing to pay for them? 10. Consider the following linear program: min 10x 1 +x s.t. x 1 +x +4x +x 4 = x 1 +6x x 4 = 1 x 1, x, x, x 4 0 (a) ( points) Set up a tableau for the first phase of the two-phase simplex method. (b) (1 points) Solve this LP using the two-phase simplex method. 11. Consider again the LP of the Top Brass example from lecture, restated below. max 1x 1 +9x s.t. x x 100 x 1 +x 170 4x 1 +x 4800 x 1, x 0 Let y be the basic feasible solution (0, 100). (a) ( points) Determine the set of all feasible directions at y. Justify your answer. (b) ( points) Determine the set of all improving directions at y. Justify your answer. (c) ( points) Using your results from (a) and (b), show that y is not optimal.

6 (d) ( points) Determine the set of all objective functions for which y would be optimal. Justify your answer. 1. Consider the LP min 10x 1 1x 1x s.t. x 1 +x +x 0 x 1 +x +x 0 x 1 +x +x 0 x 1, x, x 0 and a corresponding optimal tableau x 1 x x s 1 s s (a) ( points) Determine the basic feasible solution shown in the above tableau and its corresponding basis inverse (B 1 ). (b) (10 points) Suppose a variable x 4 is added to the original LP, resulting in the new LP min 10x 1 1x 1x +αx 4 s.t. x 1 +x +x +x 4 0 x 1 +x +x +x 4 0 x 1 +x +x +x 4 0 x 1, x, x, x 4 0. Construct the tableau corresponding to the basis from part (a) for this new LP by adding a column for the variable x 4. The reduced cost of x 4 should be expressed as a function of α. (c) ( points) Determine for what values of α the current solution remains optimal for the new LP. 1. (10 points) One way in which the simplex algorithm can be used to solve maximization problems is to simply negate the objective function. Explain how the simplex method could be adapted to solve maximization problems directly, i.e., without negating the objective function. 6

7 14. The following linear programming model describes a problem of allocating two resources to the annual production of three commodities by a manufacturing firm. The amounts of the three products to be produced are denoted by x 1, x, and x. The objective function represents the profit associated with each of these products. Note that this is a maximization problem. max 10x 1 + 1x + x s.t. x 1 + x + x 9000 x 1 + x + x 4000 x 1, x, x 0 (a) (10 points) Without using the simplex method, verify that there is an optimal solution in which only the first two products are produced. Calculate such an optimal solution. Show your work. (b) (10 points) Make use of the information derived in (a) to write the corresponding optimal tableau. (c) (10 points) The R&D department proposes a new product whose production coefficients are represented by [4, 1] (i.e., this would be the new column to be added to the constraint matrix) and whose associated profit 1 per unit. Should this product be produced? Justify your answer. (d) ( points) What is the minimal profit for the new product that would result in an optimal solution in which the new product would be produced? 1. The starting and current tableaux of a linear programming problem are given below. Find the values of the unknowns a through l. Show your calculations and provide brief explanations. Starting Tableau x 1 x x x 4 x RHS a b c d e Current Tableau x 1 x x x 4 x RHS 0 1 j k l g h i f 1 1 List values here (1 point for each correct value): 7

8 a = b = c = d = e = f = g = h = i = j = k = l = 16. Consider a linear programming problem P in standard form: min c x s.t. Ax = b x 0 with A R m n, c R n, and b R m. (a) (10 points) Explain the intuition behind the following statement: P is unbounded if and only if there exists a nonzero real vector d 0 such that Ad = 0 and c d < 0. You do not have to write a formal proof. (b) (10 points) Explain how this relates to the condition that demonstrates unboundedness when performing the simplex algorithm, i.e., that no component of the vector u is positive when performing the ratio test (step in the description of the tableau method on page 100 of the textbook). (c) ( points) Graphically depict an unbounded linear programming problem and show a vector d that demonstrates that satisfies the criteria of part (a), i.e., shows that the LP is unbounded. Explain your answer. 17. Consider the following linear program: min c 1 x 1 + c x s.t. x 1 + x b 1 x 1 + x b x 1, x 0 (a) (10 points) Write this problem in standard form, and determine the basis inverse corresponding to the basic solution for which x 1 = 0 and the first constraint is binding. (b) (10 points) Using the basis inverse, determine the set of values of b 1 and b for which the corresponding basic solution is feasible. (c) (10 points) Assuming that b 1 = 1 and b =, use the basis inverse to determine the set of values of c 1 and c such that the corresponding basic feasible solution is optimal. 8

9 (d) (10 points) Assuming that b 1 = 1, b =, c 1 = 1, and c = 1, set up the simplex tableau corresponding to this basic feasible solution and solve it using the simplex algorithm. Explain each step. 18. We say that a constraint with coefficient vector a R n and right-hand side vector b R is redundant for P if the corresponding half-space includes P, i.e., P {x R n a x b}. (a) (10 points) Formulate an LP that will determine if a given constraint is redundant for a polyhedron P. (b) (10 points) Suppose that while solving an LP, the current tableau shows that the slack variable corresponding to the i th constraint is basic in row j, but every other entry in row j is nonpositive (except for the entry in the column corresponding to the slack variable and the right-hand side entry). Show algebraically that in this case, the i th constraint is redundant and that the column corresponding to the slack variable, along with the j th row of the tableau can be removed and the simplex algorithm continued. (c) (10 points) Generalize the result in part (b) to show that for any variable i that is basic in row j of the tableau, if all entries in row j are negative (other than in column j and the right-hand side), then column i and row j can be removed from the tableau and the simplex algorithm continued. Discuss how to how to determine the value of the removed variable after the optimal solution to the reduced problem has been obtained. 9

### Special Situations in the Simplex Algorithm

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

### 3 Does the Simplex Algorithm Work?

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

### 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

### Simplex method summary

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

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

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

### OPRE 6201 : 2. Simplex Method

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

### Linear 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

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

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

### 1 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

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

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

### 4.6 Linear Programming duality

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

### Linear Programming I

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

### What is Linear Programming?

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

### Linear 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.............................

### Solving Linear Programs

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

### Chapter 2 Solving Linear Programs

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

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

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

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

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

### 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,

### 56: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

### Chapter 6: Sensitivity Analysis

Chapter 6: Sensitivity Analysis Suppose that you have just completed a linear programming solution which will have a major impact on your company, such as determining how much to increase the overall production

### IEOR 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

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

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

### Linear Programming. March 14, 2014

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

### Using the Simplex Method to Solve Linear Programming Maximization Problems J. Reeb and S. Leavengood

PERFORMANCE EXCELLENCE IN THE WOOD PRODUCTS INDUSTRY EM 8720-E October 1998 \$3.00 Using the Simplex Method to Solve Linear Programming Maximization Problems J. Reeb and S. Leavengood A key problem faced

### Linear Programming Notes VII Sensitivity Analysis

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

### 7.4 Linear Programming: The Simplex Method

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

### Sensitivity 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

### Duality in Linear Programming

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

### Linear Programming Notes V Problem Transformations

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

### Study 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

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

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

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

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

### Operation 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

### Linear Programming Problems

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

### International Doctoral School Algorithmic Decision Theory: MCDA and MOO

International Doctoral School Algorithmic Decision Theory: MCDA and MOO Lecture 2: Multiobjective Linear Programming Department of Engineering Science, The University of Auckland, New Zealand Laboratoire

### Converting 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

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

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

### Linear 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,

### 1. (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

### Nonlinear Programming Methods.S2 Quadratic Programming

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

### Lecture 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

### 3. 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

### Linear Programming. April 12, 2005

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

### 0.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

### 7.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

### Module1. 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,

### 4 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

### 26 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

### 9.4 THE SIMPLEX METHOD: MINIMIZATION

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

### UNIT 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

### Optimization 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

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

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

### The 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,

### Linear Dependence Tests

Linear Dependence Tests The book omits a few key tests for checking the linear dependence of vectors. These short notes discuss these tests, as well as the reasoning behind them. Our first test checks

### C&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

### Lecture 6. Inverse of Matrix

Lecture 6 Inverse of Matrix Recall that any linear system can be written as a matrix equation In one dimension case, ie, A is 1 1, then can be easily solved as A x b Ax b x b A 1 A b A 1 b provided that

### (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 4-4 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

### SYSTEMS OF EQUATIONS

SYSTEMS OF EQUATIONS 1. Examples of systems of equations Here are some examples of systems of equations. Each system has a number of equations and a number (not necessarily the same) of variables for which

### Reduced 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

### Can linear programs solve NP-hard problems?

Can linear programs solve NP-hard problems? p. 1/9 Can linear programs solve NP-hard problems? Ronald de Wolf Linear programs Can linear programs solve NP-hard problems? p. 2/9 Can linear programs solve

### CHAPTER 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 real-world problem can be represented accurately

### This 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

### Introduction 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

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

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

### Degeneracy in Linear Programming

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

### Linear Programming II: Minimization 2006 Samuel L. Baker Assignment 11 is on page 16.

LINEAR PROGRAMMING II 1 Linear Programming II: Minimization 2006 Samuel L. Baker Assignment 11 is on page 16. Introduction A minimization problem minimizes the value of the objective function rather than

### Sensitivity 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

### Mathematical finance and linear programming (optimization)

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

### Sensitivity 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-

### Solving Linear Diophantine Matrix Equations Using the Smith Normal Form (More or Less)

Solving Linear Diophantine Matrix Equations Using the Smith Normal Form (More or Less) Raymond N. Greenwell 1 and Stanley Kertzner 2 1 Department of Mathematics, Hofstra University, Hempstead, NY 11549

### EXCEL SOLVER TUTORIAL

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

### . 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

### Vector 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

### Linear 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

### 24. 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 NP-complete. Then one can conclude according to the present state of science that no

### 2.3 Convex Constrained Optimization Problems

42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions

### Row 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 in-class presentation

### Unit 1. Today I am going to discuss about Transportation problem. First question that comes in our mind is what is a transportation problem?

Unit 1 Lesson 14: Transportation Models Learning Objective : What is a Transportation Problem? How can we convert a transportation problem into a linear programming problem? How to form a Transportation

### Network Models 8.1 THE GENERAL NETWORK-FLOW PROBLEM

Network Models 8 There are several kinds of linear-programming models that exhibit a special structure that can be exploited in the construction of efficient algorithms for their solution. The motivation

### GENERALIZED INTEGER PROGRAMMING

Professor S. S. CHADHA, PhD University of Wisconsin, Eau Claire, USA E-mail: schadha@uwec.edu Professor Veena CHADHA University of Wisconsin, Eau Claire, USA E-mail: chadhav@uwec.edu GENERALIZED INTEGER

### Chapter 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

### PhysicsAndMathsTutor.com

D Linear programming - Simplex algorithm. The tableau below is the initial tableau for a maximising linear programming problem in x, y and z. Basic variable x y z r s t Value r 4 7 5 0 0 64 s 0 0 0 6 t

### MATRIX 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

### Solving Linear Programs using Microsoft EXCEL Solver

Solving Linear Programs using Microsoft EXCEL Solver By Andrew J. Mason, University of Auckland To illustrate how we can use Microsoft EXCEL to solve linear programming problems, consider the following

### 15.053/8 February 26, 2013

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

### Chapter 4. Duality. 4.1 A Graphical Example

Chapter 4 Duality Given any linear program, there is another related linear program called the dual. In this chapter, we will develop an understanding of the dual linear program. This understanding translates

### MATRIX 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 +

### Manufacturing 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

### 8. Linear least-squares

8. Linear least-squares EE13 (Fall 211-12) definition examples and applications solution of a least-squares problem, normal equations 8-1 Definition overdetermined linear equations if b range(a), cannot

### Lecture 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 real-valued

### Diagonal, Symmetric and Triangular Matrices

Contents 1 Diagonal, Symmetric Triangular Matrices 2 Diagonal Matrices 2.1 Products, Powers Inverses of Diagonal Matrices 2.1.1 Theorem (Powers of Matrices) 2.2 Multiplying Matrices on the Left Right by

### The number of marks is given in brackets [ ] at the end of each question or part question. The total number of marks for this paper is 72.

ADVANCED SUBSIDIARY GCE UNIT 4736/01 MATHEMATICS Decision Mathematics 1 THURSDAY 14 JUNE 2007 Afternoon Additional Materials: Answer Booklet (8 pages) List of Formulae (MF1) Time: 1 hour 30 minutes INSTRUCTIONS

### Nonlinear Optimization: Algorithms 3: Interior-point methods

Nonlinear Optimization: Algorithms 3: Interior-point methods INSEAD, Spring 2006 Jean-Philippe Vert Ecole des Mines de Paris Jean-Philippe.Vert@mines.org Nonlinear optimization c 2006 Jean-Philippe Vert,

### Using Excel to Find Numerical Solutions to LP's

Using Excel to Find Numerical Solutions to LP's by Anil Arya and Richard A. Young This handout sketches how to solve a linear programming problem using Excel. Suppose you wish to solve the following LP:

### Lecture Note on Linear Algebra 15. Dimension and Rank

Lecture Note on Linear Algebra 15. Dimension and Rank Wei-Shi Zheng, wszheng@ieee.org, 211 November 1, 211 1 What Do You Learn from This Note We still observe the unit vectors we have introduced in Chapter

### Linear Programming: Penn State Math 484 Lecture Notes. Christopher Griffin

Linear Programming: Penn State Math 484 Lecture Notes Version 1.8.3 Christopher Griffin 2009-2014 Licensed under a Creative Commons Attribution-Noncommercial-Share Alike 3.0 United States License With

### Generalized Inverse Computation Based on an Orthogonal Decomposition Methodology.

International Conference on Mathematical and Statistical Modeling in Honor of Enrique Castillo. June 28-30, 2006 Generalized Inverse Computation Based on an Orthogonal Decomposition Methodology. Patricia