A Survey of Software Packages for Teaching Linear and Integer Programming

Size: px
Start display at page:

Download "A Survey of Software Packages for Teaching Linear and Integer Programming"

Transcription

1 A Survey of Software Packages for Teaching Linear and Integer Programming By Sergio Toledo Spring 2018 In Partial Fulfillment of Math (or Stat) 4395-Senior Project Department of Mathematics and Statistics Faculty Advisor: Dr. Redl: Committee Member: Dr. Cahoy: Committee Member: Dr. Mhoon: Department Chair: Dr. Ryan Pepper

2 Table of Contents Abstract... 3 Introduction... 4 Body... 5 Software Used... 5 TORA... 7 R MATLAB Excel Integer Programming Conclusion Future Work References... 25

3 Abstract The purpose of the project was to survey a different number of software packages that can model and solve linear programming problems and choose the ideal software to teach students with in the Operations Research class being offered at UHD for the fall of 2018 semester. That includes integer and binary integer programming problems as well. The four software packages being surveyed are TORA, R, Excel, and MATLAB. These four were chosen because they have some degree of familiarity for students. TORA is the software that has been used in the past for the class and is also the software used to solve examples in the book used for the course. R is used in many statistics courses, MATLAB in some math, and Excel is something that all students should recognize. TORA is very easy to use, and data manipulation is also simple. Students can solve problems with a number of different algorithms, including the simple method that is a focal point of the class. R offers a wide variety of distinct functions that give varying results and details when solving optimization problems. MATLAB has the simplex function that can be used to solve linear programming problems, but integer and binary problems are a different story. Excel has a solver that allows students to solve all three problem types that is very easy to use and beneficial. In the end, all the software require a bit more work from the student to produce less than what TORA offers. Excel can be beneficial because the students would be able to set up the problems in ways that they can understand better when it comes to placing values. Even though, TORA is the best option, Excel can prove to be extremely beneficial early in the course.

4 Introduction Operations Research is a statistics course that involves making optimal decisions. Many different problem-solving techniques and methods are used to achieve the most efficient results. Linear, Integer, and Mixed Integer Programming problems are used to model and solve problems in operations research which makes them very pivotal topics for the class. Dr. Redl has taught the course in the past and has used the software TORA to solve these types of problems. For the most part, TORA has been useful teaching tool, but there is other software available that could be more beneficial for students learning experience. The best solving tool might not be the best teaching tool for the students and vice versa. The branch and bound method and the simplex method are two algorithms used to solve integer and linear programming problems respectively. It would be ideal to have a software that not just solves the problems but can better help the students understand these algorithms. There are many software packages that could be used to solve linear programming problems that could be evaluated in this project. I felt that I should keep the software that I will use to ones that the students can learn to use without too much effort in time. I also believe that I should assess software that the students have some familiarity with or have at least encountered in the past. Because of this, I decided to focus on Excel, MATLAB, and R in addition to TORA. As a statistics major, I have encountered every one of these and believe that the students who would end up enrolling in the operations research class will at the very least have used most if not all of them. Linear programming uses linear inequalities to model real world problems. The purpose is to find variables that will not only solve the inequalities but find the optimal solution. At times we will be trying to find the maximum values and other times we will search for the minimum. Graphing the inequalities will allow us to form what is called the feasible region. All the values

5 in this region are possible solutions, but only one will be the optimal solution. An important characteristic of the optimum LP solution is that it is always associated with a corner point of the solution space (Taha 18). If possible, it would be best to try find a software that will not only allow us to solve linear programming problems but allow us to also be able to display them graphically. The students can be better aided by the visual representations of these problems in addition to any algebraic methods that Dr. Redl will use. Over the course of this project, I will attempt to model and solve linear programming problems on different software to attempt to find an alternative to the software that is planned on being used in TORA. I will conduct this research knowing that TORA might very well be the best program available but felt that there was a possibility of finding an improvement. The course will be cross listed as both Math 4303 and Stat 4303, which will mean that I will have to take into account that students will not just be from the Statistics department. Ease of use for the students would also need to be a priority. It would not be advisable for Dr. Redl to use a different software that would require significant class time to be able to show the students how to use. If possible, it would be best to find a software that the students would be able to access from home. I will be modeling the acme glass co. problem in each software and discussing my experiences with each one. The acme glass co. problem is a simple two variable linear programming problem. Body Software Used There were four main software that I decided to focus on for the purpose of this project. TORA being the software used by Dr. Redl in his classes was the primary focus. It is a very useful teaching tool that I have used before in the Stat 4303 course. The software is extremely

6 easy to use but very basic with its user interface. The simplicity can be beneficial, but there is also room for improvements. A considerable number of courses in UHD use Microsoft Excel and it has a solver that can be used on linear programming problems. The solver is not installed in Excel by default. It is an add-in that can be installed in a matter of seconds. Taking a look at this solver could very well turn out to be beneficial because Excel is something that mostly every student in a math or statistics related course can be familiar with. It is also available at every computer on campus, which would undoubtedly be a great benefit for students. MATLAB can also be used to solve linear programming problems. There is a function named simplex that will allow students to plug in the coefficients of the problems and other significant values and get a solution with relative ease. Room s735 has the software installed in all its computers. That could be a room that students could go use if they do not have the software themselves since it is a product that would need to be purchased. Because R has been used in a number of different statistics courses that I have taken, I decided that it could be viewed as another option that could be assessed. Students could download the software on their personal computers if needed. Several linear programming problems were given to me by Dr. Redl that I will use to evaluate the different software. TORA and MATLAB files need to be specifically formatted so that the programs can read in the data correctly, but numbers can also be input without needing to reference a specific file. Difficulties inputting data or interpreting the solution outputs will be the key focus for assessing each program. The reason behind this is that I recognize that all of the programs will be capable of solving linear and integer programming problems. Because of this,

7 TORA serves its purpose well but there is chance that one of the other programs can be of more help to the students. TORA Having used TORA in the Decision Math course that Dr. Redl teaches, I became familiar with it and its user interface. I must admit that it does the job that one requires it to do, but it could be improved upon. Problems can either be uploaded via text documents or TORA will prompt the user to input each value manually. TORA requires the text files to be specifically formatted. It would take more effort on behalf of the students to create the text files instead of manual input. The textbook used for the course has a code that will not only allow the students to download TORA but will also include text files that are used in the chapters as examples. For any homework problems, the students would be required to solve, they would be better served manually inputting the different values. Luckily the manual input is easy to use. TORA asks for the number of variables and constraints so that it can generate a table where the user can insert the coefficients for the inequalities or equations. There are two options that the students will have when it comes to solution output. There will be a graphical solution available and an algebraic solution. The algebraic solution will allow the student to solve the problem using a number of different algorithms. The one that I want to focus on is the simplex method. The students can choose to get the final solution the first time of asking or viewing each iteration before receiving the final answer. Choosing to view the iterations, gives the students a tableau with the values that the simplex method chooses with each iteration. The students could solve the problem by hand and compare with the tableau so that they can be sure that they understand how the algorithm helps find the optimal solution. To better understand the user interface that TORA offers, I have placed several screenshots of the process of solving a linear programming problem. The example used is the

8 wyndoor problem; also called the acme glass co. problem. It involves a company that makes doors and windows. The profit is $3 and $5 for door and windows respectively. The values can be any multiple with the same ratio. 300 and 500 for example. We have three constraints in this problem. The constraints represent production plants and available hours to make the doors and windows. Each plant has different production times that represent the coefficients in the inequalities. The plants have certain number of hours available for production weekly. This is represented by the upper bound placed on these inequalities. Plant 1 cannot exceed 4 hours for example. Students can edit any of the values in the boxes colored in the darker blue. Doors and windows can be renamed. The inequalities can be changed to less than or greater than or equal as stated in the light blue column. Nothing in the light blue boxes can be changed other than the one that reads maximize. By clicking it, the problem can be changed in to a minimization problem. The students can then click on the solve menu button to choose their solution method.

9 As stated below, there are many options available to the students to solve the problems. The bounded simplex option is the preferred method for the class. The TORA output produced the tableau with three iterations. Having solved the problem by hand, the values I found for the solution were 0,30, and 36 for iterations 1, 2, and 3 respectively. The solution to the problem was 36 which was also shown by TORA. The solution requires 6 windows and 2 doors to be produced.

10 TORA also features a graphical solution for two-dimensional problems. Although the graphical output does not use the simplex method, having a visual representation of the problem can be of some benefit for the students. The graphical solution will allow the students to click on each constraint function to add it to the graph until the feasible region is clearly visible. They can then solve the problem and there will be an iso-profit line that will be shown moving across the graph until it finds the optimal solution. The figure above is the graphical solution to the wyndoor problem with 2 and 6 being the optimal values for the production of doors and windows. While the graph does not use the simplex method, it can prove to be a valuable tool for students looking to get some type of visual aid. The feasible region is still shown in the graph. The feasible region represents all the points that would be viable solutions to the problem according to the constraints given. Even though every point inside the feasible reason can be used, there is only one optimal solution and it is still shown by the graph.

11 R Solving the same problem with R is not as simple as just filling in some blanks or uploading a file. There are a number of different packages that have functions that can solve linear programming problems. The lpsolve and Rsymphony packages can both be used as well as the boot package. The boot package is the more useful of the three as it has a simplex function, while the others have functions that solve the problems with other means. The book Modeling and Solving Linear Programming with R provided some insight for this project. It was an open access book that anybody can download for free, which was a big bonus. The book is very brief but informative. It was made to be a short introduction into the world or linear programming with R. Unfortunately, the book does not use the boot package to solve the linear programming problems with R. It does give an explanation of the simplex method but does not show any functions used to solve the problems with the simplex method. The boot package seemed like the best option because of the simplex function included. The boot package needs to be installed and the library needs to be added with the following command: Four parameters need to be set for the simplex function. The first is a, a vector with the objective function values. For the wyndoor problem that is 3 and 5. Secondly A1, a matrix with the coefficients of the constraints on the left-hand side of the inequalities. The values need to be inserted from left to right, top to bottom. Third b1, a vector containing the right-hand side of the inequalities being the upper bound for the constraints. The function has a parameter named maxi that needs to be set to true if it is a maximization problem or false if minimizing. Leaving it blank will also default to minimization. It is important that A1 and b1 are specified. Having those

12 two parameters input into the function tells it that the inequalities are less than. If A2 and b2 are used, the function will set the inequalities to greater than. And A3 and b3 set the functions to equalities and not inequalities. Below is the code required to solve the wyndoor problem with the simplex function along with the output. The solution is found but no other information is given. There is no output showing the iterations of the simplex method. Students who have no previous experience with R might need some time to get used to the input method, but it is not a very rigorous process. They should be able to get into the flow of thins with practice. There is another called linprog that uses the simplex method to solve lp problems. The function solvelp provides a few more details in the output, although the input method is slightly different. I was able to use the same variables that I defined with the simplex function and input them in the solvelp function, but in a different order. The order of input is a, b1, and A1. The right-hand side of the inequalities is input before the left-hand side. The left-hand side can still be in matrix format for the function to read it. Another difference was that the signs for the inequalities need to be set inside another parameter named const.dir. This parameter is a vector

13 containing the signs of the inequalities in order of top to bottom. Below is the code that I used along with the output. The output for solvelp certainly gives a few more details than the simplex function. It gives us the solution, the values of the variables of the objective function, the values of the inequalities and how they satisfy the constraints, and the variables including the slack variables. It does not show the actual values obtained with each iteration but is a definite improvement over the

14 simplex function. Again, the input can take some getting used to on the part of the students, but it should not be something that they should struggle with for too long. As far as for the students learning about the simplex method, they can gain some insight with the solvelp function. The output is helpful in showing students how the solution satisfies the constraints. The solution shows how the first factory still has 2 hours free but making any more doors would result in violating some of the other constraints. There is definitely some potential with this specific package. The students could benefit from using a free open source program like R. It would allow them to install the program on any of their personal computers and it is also installed on most computers on campus. One of the drawbacks is the lack of packages that provide graphics for linear programming problems. There is a package called the intpoint package that provides function with a graphical solution, but it uses the interior point method, which is not something that is needed for the class. I have attached an image with code and the graphical output.

15 The graph does plot the linear equations but does not highlight the feasible region enough. It could prove to be useful, but the students could end up somewhat confused by the added points on the inside along with the pattern. The output also shows instead of 36 which could be detrimental to the students learning experience. MATLAB MATLAB is another option that the students have at their disposal on many of the computers on campus. It is a pay to use software if the students would like to have it on their personal computers, but the availability could make that unnecessary. There is a simplex function that Dr. Redl could send the students to use to solve the problems on their own. It solves the problems and produces a tableau somewhat similar to the one provided by TORA. The function is very similar to the solvelp function used in R as far as the numerical input goes. A

16 vector with the coefficients of the objective function is entered first. That is followed by a vector with the right-hand side of the inequalities and a matric with the coefficients of the left-hand side of the inequalities. There is also the parameter inq that is similar to the const.dir variable in the solvelp function. Inq is a vector with the sign of the inequalities or equations. Using the acme problem, the signs for all three constraints is <=. Instead of inputting the sign directly, a -1 is entered to imply less than. The last parameter is set to 0 if the problem needs to be maximized and 1 if it needs to be minimized. Below I have attached screenshots with the code and the tableau that was printed.

17 As shown in the second tableau below, the values are in scientific notation. It is not ideal, but the students should have no problem interpreting the output. The only issue the students might have with the tableau is that it is displayed using scientific notation. The particular file had values of 3000 and 5000 instead of 3 and 5 making the optimal value instead of 36. The same solution for the number of doors and windows to be produced was still achieved. The students should have very little problem with using the simplex function on MATLAB and the tableau could be very useful in Dr. Redl s lectures. The drawback is the lack of graphics packages available for linear programming. The students would have to be fairly competent with MATLAB to even be able to produce a graph with the feasible region highlighted.

18 Excel Excel is the final software I decided to assess in this project. It is something that every student should feel familiar with whether they be statistics or math majors taking the course. Most if not all students should also have access to Excel as it is available on all the computers on campus. There is a solver ad-in that the students can install to help them solve linear programming problems. Students can access this solver by going to their options on the file tab. There is a tab named Add-ins that they click on and that will display a list of the add-ins with the solver being the last one. There is a manage add ins option on the bottom with a button saying go. The students can click on after that, they can click on the check box next to the solver and press ok. After doing all that, the solver add in is added to the data tab in the analyze section. The students will need to set up each problem specifically to use the solver however. They can place the values in any format they like, but when using the solver, they need to make sure that they highlight the correct values. I set up the values for the objective function on top with the inequality constraints under. I also labeled a column as used to show how many hours will be used in each factory when the solver

19 gives us the solutions. Batches produced is set to 0 but will change once the solver finds the solution to the number of doors and windows to produce along with the optimal profit to be made. The sumproduct function will be used to calculate the hours used to make the doors and windows. As shown in the image, D7 will equal to B7*B13+C7*C13. Once the solver finds the number of products to make, the value will be updated to show that it satisfies the constraint given. To use the solver, the student will click on the solver and a panel will open up asking for the objective, decision variables, and the constraints. It will also have options to maximize, minimize, or set a specific value. It also allows the user to specify the solving method, set unconstrained values to nonnegative and even show the results of the iterations. The objective is the profit we want to maximize in cell D13. Changing variable cells will be decision variables that will increase to show the number of doors and windows to make in cells B13 and C13. We can add constraints with the add button and we must simply highlight the

20 region D7-D9 on the left and F7-F9 on the right. We can highlight the region because the inequality constraints al have the same sign. If we had other constraints with different signs, we would have to add them individually cell by cell. Pressing ok takes the user back to the main solver panel, while pressing add will allow the user to keep adding more constraints if needed. After that, we can solve and receive the solution. Showing the iterations will produce the following results:

21 We have 30 as the first possible solution to satisfy the constraints by making no doors and 6 windows. We click continue to check whether there is a better solution and we get a profit of 36 with 2 doors and 6 windows produced. We again click continue to see if there is a better solution and we get the following output: A profit of 36 is the optimal solution and the iterations come to an end. The excel solver is a great tool because of the display of iterations along with the values produced. The constraint

22 drop down list for the signs also allows the user to set integer constraints to turn the problem into an integer programming problem. It seems that there are many benefits to using excel to help students understand the iterative nature of linear programming. The fact that the students must set up the problem properly could be time consuming, but it could also help the students understand what is going on with the problem itself and what the solver is doing to get an optimal solution. Their understanding of the process would improve by setting up each problem. Integer Programming As far as integer programming, much of the process is the same when it comes to using TORA. The student can first click on the integer programming option in the main menu and that will take them to same input screen as the linear programming with the integer box set to yes. Students can also set the upper bound to 1 so that they can make the problem a binary integer programming problem. This models decision making problems like whether or not to make and investment. There are no graphical solutions available in TORA for integer programming. The

23 students can solve the problems using the branch and bound method. This method splits the feasible region into smaller subsets and evaluates them to find the optimal solution. The students have the option to guide the software when solving the problem or to obtain the solution immediately. This is a big help as the students can practice their knowledge of the algorithm when branching the feasible solutions. The lp function in the lpsolve package can be used to solve integer programming problems in R. The function itself is similar to the other functions that solve linear programming problems. The parameters can all be entered the same way. It has a few more parameters that are very important. The int.vec parameter is entered as a vector with the indices of the variables that need to be integer. There is also the all.int parameter that can be set to true when all the variables are required to be integer. The same goes for binary as there are parameters binary.vec and all.bin that function the same way as the two stated above. The optimal value is output. MATLAB didn t offer any ready-made functions for solving integer programming problems. Luckily Excel does have the option. As stated previously, when entering the constraints in the solver, there is a drop-down menu that also has int and bin options. The variables that need to be integer or binary are simply highlighted and Excel can solve it with no problem. Conclusion Each of the four software used can help the students solve the linear programming problems for the operations research class, but not all of them give them the same results. Regarding R, the solvelp function produces the best set of results and details out of all the functions found in the different packages available to R. Most statistics students should be somewhat familiar with R and the interface it provides that they should not struggle too much if

24 they needed to use it. Math majors might find things more difficult at the beginning, but R is very simple to use, and they would not have to deal with a great number of different packages to be overwhelmed. There are limited options to graph the linear programming problems and the ones available have unnecessary information that the students will not need and that could possibly confuse them. MATLAB is a good option because it is used throughout various courses offered at UHD. The tableau can give students insight into the simplex method and the different solutions that are achieved with each iteration. Something that the packages in R do not provide. A small drawback is that students would not be able to download the software onto their own personal computer without having to spend some money. The biggest drawbacks are the lack of graphics packages and binary integer programming solving functions. Excel is an excellent alternative to TORA because of the familiarity that the students would have in using it. I would imagine that at this stage, every undergraduate student has used Excel at one point. Setting up the problems might be more time consuming than the other software, but it would also allow the students to grasp some concepts behind the processes used to solve the linear programming problems. Being able to so freely manipulate the data is also a big plus as is the display of iterations and integer constraint options. In conclusion, any one of these software packages could be a worthy replacement for TORA. But in the end, TORA offers the best ease of use. The students can upload files given to them or simply input the corresponding values into the correct boxes. The simplicity will allow the students to not have to focus on how to use different software and relay all their attention to learning about the different algorithms used to solve the linear programming problems. The TORA output will not only solve the problems but display the information attained with each

25 iteration in a tableau. Students can choose between integer and regular linear programming and they can even produce graphs for two dimensional problems that highlight the feasible region for the problems. The fact that the author of the textbook that will be used in the operations research class is the creator of TORA is a big plus. The download for the software will come with files containing examples used throughout the book. There is some room for improvement for TORA, but it is a more specialized software for linear programming compared to all the other software surveyed making it the best option available at this point. One recommendation is to use Excel when first teaching the students linear programming so that setting up the problem in a way that they understand can help them get a better grasp of the subject. Once the students are comfortable with solving, they could use TORA to input problems and get solutions without using up too much time. Future Work There are two other software packages that would be worth taking a look at in the near future. The first of those is the Gurobi optimizer. Gurobi has a solver for optimization problems and has functionalities with C++, Python, R, Excel, C, MATLAB and Java. The fact that the software can be used with other environments and software could make it an invaluable resource in the future. There is also the Julia language. Julia is a high-level programming language that is increasingly used in the data science community. It is also capable of solving optimization problems and I hope to be able to work with it over the summer of 2018 to get more insight on the language. References Operations Research: An Introduction (8th Edition)-Taha

26 Modeling and Solving Linear Programming with R Sallan Models: Linear Programming Terminology Decision Support Models: Linear Programming I 20week%2011a.pdf

NOTATION AND TERMINOLOGY

NOTATION AND TERMINOLOGY 15.053x, Optimization Methods in Business Analytics Fall, 2016 October 4, 2016 A glossary of notation and terms used in 15.053x Weeks 1, 2, 3, 4 and 5. (The most recent week's terms are in blue). NOTATION

More information

Solving linear programming

Solving linear programming Solving linear programming (From Last week s Introduction) Consider a manufacturer of tables and chairs. They want to maximize profits. They sell tables for a profit of $30 per table and a profit of $10

More information

Introduction. Linear because it requires linear functions. Programming as synonymous of planning.

Introduction. Linear because it requires linear functions. Programming as synonymous of planning. LINEAR PROGRAMMING Introduction Development of linear programming was among the most important scientific advances of mid-20th cent. Most common type of applications: allocate limited resources to competing

More information

Let s start by examining an Excel worksheet for the linear programming. Maximize P 70x 120y. subject to

Let s start by examining an Excel worksheet for the linear programming. Maximize P 70x 120y. subject to Excel is a useful tool for solving linear programming problems. In this question we ll solve and analyze our manufacturing problem with Excel. Although this problem can easily be solved graphically or

More information

Ahigh school curriculum in Algebra 2 contains both solving systems of linear equations,

Ahigh school curriculum in Algebra 2 contains both solving systems of linear equations, The Simplex Method for Systems of Linear Inequalities Todd O. Moyer, Towson University Abstract: This article details the application of the Simplex Method for an Algebra 2 class. Students typically learn

More information

Fundamentals of Operations Research. Prof. G. Srinivasan. Department of Management Studies. Indian Institute of Technology Madras.

Fundamentals of Operations Research. Prof. G. Srinivasan. Department of Management Studies. Indian Institute of Technology Madras. Fundamentals of Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology Madras Lecture No # 06 Simplex Algorithm Initialization and Iteration (Refer Slide

More information

Some Advanced Topics in Linear Programming

Some Advanced Topics in Linear Programming Some Advanced Topics in Linear Programming Matthew J. Saltzman July 2, 995 Connections with Algebra and Geometry In this section, we will explore how some of the ideas in linear programming, duality theory,

More information

BACK TO MATH LET S START EASY.

BACK TO MATH LET S START EASY. BACK TO MATH LET S START EASY. Of all rectangles of the same perimeter, which one has the largest area? (Yes, you have all solved this problem before, in Calc I. Apologies if this insults your intelligence.

More information

Simulation. Lecture O1 Optimization: Linear Programming. Saeed Bastani April 2016

Simulation. Lecture O1 Optimization: Linear Programming. Saeed Bastani April 2016 Simulation Lecture O Optimization: Linear Programming Saeed Bastani April 06 Outline of the course Linear Programming ( lecture) Integer Programming ( lecture) Heuristics and Metaheursitics (3 lectures)

More information

Section Notes 4. Duality, Sensitivity, and the Dual Simplex Algorithm. Applied Math / Engineering Sciences 121. Week of October 8, 2018

Section Notes 4. Duality, Sensitivity, and the Dual Simplex Algorithm. Applied Math / Engineering Sciences 121. Week of October 8, 2018 Section Notes 4 Duality, Sensitivity, and the Dual Simplex Algorithm Applied Math / Engineering Sciences 121 Week of October 8, 2018 Goals for the week understand the relationship between primal and dual

More information

EASTERN ARIZONA COLLEGE Finite Mathematics

EASTERN ARIZONA COLLEGE Finite Mathematics EASTERN ARIZONA COLLEGE Finite Mathematics Course Design 2015-2016 Course Information Division Mathematics Course Number MAT 171 Title Finite Mathematics Credits 4 Developed by Jay Clarke/Revised by Ray

More information

Advanced Operations Research Techniques IE316. Quiz 1 Review. Dr. Ted Ralphs

Advanced Operations Research Techniques IE316. Quiz 1 Review. Dr. Ted Ralphs Advanced Operations Research Techniques IE316 Quiz 1 Review Dr. Ted Ralphs IE316 Quiz 1 Review 1 Reading for The Quiz Material covered in detail in lecture. 1.1, 1.4, 2.1-2.6, 3.1-3.3, 3.5 Background material

More information

An introduction to pplex and the Simplex Method

An introduction to pplex and the Simplex Method An introduction to pplex and the Simplex Method Joanna Bauer Marc Bezem Andreas Halle November 16, 2012 Abstract Linear programs occur frequently in various important disciplines, such as economics, management,

More information

Math 2524: Activity 1 (Using Excel) Fall 2002

Math 2524: Activity 1 (Using Excel) Fall 2002 Math 2524: Activity 1 (Using Excel) Fall 22 Often in a problem situation you will be presented with discrete data rather than a function that gives you the resultant data. You will use Microsoft Excel

More information

Chapter 15 Introduction to Linear Programming

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

More information

Lesson 08 Linear Programming

Lesson 08 Linear Programming Lesson 08 Linear Programming A mathematical approach to determine optimal (maximum or minimum) solutions to problems which involve restrictions on the variables involved. 08 - Linear Programming Applications

More information

Farming Example. Lecture 22. Solving a Linear Program. withthe Simplex Algorithm and with Excel s Solver

Farming Example. Lecture 22. Solving a Linear Program. withthe Simplex Algorithm and with Excel s Solver Lecture 22 Solving a Linear Program withthe Simplex Algorithm and with Excel s Solver m j winter, 2 Farming Example Constraints: acreage: x + y < money: x + 7y < 6 time: x + y < 3 y x + y = B (, 8.7) x

More information

Unit.9 Integer Programming

Unit.9 Integer Programming Unit.9 Integer Programming Xiaoxi Li EMS & IAS, Wuhan University Dec. 22-29, 2016 (revised) Operations Research (Li, X.) Unit.9 Integer Programming Dec. 22-29, 2016 (revised) 1 / 58 Organization of this

More information

MEI Conference 2009: D2

MEI Conference 2009: D2 D Networks MEI Conference 009: D Travelling Salesperson Problem 7 A B Route Inspection Problems (Chinese Postman) () A 7 B () 4 () C Identify the odd vertices in the network Consider all the routes joining

More information

Chapter 3: Towards the Simplex Method for Efficient Solution of Linear Programs

Chapter 3: Towards the Simplex Method for Efficient Solution of Linear Programs Chapter 3: Towards the Simplex Method for Efficient Solution of Linear Programs The simplex method, invented by George Dantzig in 1947, is the basic workhorse for solving linear programs, even today. While

More information

P a g e 1. MathCAD VS MATLAB. A Usability Comparison. By Brian Tucker

P a g e 1. MathCAD VS MATLAB. A Usability Comparison. By Brian Tucker P a g e 1 MathCAD VS MATLAB A Usability Comparison By Brian Tucker P a g e 2 Table of Contents Introduction... 3 Methodology... 3 Tasks... 3 Test Environment... 3 Evaluative Criteria/Rating Scale... 4

More information

Math 20 Practice Exam #2 Problems and Their Solutions!

Math 20 Practice Exam #2 Problems and Their Solutions! Math 20 Practice Exam #2 Problems and Their Solutions! #1) Solve the linear system by graphing: Isolate for in both equations. Graph the two lines using the slope-intercept method. The two lines intersect

More information

Chapter II. Linear Programming

Chapter II. Linear Programming 1 Chapter II Linear Programming 1. Introduction 2. Simplex Method 3. Duality Theory 4. Optimality Conditions 5. Applications (QP & SLP) 6. Sensitivity Analysis 7. Interior Point Methods 1 INTRODUCTION

More information

For many people, learning any new computer software can be an anxietyproducing

For many people, learning any new computer software can be an anxietyproducing 1 Getting to Know Stata 12 For many people, learning any new computer software can be an anxietyproducing task. When that computer program involves statistics, the stress level generally increases exponentially.

More information

Name: THE SIMPLEX METHOD: STANDARD MAXIMIZATION PROBLEMS

Name: THE SIMPLEX METHOD: STANDARD MAXIMIZATION PROBLEMS Name: THE SIMPLEX METHOD: STANDARD MAXIMIZATION PROBLEMS A linear programming problem consists of a linear objective function to be maximized or minimized subject to certain constraints in the form of

More information

Linear Programming Terminology

Linear Programming Terminology Linear Programming Terminology The carpenter problem is an example of a linear program. T and B (the number of tables and bookcases to produce weekly) are decision variables. The profit function is an

More information

Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras

Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture 18 All-Integer Dual Algorithm We continue the discussion on the all integer

More information

GNU OCTAVE BEGINNER'S GUIDE BY JESPER SCHMIDT HANSEN DOWNLOAD EBOOK : GNU OCTAVE BEGINNER'S GUIDE BY JESPER SCHMIDT HANSEN PDF

GNU OCTAVE BEGINNER'S GUIDE BY JESPER SCHMIDT HANSEN DOWNLOAD EBOOK : GNU OCTAVE BEGINNER'S GUIDE BY JESPER SCHMIDT HANSEN PDF GNU OCTAVE BEGINNER'S GUIDE BY JESPER SCHMIDT HANSEN DOWNLOAD EBOOK : GNU OCTAVE BEGINNER'S GUIDE BY JESPER SCHMIDT HANSEN PDF Click link bellow and free register to download ebook: GNU OCTAVE BEGINNER'S

More information

Optimization Methods in Management Science

Optimization Methods in Management Science Problem Set Rules: Optimization Methods in Management Science MIT 15.053, Spring 2013 Problem Set 6, Due: Thursday April 11th, 2013 1. Each student should hand in an individual problem set. 2. Discussing

More information

A hard integer program made easy by lexicography

A hard integer program made easy by lexicography Noname manuscript No. (will be inserted by the editor) A hard integer program made easy by lexicography Egon Balas Matteo Fischetti Arrigo Zanette February 16, 2011 Abstract A small but notoriously hard

More information

Linear programming II João Carlos Lourenço

Linear programming II João Carlos Lourenço Decision Support Models Linear programming II João Carlos Lourenço joao.lourenco@ist.utl.pt Academic year 2012/2013 Readings: Hillier, F.S., Lieberman, G.J., 2010. Introduction to Operations Research,

More information

Implicit Function Explorations

Implicit Function Explorations Activities with Implicit Functions and Implicit Differentiation on the TI-89/Voyage 00 Dennis Pence Western Michigan University Kalamazoo, Michigan USA Abstract: Unfortunately the topic of implicit differentiation

More information

Skill 1: Multiplying Polynomials

Skill 1: Multiplying Polynomials CS103 Spring 2018 Mathematical Prerequisites Although CS103 is primarily a math class, this course does not require any higher math as a prerequisite. The most advanced level of mathematics you'll need

More information

16.410/413 Principles of Autonomy and Decision Making

16.410/413 Principles of Autonomy and Decision Making 16.410/413 Principles of Autonomy and Decision Making Lecture 17: The Simplex Method Emilio Frazzoli Aeronautics and Astronautics Massachusetts Institute of Technology November 10, 2010 Frazzoli (MIT)

More information

Week - 01 Lecture - 04 Downloading and installing Python

Week - 01 Lecture - 04 Downloading and installing Python Programming, Data Structures and Algorithms in Python Prof. Madhavan Mukund Department of Computer Science and Engineering Indian Institute of Technology, Madras Week - 01 Lecture - 04 Downloading and

More information

Discrete Optimization. Lecture Notes 2

Discrete Optimization. Lecture Notes 2 Discrete Optimization. Lecture Notes 2 Disjunctive Constraints Defining variables and formulating linear constraints can be straightforward or more sophisticated, depending on the problem structure. The

More information

Lastly, in case you don t already know this, and don t have Excel on your computers, you can get it for free through IT s website under software.

Lastly, in case you don t already know this, and don t have Excel on your computers, you can get it for free through IT s website under software. Welcome to Basic Excel, presented by STEM Gateway as part of the Essential Academic Skills Enhancement, or EASE, workshop series. Before we begin, I want to make sure we are clear that this is by no means

More information

INSPIRE and SPIRES Log File Analysis

INSPIRE and SPIRES Log File Analysis INSPIRE and SPIRES Log File Analysis Cole Adams Science Undergraduate Laboratory Internship Program Wheaton College SLAC National Accelerator Laboratory August 5, 2011 Prepared in partial fulfillment of

More information

Real life Problem. Review

Real life Problem. Review Linear Programming The Modelling Cycle in Decision Maths Accept solution Real life Problem Yes No Review Make simplifying assumptions Compare the solution with reality is it realistic? Interpret the solution

More information

Prepared By. Handaru Jati, Ph.D. Universitas Negeri Yogyakarta.

Prepared By. Handaru Jati, Ph.D. Universitas Negeri Yogyakarta. Prepared By Handaru Jati, Ph.D Universitas Negeri Yogyakarta handaru@uny.ac.id Chapter 8 Using The Excel Solver To Solve Mathematical Programs Chapter Overview 8.1 Introduction 8.2 Formulating Mathematical

More information

Chapter 7. Linear Programming Models: Graphical and Computer Methods

Chapter 7. Linear Programming Models: Graphical and Computer Methods Chapter 7 Linear Programming Models: Graphical and Computer Methods To accompany Quantitative Analysis for Management, Eleventh Edition, by Render, Stair, and Hanna Power Point slides created by Brian

More information

MLR Institute of Technology

MLR Institute of Technology Course Name : Engineering Optimization Course Code : 56021 Class : III Year Branch : Aeronautical Engineering Year : 2014-15 Course Faculty : Mr Vamsi Krishna Chowduru, Assistant Professor Course Objective

More information

Graphical Methods in Linear Programming

Graphical Methods in Linear Programming Appendix 2 Graphical Methods in Linear Programming We can use graphical methods to solve linear optimization problems involving two variables. When there are two variables in the problem, we can refer

More information

Linear Programming. them such that they

Linear Programming. them such that they Linear Programming l Another "Sledgehammer" in our toolkit l Many problems fit into the Linear Programming approach l These are optimization tasks where both the constraints and the objective are linear

More information

Introduction to Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras

Introduction to Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Introduction to Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Module - 05 Lecture - 24 Solving LPs with mixed type of constraints In the

More information

Chapter 4: The Mechanics of the Simplex Method

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

Extensions of Semidefinite Coordinate Direction Algorithm. for Detecting Necessary Constraints to Unbounded Regions

Extensions of Semidefinite Coordinate Direction Algorithm. for Detecting Necessary Constraints to Unbounded Regions Extensions of Semidefinite Coordinate Direction Algorithm for Detecting Necessary Constraints to Unbounded Regions Susan Perrone Department of Mathematics and Statistics Northern Arizona University, Flagstaff,

More information

(Refer Slide Time: 01.26)

(Refer Slide Time: 01.26) Data Structures and Algorithms Dr. Naveen Garg Department of Computer Science and Engineering Indian Institute of Technology, Delhi Lecture # 22 Why Sorting? Today we are going to be looking at sorting.

More information

x Boundary Intercepts Test (0,0) Conclusion 2x+3y=12 (0,4), (6,0) 0>12 False 2x-y=2 (0,-2), (1,0) 0<2 True

x Boundary Intercepts Test (0,0) Conclusion 2x+3y=12 (0,4), (6,0) 0>12 False 2x-y=2 (0,-2), (1,0) 0<2 True MATH 34 (Finite Mathematics or Business Math I) Lecture Notes MATH 34 Module 3 Notes: SYSTEMS OF INEQUALITIES & LINEAR PROGRAMMING 3. GRAPHING SYSTEMS OF INEQUALITIES Simple Systems of Linear Inequalities

More information

Introduction to Mathematical Programming IE496. Final Review. Dr. Ted Ralphs

Introduction to Mathematical Programming IE496. Final Review. Dr. Ted Ralphs Introduction to Mathematical Programming IE496 Final Review Dr. Ted Ralphs IE496 Final Review 1 Course Wrap-up: Chapter 2 In the introduction, we discussed the general framework of mathematical modeling

More information

CSE200 Lecture 6: RECURSION

CSE200 Lecture 6: RECURSION Table of Contents Review of functions (using factorial example)... 1 Recursion... 1 Step by step run through of recursive factorial... 2 Recursion vs. iteration (for and while loops)... 3 Helper functions:...

More information

WEEK 4 REVIEW. Graphing Systems of Linear Inequalities (3.1)

WEEK 4 REVIEW. Graphing Systems of Linear Inequalities (3.1) WEEK 4 REVIEW Graphing Systems of Linear Inequalities (3.1) Linear Programming Problems (3.2) Checklist for Exam 1 Review Sample Exam 1 Graphing Linear Inequalities Graph the following system of inequalities.

More information

Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras

Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture 16 Cutting Plane Algorithm We shall continue the discussion on integer programming,

More information

Textbook Inventory Cycle

Textbook Inventory Cycle 2016-17 Textbook Inventory Cycle How to check your progress and generate Destiny reports: Once inside Destiny, the go-to report is going to be the Lost Textbooks and Fines report. This can be found under

More information

Finite Math Linear Programming 1 May / 7

Finite Math Linear Programming 1 May / 7 Linear Programming Finite Math 1 May 2017 Finite Math Linear Programming 1 May 2017 1 / 7 General Description of Linear Programming Finite Math Linear Programming 1 May 2017 2 / 7 General Description of

More information

How to complete the SPC Clinical Faculty Evaluation Form Summer 2016 Spring 2017

How to complete the SPC Clinical Faculty Evaluation Form Summer 2016 Spring 2017 How to complete the SPC Clinical Faculty Evaluation Form Summer 2016 Spring 2017 Logging into Faculty180 To log into Faculty180, visit http://www.data180.com/faculty180/spcollege Single sign-on has been

More information

Giapetto s Woodcarving Problem

Giapetto s Woodcarving Problem MTE 503-1 Computer Technology in Mathematics Education TI Worksheet Ezgi ÇALLI Class level: 9-10 Objectives: IGCSE (0607-Extended, 2014): (Extension to) 7.7. Linear inequalities on the Cartesian plane

More information

Graphical Analysis. Figure 1. Copyright c 1997 by Awi Federgruen. All rights reserved.

Graphical Analysis. Figure 1. Copyright c 1997 by Awi Federgruen. All rights reserved. Graphical Analysis For problems with 2 variables, we can represent each solution as a point in the plane. The Shelby Shelving model (see the readings book or pp.68-69 of the text) is repeated below for

More information

GRAPHING LINEAR INEQUALITIES AND FEASIBLE REGIONS

GRAPHING LINEAR INEQUALITIES AND FEASIBLE REGIONS SECTION 3.1: GRAPHING LINEAR INEQUALITIES AND FEASIBLE REGIONS We start with a reminder of the smart way to graph a Linear Equation for the typical example we see in this course, namely using BOTH X- and

More information

Orientation Assignment for Statistics Software (nothing to hand in) Mary Parker,

Orientation Assignment for Statistics Software (nothing to hand in) Mary Parker, Orientation to MINITAB, Mary Parker, mparker@austincc.edu. Last updated 1/3/10. page 1 of Orientation Assignment for Statistics Software (nothing to hand in) Mary Parker, mparker@austincc.edu When you

More information

Introduction to Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras

Introduction to Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Introduction to Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Module 03 Simplex Algorithm Lecture - 03 Tabular form (Minimization) In this

More information

Linear Programming: Model Formulation and Graphical Solution

Linear Programming: Model Formulation and Graphical Solution Linear Programming: Model Formulation and Graphical Solution Chapter 2 Chapter Topics Model Formulation A Maximization Model Example Graphical Solutions of Linear Programming Models A Minimization Model

More information

RenWeb Training. Creating Your Classroom Website

RenWeb Training. Creating Your Classroom Website RenWeb Training Creating Your Classroom Website October 2013 RenWeb Training Manual Table of Contents Ren Web Survey 3 Pre-Training Handout: Saving a Document as a PDF 4 Lesson 1: Adding Homework & Web

More information

CHAPTER 11: BASIC LINEAR PROGRAMMING CONCEPTS

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

More information

Linear Programming the simple Wyndor Glass example

Linear Programming the simple Wyndor Glass example Linear Programming the simple Wyndor Glass example tks@imm.dtu.dk Informatics and Mathematical Modeling Technical University of Denmark 1 Outline Abbreviations LP parts: Decision variables Objective function

More information

Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras

Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture - 35 Quadratic Programming In this lecture, we continue our discussion on

More information

How to complete the SPC Adjunct Faculty Evaluation Form Summer 2017 Spring 2018

How to complete the SPC Adjunct Faculty Evaluation Form Summer 2017 Spring 2018 How to complete the SPC Adjunct Faculty Evaluation Form Summer 2017 Spring 2018 Logging into Faculty180 Before logging in, make sure to be using Google Chrome as this is the official browser supported

More information

Ryerson Polytechnic University Department of Mathematics, Physics, and Computer Science Final Examinations, April, 2003

Ryerson Polytechnic University Department of Mathematics, Physics, and Computer Science Final Examinations, April, 2003 Ryerson Polytechnic University Department of Mathematics, Physics, and Computer Science Final Examinations, April, 2003 MTH 503 - Operations Research I Duration: 3 Hours. Aids allowed: Two sheets of notes

More information

TMA946/MAN280 APPLIED OPTIMIZATION. Exam instructions

TMA946/MAN280 APPLIED OPTIMIZATION. Exam instructions Chalmers/GU Mathematics EXAM TMA946/MAN280 APPLIED OPTIMIZATION Date: 03 05 28 Time: House V, morning Aids: Text memory-less calculator Number of questions: 7; passed on one question requires 2 points

More information

Memorandum Participants Method

Memorandum Participants Method Memorandum To: Elizabeth Pass, Associate Professor, School of Writing, Rhetoric and Technical Communication From: Andrew Carnes, WRTC 456 Section 1[ADC] Date: February 2, 2016 Re: Project 1 Competitor

More information

c) How many students took none of the three subjects?

c) How many students took none of the three subjects? 9 Final Fall 7 []. EVALUATE EACH OF THE FOLLOWING. SHOW ALL WORK. SIMPLIFY YOUR ANSWERS TO A SINGLE INTEGER. A) 6! 4! B) C ( 7, 4) C) P ( 9,4) []. In a recent survey of a senior class of 4 students the

More information

Math Introduction to Operations Research

Math Introduction to Operations Research Math 300 Introduction to Operations Research Examination (50 points total) Solutions. (6 pt total) Consider the following linear programming problem: Maximize subject to and x, x, x 3 0. 3x + x + 5x 3

More information

Mathematical and Algorithmic Foundations Linear Programming and Matchings

Mathematical and Algorithmic Foundations Linear Programming and Matchings Adavnced Algorithms Lectures Mathematical and Algorithmic Foundations Linear Programming and Matchings Paul G. Spirakis Department of Computer Science University of Patras and Liverpool Paul G. Spirakis

More information

CITS2401 Computer Analysis & Visualisation

CITS2401 Computer Analysis & Visualisation FACULTY OF ENGINEERING, COMPUTING AND MATHEMATICS CITS2401 Computer Analysis & Visualisation SCHOOL OF COMPUTER SCIENCE AND SOFTWARE ENGINEERING Topic 3 Introduction to Matlab Material from MATLAB for

More information

I will illustrate the concepts using the example below.

I will illustrate the concepts using the example below. Linear Programming Notes More Tutorials at www.littledumbdoctor.com Linear Programming Notes I will illustrate the concepts using the example below. A farmer plants two crops, oats and corn, on 100 acres.

More information

Heuristic Evaluation Project

Heuristic Evaluation Project INFSCI 2470: Interactive System Design Heuristic Evaluation Project Evaluated System: Course Agent http://wwwsispittedu/~cagent Group Members Abdul Raqeeb Abdul Azeez Arash Farsi Sriranjani Mandayam Denis

More information

Linear Programming. Linear programming provides methods for allocating limited resources among competing activities in an optimal way.

Linear Programming. Linear programming provides methods for allocating limited resources among competing activities in an optimal way. University of Southern California Viterbi School of Engineering Daniel J. Epstein Department of Industrial and Systems Engineering ISE 330: Introduction to Operations Research - Deterministic Models Fall

More information

Using Linear Programming for Management Decisions

Using Linear Programming for Management Decisions Using Linear Programming for Management Decisions By Tim Wright Linear programming creates mathematical models from real-world business problems to maximize profits, reduce costs and allocate resources.

More information

TOOLS AND TECHNIQUES FOR TEST-DRIVEN LEARNING IN CS1

TOOLS AND TECHNIQUES FOR TEST-DRIVEN LEARNING IN CS1 TOOLS AND TECHNIQUES FOR TEST-DRIVEN LEARNING IN CS1 ABSTRACT Test-Driven Development is a design strategy where a set of tests over a class is defined prior to the implementation of that class. The goal

More information

How to complete the SPC Full-time Evaluation Form Summer 2018 Spring 2019

How to complete the SPC Full-time Evaluation Form Summer 2018 Spring 2019 How to complete the SPC Full-time Evaluation Form Summer 2018 Spring 2019 Logging into Faculty180 Before logging in, make sure to be using Google Chrome as this is the official browser supported by Faculty180.

More information

Optimization of Design. Lecturer:Dung-An Wang Lecture 8

Optimization of Design. Lecturer:Dung-An Wang Lecture 8 Optimization of Design Lecturer:Dung-An Wang Lecture 8 Lecture outline Reading: Ch8 of text Today s lecture 2 8.1 LINEAR FUNCTIONS Cost Function Constraints 3 8.2 The standard LP problem Only equality

More information

5. 2 Too Big, or Not Too Big, That Is the Question. A Solidify Understanding Task

5. 2 Too Big, or Not Too Big, That Is the Question. A Solidify Understanding Task 6 SECONDARY MATH I // MODULE 5 That Is the Question A Solidify Understanding Task As Carlos is considering the amount of money available for purchasing cat pens and dog runs (see below) he realizes that

More information

Preface A Brief History Pilot Test Results

Preface A Brief History Pilot Test Results Preface A Brief History In Fall, 2005, Wanda Dann and Steve Cooper, originators of the Alice approach for introductory programming (in collaboration with Randy Pausch), met with Barb Ericson and Mark Guzdial,

More information

MINUTES Date 5/7/2015. Monthly Faculty Meeting Department of Electrical Engineering

MINUTES Date 5/7/2015. Monthly Faculty Meeting Department of Electrical Engineering Monthly Faculty Meeting Department of Electrical Engineering Present: Roger Dougal, Chair Andrea Benigni Charles Brice MVS chandrashekhar Yinchao Chen Herbert Ginn Asif Khan Krishna Mandal Enrico Santi

More information

Civil Engineering Computation

Civil Engineering Computation Civil Engineering Computation First Steps in VBA Homework Evaluation 2 1 Homework Evaluation 3 Based on this rubric, you may resubmit Homework 1 and Homework 2 (along with today s homework) by next Monday

More information

Split-Plot General Multilevel-Categoric Factorial Tutorial

Split-Plot General Multilevel-Categoric Factorial Tutorial DX10-04-1-SplitPlotGen Rev. 1/27/2016 Split-Plot General Multilevel-Categoric Factorial Tutorial Introduction In some experiment designs you must restrict the randomization. Otherwise it wouldn t be practical

More information

Internet Resource Guide: Penn State Undergraduate Mechanical Engineers

Internet Resource Guide: Penn State Undergraduate Mechanical Engineers Internet Resource Guide: Penn State Undergraduate Mechanical Engineers Matt Murphy February 12, 2015 English 202C Technical Communications Table of Contents 1.0 Front Matter 1.1. Contents of Guide 2 1.2.

More information

Linear Programming: Model Formulation and Graphical Solution

Linear Programming: Model Formulation and Graphical Solution Linear Programming: Model Formulation and Graphical Solution Chapter 2 2-1 Chapter Topics Model Formulation A Maximization Model Example Graphical Solutions of Linear Programming Models A Minimization

More information

CSC 8301 Design & Analysis of Algorithms: Linear Programming

CSC 8301 Design & Analysis of Algorithms: Linear Programming CSC 8301 Design & Analysis of Algorithms: Linear Programming Professor Henry Carter Fall 2016 Iterative Improvement Start with a feasible solution Improve some part of the solution Repeat until the solution

More information

MAT 003 Brian Killough s Instructor Notes Saint Leo University

MAT 003 Brian Killough s Instructor Notes Saint Leo University MAT 003 Brian Killough s Instructor Notes Saint Leo University Success in online courses requires self-motivation and discipline. It is anticipated that students will read the textbook and complete sample

More information

Instructional Design: ADDIE Model

Instructional Design: ADDIE Model Instructional Design: ADDIE Model RenWeb Training for Teachers at Trinity Lutheran School EDT 892 Instructional Design Tiffany Gurgel October 2013 EDT 892 Instructional Design - RenWeb Training by Tiffany

More information

MITOCW ocw f99-lec07_300k

MITOCW ocw f99-lec07_300k MITOCW ocw-18.06-f99-lec07_300k OK, here's linear algebra lecture seven. I've been talking about vector spaces and specially the null space of a matrix and the column space of a matrix. What's in those

More information

Convex Optimization CMU-10725

Convex Optimization CMU-10725 Convex Optimization CMU-10725 2. Linear Programs Barnabás Póczos & Ryan Tibshirani Please ask questions! Administrivia Lecture = 40 minutes part 1-5 minutes break 35 minutes part 2 Slides: http://www.stat.cmu.edu/~ryantibs/convexopt/

More information

BTEC Nationals IT - Unit2 FAQs

BTEC Nationals IT - Unit2 FAQs BTEC Nationals IT - Unit2 FAQs Q1 Q2 I need more clarity on what is required in the design task Is it expected that the race officials are entering times as raw times and then the table is set up so it

More information

Module 4 Lecture Notes 1. Use of software for solving linear programming problems

Module 4 Lecture Notes 1. Use of software for solving linear programming problems Optimization Methods: Linear Programming Applications Software Module 4 Lecture Notes Use of software for solving linear programming problems Introduction In this class, use of software to solve linear

More information

1 GIAPETTO S WOODCARVING PROBLEM

1 GIAPETTO S WOODCARVING PROBLEM 1 GIAPETTO S WOODCARVING PROBLEM EZGİ ÇALLI OBJECTIVES CCSS.MATH.CONTENT.HSA.REI.D.12: Graph the solutions to a linear inequality in two variables as a half-plane (excluding the boundary in the case of

More information

Version 5. Recruiting Manager / Administrator

Version 5. Recruiting Manager / Administrator Version 5 Recruiting Manager / Administrator 1 Contents 1.0 Introduction... 4 2.0 Recruitment at a Glance... 6 3.0 Viewing Applicant Numbers... 8 4.0 Activities After Closing Date... 10 5.0 Shortlisting...

More information

Problem Set 2 Geometry, Algebra, Reality

Problem Set 2 Geometry, Algebra, Reality Problem Set 2 Geometry, Algebra, Reality Applied Mathematics 121 Spring 2011 Due 5:00 PM, Friday, February 11, 2011 Announcements The assignment is due by 5:00 PM, Friday, February 11, 2011. Readings:

More information

Business Analytics Nanodegree Syllabus

Business Analytics Nanodegree Syllabus Business Analytics Nanodegree Syllabus Master data fundamentals applicable to any industry Before You Start There are no prerequisites for this program, aside from basic computer skills. You should be

More information

Introduction to Linear Programming. Chapter 3: Hillier and Lieberman Chapter 3: Decision Tools for Agribusiness Dr. Hurley s AGB 328 Course

Introduction to Linear Programming. Chapter 3: Hillier and Lieberman Chapter 3: Decision Tools for Agribusiness Dr. Hurley s AGB 328 Course Introduction to Linear Programming Chapter 3: Hillier and Lieberman Chapter 3: Decision Tools for Agribusiness Dr Hurley s AGB 328 Course Terms to Know Simplex Method, Feasible Region, Slope- Intercept

More information