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

Size: px
Start display at page:

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

Transcription

1 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 programming problem will be discussed. An MS- Dos based software, known as MMO, will be discussed. Apart from MMO, simple method using optimization toolbo of MATLAB will be briefly introduced. MMO Software This is an MS-Dos based software to solve various types of problems. In this lecture notes, only Graphical method and Simple method for LP problem using MMO (Dennis and Dennis, 993) will be discussed. It may be noted that MMO can also solve optimization problems related to integer programming, network flow models, PERT among others. For more details of MMO, refer to INFOFILE.TXT in the folder. Installation Download the MMO.ZIP file (in the Module_4 folder of the accompanying CD-ROM) and unzip it in a folder in the PC. Open this folder and double click on the application file named as START. It will open the MMO software. Opening screen can be seen as shown in Fig.. Press any key to see Main menu screen of MMO as shown in Fig.. Use arrow keys from keyboard to select different models. Fig.. Opening Screen of MMO M4L

2 Optimization Methods: Linear Programming Applications Software Fig. Main Menu Screen of MMO Select Linear Programming and press enter. Two options will appear as follows: SOLUTION METHOD: GRAPHIC/ SIMPLEX Graphical Method using MMO Select GRAPHIC and press enter. You can choose a particular option using arrow keys from the keyboard. It may be noted that graphical method can be used only for two decision variables. After waiting for a few moments screen for data entry method will appear (Fig. 3). Fig. 3 Screen for Data Entry Method M4L

3 Optimization Methods: Linear Programming Applications Software 3 Data entry may be done by either of two different ways.. Free Form Entry: You have to write the equation when prompted for input.. Tabular Entry: Data can be input in spreadsheet style. Only the coefficients are to be entered, not the variables. Note that all variables must appear in the objective function (even those with a 0 coefficient); if a variable name is repeated in the objective function, an error message will indicate that it is a duplicate and allow you to change the entry. Constraints can be entered in any order; variables with 0 coefficients do not have to be entered; if a constraint contains a variable not found in the objective function, an error message indicates this and allows you to make the correction; constraints may not have negative right-hand-sides (multiply by - to convert them before entering); when entering inequalities using < or >, it is not necessary to add the equal sign (=); non-negativity constraints are assumed and do not have to be entered. However, this information can be made available by selecting Information Screen. Let us take following problem Maimize Subject to Z = 5,, , Thus, the second constraint is to be multiplied by - while entering, i.e., + 5. In the MMO software, let us select Free Form Entry and ma while it asks about TYPE OF PROBLEM and press enter. After entering the problem the screen will appear as Fig. 4. Note that at the last line of the constraints you have to write go and hit the enter key from the keyboard. Net screen will allow checking the proper entry of the problem. If any mistake is found, select NO and correct the mistake. If everything is ok, select YES and press the enter key. The graphics solution will be displayed on the screen. Different handling options will be shown on the right corner of the screen as follows: M4L

4 Optimization Methods: Linear Programming Applications Software 4 F: Redraw F: Rescale F3: Move Objective Function Line F4: Shade Feasible Region F5: Show Feasible Points F6: Show Optimal Solution Point F0: Show Graphical LP Menu (GPL) We can easily make out the commands listed above. For eample, F3 function can be used to move the objective function line. Subsequent function keys of F4 and F5 can be used to get the diagram as shown in Fig. 5. Fig. 4 Screen after Entering the Problem. M4L

5 Optimization Methods: Linear Programming Applications Software 5 Fig. 5 Feasible Region (highlighted in white), Feasible Points (white) and Optimal Solution Point (cyan) The function key F0, i.e., Show Graphical LP Menu (GPL) will display the four different options as shown in Fig. 6. Fig. 6 Graphical LP Menu Display Graphical Solution will return to the graphical diagram, List Solution Values will show the solution, which is Z = 5.67 with =. 33 and = Show Etreme Points will show either All or Feasible etreme points as per the choice (Fig. 7) M4L

6 Optimization Methods: Linear Programming Applications Software 6 Fig. 7 List of Etreme Points and Feasible Etreme Points SIMPLEX Method using MMO As we know, the graphical solution is is limited to two decision variables. However, simple method can be used for any number of variables, which is discussed in this section. Select SIMPLEX in Linear Programming option of MMO software. As before, screen for data entry method will appear (Fig. 3). The data entry is eactly same as discussed before. Let us consider the earlier problem for discussion and easy comparison. However, we could have taken a problem with more than two decision variables also. Maimize Subject to Z = 5,, , Once you run the problem, it will show the list of slack, surplus and artificial variables as shown in Fig. 8. Note that there are three additional slack variables in the above problem. Press any key to continue. Fig. 8 List of slack, surplus and artificial variables M4L

7 Optimization Methods: Linear Programming Applications Software 7 It will show three different options (Fig. 9):. No Tableau: Shows direct solutions. All Tableau: Shows all simple tableau one by one 3. Final Tableau: Shows only the final simple tableau directly Fig. 9 Different Options for Simple Solution Final simple tableau for the present problem is shown in Fig. 0 and the final solution is obtained as: Optimal Z = with =. 333 and = There is an additional option for Sensitivity Analysis. However, it is beyond the scope of this lecture notes. M4L

8 Optimization Methods: Linear Programming Applications Software 8 Fig. 0 Final Simple Tableau MATLAB Toolbo for Linear Programming Optimization toolbo of MATLAB (00) is very popular and efficient. It includes different types of optimization techniques. In this lecture notes, we will briefly introduce the use of MATLAB toolbo for Simple Algorithm. However, it is assumed that the users are aware of basics of MATLAB. To use the simple method, you have to set the option as 'LargeScale' to 'off' and 'Simple' to 'on' in the following way. options = optimset('largescale', 'off', 'Simple', 'on') Then a function called linprog is to be used. A brief MATLAB documentation is shown in Fig. for linear programming (linprog). M4L

9 Optimization Methods: Linear Programming Applications Software 9 Fig. MATLAB Documentation for Linear Programming Further details may be referred from the toolbo. However, with this basic knowledge, simple LP problems can be solved. Let us consider the same problem as considered earlier. Maimize Subject to Z = 5,, , M4L

10 Optimization Methods: Linear Programming Applications Software 0 Following MATLAB code will give the solution using simple algorithm. clear all f=[- -3]; %Converted to minimization problem A=[ 0;- ; ]; b=[5 5 6]; lb=[0 0]; options = optimset('largescale', [,fval]=linprog(f,a,b,[],[],lb); z=-fval %Multiplied by - 'off', 'Simple', 'on'); Note that objective function should be converted to a minimization problem before entering as done in line of the code. Finally, solution should be multiplied by - to the optimized (maimum) solution as done in last but one line. Solution will be obtained as Z = with =.333 and = as in the earlier case. References Dennis T.L. and L.B. Dennis, Microcomputer Models for Management Decision Making, West Publishing Company, 993. MATLAB User s Manual, The Math Works Inc., 00. M4L

Linear Programming Applications. Software for Linear Programming

Linear Programming Applications. Software for Linear Programming Linear Programming Applications Software for Linear Programming Objectives Use of software to solve LP problems MMO Software with eample Graphical Method Simple Method Simple method using optimization

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

Intro to Linear Programming. The problem that we desire to address in this course is loosely stated below.

Intro to Linear Programming. The problem that we desire to address in this course is loosely stated below. . Introduction Intro to Linear Programming The problem that we desire to address in this course is loosely stated below. Given a number of generators make price-quantity offers to sell (each provides their

More information

Simplex Method. Introduction:

Simplex Method. Introduction: Introduction: Simple Method In the previous chapter, we discussed about the graphical method for solving linear programming problems. Although the graphical method is an invaluable aid to understand the

More information

Math 414 Lecture 30. The greedy algorithm provides the initial transportation matrix.

Math 414 Lecture 30. The greedy algorithm provides the initial transportation matrix. Math Lecture The greedy algorithm provides the initial transportation matrix. matrix P P Demand W ª «2 ª2 «W ª «W ª «ª «ª «Supply The circled x ij s are the initial basic variables. Erase all other values

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

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

How to Solve a Standard Maximization Problem Using the Simplex Method and the Rowops Program

How to Solve a Standard Maximization Problem Using the Simplex Method and the Rowops Program How to Solve a Standard Maximization Problem Using the Simplex Method and the Rowops Program Problem: Maximize z = x + 0x subject to x + x 6 x + x 00 with x 0 y 0 I. Setting Up the Problem. Rewrite each

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

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

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

MATLAB Solution of Linear Programming Problems

MATLAB Solution of Linear Programming Problems MATLAB Solution of Linear Programming Problems The simplex method is included in MATLAB using linprog function. All is needed is to have the problem expressed in the terms of MATLAB definitions. Appendix

More information

February 10, 2005

February 10, 2005 15.053 February 10, 2005 The Geometry of Linear Programs the geometry of LPs illustrated on DTC Announcement: please turn in homework solutions now with a cover sheet 1 Goal of this Lecture 3 mathematical

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

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

Notes for Lecture 18

Notes for Lecture 18 U.C. Berkeley CS17: Intro to CS Theory Handout N18 Professor Luca Trevisan November 6, 21 Notes for Lecture 18 1 Algorithms for Linear Programming Linear programming was first solved by the simplex method

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

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

Linear Programming. Revised Simplex Method, Duality of LP problems and Sensitivity analysis

Linear Programming. Revised Simplex Method, Duality of LP problems and Sensitivity analysis Linear Programming Revised Simple Method, Dualit of LP problems and Sensitivit analsis Introduction Revised simple method is an improvement over simple method. It is computationall more efficient and accurate.

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

Discuss mainly the standard inequality case: max. Maximize Profit given limited resources. each constraint associated to a resource

Discuss mainly the standard inequality case: max. Maximize Profit given limited resources. each constraint associated to a resource Sensitivity Analysis Discuss mainly the standard inequality case: ma s.t. n a i, z n b, i c i,, m s.t.,,, n ma Maimize Profit given limited resources each constraint associated to a resource Alternate

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

Chapter 3 Path Optimization

Chapter 3 Path Optimization Chapter 3 Path Optimization Background information on optimization is discussed in this chapter, along with the inequality constraints that are used for the problem. Additionally, the MATLAB program for

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

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

Controlling Air Pollution. A quick review. Reclaiming Solid Wastes. Chapter 4 The Simplex Method. Solving the Bake Sale problem. How to move?

Controlling Air Pollution. A quick review. Reclaiming Solid Wastes. Chapter 4 The Simplex Method. Solving the Bake Sale problem. How to move? ESE Operations Research 9// Controlling Air Pollution Technology can be use fully () or fractional thereof A quick review ESE Operations Research Reclaiming Solid Wastes Chapter The Simple Method ESE Operations

More information

ISE203 Optimization 1 Linear Models. Dr. Arslan Örnek Chapter 4 Solving LP problems: The Simplex Method SIMPLEX

ISE203 Optimization 1 Linear Models. Dr. Arslan Örnek Chapter 4 Solving LP problems: The Simplex Method SIMPLEX ISE203 Optimization 1 Linear Models Dr. Arslan Örnek Chapter 4 Solving LP problems: The Simplex Method SIMPLEX Simplex method is an algebraic procedure However, its underlying concepts are geometric Understanding

More information

BCN Decision and Risk Analysis. Syed M. Ahmed, Ph.D.

BCN Decision and Risk Analysis. Syed M. Ahmed, Ph.D. Linear Programming Module Outline Introduction The Linear Programming Model Examples of Linear Programming Problems Developing Linear Programming Models Graphical Solution to LP Problems The Simplex Method

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 5. Review of Linear Programming. Applied Math / Engineering Sciences 121. Week of October 15, 2017

Section Notes 5. Review of Linear Programming. Applied Math / Engineering Sciences 121. Week of October 15, 2017 Section Notes 5 Review of Linear Programming Applied Math / Engineering Sciences 121 Week of October 15, 2017 The following list of topics is an overview of the material that was covered in the lectures

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

A Survey of Software Packages for Teaching Linear and Integer Programming

A Survey of Software Packages for Teaching Linear and Integer Programming 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

More information

AM 121: Intro to Optimization Models and Methods Fall 2017

AM 121: Intro to Optimization Models and Methods Fall 2017 AM 121: Intro to Optimization Models and Methods Fall 2017 Lecture 10: Dual Simplex Yiling Chen SEAS Lesson Plan Interpret primal simplex in terms of pivots on the corresponding dual tableau Dictionaries

More information

UNIT 2 LINEAR PROGRAMMING PROBLEMS

UNIT 2 LINEAR PROGRAMMING PROBLEMS UNIT 2 LINEAR PROGRAMMING PROBLEMS Structure 2.1 Introduction Objectives 2.2 Linear Programming Problem (LPP) 2.3 Mathematical Formulation of LPP 2.4 Graphical Solution of Linear Programming Problems 2.5

More information

Appendix 3: PREPARATION & INTERPRETATION OF GRAPHS

Appendix 3: PREPARATION & INTERPRETATION OF GRAPHS Appendi 3: PREPARATION & INTERPRETATION OF GRAPHS All of you should have had some eperience in plotting graphs. Some of you may have done this in the distant past. Some may have done it only in math courses

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

Appendix 2: PREPARATION & INTERPRETATION OF GRAPHS

Appendix 2: PREPARATION & INTERPRETATION OF GRAPHS Appendi 2: PREPARATION & INTERPRETATION OF GRAPHS All of you should have had some eperience in plotting graphs. Some of you may have done this in the distant past. Some may have done it only in math courses

More information

Linear Programming has been used to:

Linear Programming has been used to: Linear Programming Linear programming became important during World War II: used to solve logistics problems for the military. Linear Programming (LP) was the first widely used form of optimization in

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

Linear Programming. L.W. Dasanayake Department of Economics University of Kelaniya

Linear Programming. L.W. Dasanayake Department of Economics University of Kelaniya Linear Programming L.W. Dasanayake Department of Economics University of Kelaniya Linear programming (LP) LP is one of Management Science techniques that can be used to solve resource allocation problem

More information

Chapter 4 Section 1 Graphing Linear Inequalities in Two Variables

Chapter 4 Section 1 Graphing Linear Inequalities in Two Variables Chapter 4 Section 1 Graphing Linear Inequalities in Two Variables Epressions of the tpe + 2 8 and 3 > 6 are called linear inequalities in two variables. A solution of a linear inequalit in two variables

More information

SIMULINK Tutorial. Select File-New-Model from the menu bar of this window. The following window should now appear.

SIMULINK Tutorial. Select File-New-Model from the menu bar of this window. The following window should now appear. SIMULINK Tutorial Simulink is a block-orientated program that allows the simulation of dynamic systems in a block diagram format whether they are linear or nonlinear, in continuous or discrete forms. To

More information

How to use Excel Spreadsheets for Graphing

How to use Excel Spreadsheets for Graphing How to use Excel Spreadsheets for Graphing 1. Click on the Excel Program on the Desktop 2. You will notice that a screen similar to the above screen comes up. A spreadsheet is divided into Columns (A,

More information

Civil Engineering Systems Analysis Lecture XV. Instructor: Prof. Naveen Eluru Department of Civil Engineering and Applied Mechanics

Civil Engineering Systems Analysis Lecture XV. Instructor: Prof. Naveen Eluru Department of Civil Engineering and Applied Mechanics Civil Engineering Systems Analysis Lecture XV Instructor: Prof. Naveen Eluru Department of Civil Engineering and Applied Mechanics Today s Learning Objectives Sensitivity Analysis Dual Simplex Method 2

More information

Anima-LP. Version 2.1alpha. User's Manual. August 10, 1992

Anima-LP. Version 2.1alpha. User's Manual. August 10, 1992 Anima-LP Version 2.1alpha User's Manual August 10, 1992 Christopher V. Jones Faculty of Business Administration Simon Fraser University Burnaby, BC V5A 1S6 CANADA chris_jones@sfu.ca 1992 Christopher V.

More information

MATLAB: The greatest thing ever. Why is MATLAB so great? Nobody s perfect, not even MATLAB. Prof. Dionne Aleman. Excellent matrix/vector handling

MATLAB: The greatest thing ever. Why is MATLAB so great? Nobody s perfect, not even MATLAB. Prof. Dionne Aleman. Excellent matrix/vector handling MATLAB: The greatest thing ever Prof. Dionne Aleman MIE250: Fundamentals of object-oriented programming University of Toronto MIE250: Fundamentals of object-oriented programming (Aleman) MATLAB 1 / 1 Why

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

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

Math Models of OR: The Simplex Algorithm: Practical Considerations

Math Models of OR: The Simplex Algorithm: Practical Considerations Math Models of OR: The Simplex Algorithm: Practical Considerations John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY 12180 USA September 2018 Mitchell Simplex Algorithm: Practical Considerations

More information

MATLAB Simulink Modeling and Simulation of Recurrent Neural Network for Solving Linear Programming Problems

MATLAB Simulink Modeling and Simulation of Recurrent Neural Network for Solving Linear Programming Problems International Conference on Mathematical Computer Engineering - ICMCE - 8 MALAB Simulink Modeling and Simulation of Recurrent Neural Network for Solving Linear Programming Problems Raja Das a a School

More information

SLOPE A MEASURE OF STEEPNESS through 7.1.5

SLOPE A MEASURE OF STEEPNESS through 7.1.5 SLOPE A MEASURE OF STEEPNESS 7.1. through 7.1.5 Students have used the equation = m + b throughout this course to graph lines and describe patterns. When the equation is written in -form, the m is the

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

Chapter 3: Section 3-2 Graphing Linear Inequalities

Chapter 3: Section 3-2 Graphing Linear Inequalities Chapter : Section - Graphing Linear Inequalities D. S. Malik Creighton Universit, Omaha, NE D. S. Malik Creighton Universit, Omaha, NE Chapter () : Section - Graphing Linear Inequalities / 9 Geometric

More information

Linear Mathematical Programming (LP)

Linear Mathematical Programming (LP) Linear Mathematical Programming (LP) A MP is LP if : The objective function is linear where The set is defined by linear equality or inequality constraints c f T ) = ( ],..., [ n T c c c = = n b A where

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

Constrained Optimization COS 323

Constrained Optimization COS 323 Constrained Optimization COS 323 Last time Introduction to optimization objective function, variables, [constraints] 1-dimensional methods Golden section, discussion of error Newton s method Multi-dimensional

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

1. Enter the Order Number in the smartdocs search field, then press the Enter key on your keyboard while the cursor is still blinking in the field.

1. Enter the Order Number in the smartdocs search field, then press the Enter key on your keyboard while the cursor is still blinking in the field. Creating a smartbinder Presentation Overview: This job aid shows you how to create a smartbinder Presentation in smartdocs. A smartbinder is an HTML document that creates a Table of Contents with links

More information

Starting Kidspiration. To start Kidspiration on a Macintosh: Open the Kidspiration 3 folder and double-click the Kidspiration icon.

Starting Kidspiration. To start Kidspiration on a Macintosh: Open the Kidspiration 3 folder and double-click the Kidspiration icon. Tutorial Seven: Creating an open-ended problem in the Free Workspace The Free Workspace allows for the creation of an open-ended problem where students can choose any tool with which to complete their

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

Tribhuvan University Institute Of Science and Technology Tribhuvan University Institute of Science and Technology

Tribhuvan University Institute Of Science and Technology Tribhuvan University Institute of Science and Technology Tribhuvan University Institute Of Science and Technology Tribhuvan University Institute of Science and Technology Course Title: Linear Programming Full Marks: 50 Course No. : Math 403 Pass Mark: 17.5 Level

More information

How to set up an Amazon Work Profile for Windows 8

How to set up an Amazon Work Profile for Windows 8 How to set up an Amazon Work Profile for Windows 8 Setting up a new profile for Windows 8 requires you to navigate some screens that may lead you to create the wrong type of account. By following this

More information

II. Linear Programming

II. Linear Programming II. Linear Programming A Quick Example Suppose we own and manage a small manufacturing facility that produced television sets. - What would be our organization s immediate goal? - On what would our relative

More information

Graphing Systems of Linear Inequalities in Two Variables

Graphing Systems of Linear Inequalities in Two Variables 5.5 Graphing Sstems of Linear Inequalities in Two Variables 5.5 OBJECTIVES 1. Graph a sstem of linear inequalities in two variables 2. Solve an application of a sstem of linear inequalities In Section

More information

GAZIANTEP UNIVERSITY INFORMATICS SECTION SEMETER

GAZIANTEP UNIVERSITY INFORMATICS SECTION SEMETER GAZIANTEP UNIVERSITY INFORMATICS SECTION 2010-2011-2 SEMETER Microsoft Excel is located in the Microsoft Office paket. in brief Excel is spreadsheet, accounting and graphics program. WHAT CAN WE DO WITH

More information

AEMLog users guide V User Guide - Advanced Engine Management 2205 West 126 th st Hawthorne CA,

AEMLog users guide V User Guide - Advanced Engine Management 2205 West 126 th st Hawthorne CA, AEMLog users guide V 1.00 User Guide - Advanced Engine Management 2205 West 126 th st Hawthorne CA, 90250 310-484-2322 INTRODUCTION...2 DOCUMENTATION...2 INSTALLING AEMLOG...4 TRANSFERRING DATA TO AND

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

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

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

These notes are in two parts: this part has topics 1-3 above.

These notes are in two parts: this part has topics 1-3 above. IEEM 0: Linear Programming and Its Applications Outline of this series of lectures:. How can we model a problem so that it can be solved to give the required solution 2. Motivation: eamples of typical

More information

Supplemental Problems MAT (Prepared by Prof. Urmi Ghosh-Dastidar)

Supplemental Problems MAT (Prepared by Prof. Urmi Ghosh-Dastidar) Supplemental Problems MAT 3770 (Prepared by Prof. Urmi Ghosh-Dastidar) 1. Use Lagrange Multiplier methods to find the stationary values of z: (a) z = y, subject to + y = (b) z = (y+4), subject to + y =

More information

DOING MORE WITH EXCEL: MICROSOFT OFFICE 2013

DOING MORE WITH EXCEL: MICROSOFT OFFICE 2013 DOING MORE WITH EXCEL: MICROSOFT OFFICE 2013 GETTING STARTED PAGE 02 Prerequisites What You Will Learn MORE TASKS IN MICROSOFT EXCEL PAGE 03 Cutting, Copying, and Pasting Data Basic Formulas Filling Data

More information

5. DUAL LP, SOLUTION INTERPRETATION, AND POST-OPTIMALITY

5. DUAL LP, SOLUTION INTERPRETATION, AND POST-OPTIMALITY 5. DUAL LP, SOLUTION INTERPRETATION, AND POST-OPTIMALITY 5.1 DUALITY Associated with every linear programming problem (the primal) is another linear programming problem called its dual. If the primal involves

More information

CASE STUDY. fourteen. Animating The Simplex Method. case study OVERVIEW. Application Overview and Model Development.

CASE STUDY. fourteen. Animating The Simplex Method. case study OVERVIEW. Application Overview and Model Development. CASE STUDY fourteen Animating The Simplex Method case study OVERVIEW CS14.1 CS14.2 CS14.3 CS14.4 CS14.5 CS14.6 CS14.7 Application Overview and Model Development Worksheets User Interface Procedures Re-solve

More information

NOTE: For this tutorial you will need Internet Explorer Click Site, then New Site, go to the Templates tab. Fig. 1.0

NOTE: For this tutorial you will need Internet Explorer Click Site, then New Site, go to the Templates tab. Fig. 1.0 1 NOTE: For this tutorial you will need Internet Explorer 8 1. Click Site, then New Site, go to the Templates tab. Fig. 1.0 2. Choose Organization 5 Fig.1.2 2 3. Double click default.html at the bottom

More information

Lecture 9: Linear Programming

Lecture 9: Linear Programming Lecture 9: Linear Programming A common optimization problem involves finding the maximum of a linear function of N variables N Z = a i x i i= 1 (the objective function ) where the x i are all non-negative

More information

Name: Thus, y-intercept is (0,40) (d) y-intercept: Set x = 0: Cover the x term with your finger: 2x + 6y = 240 Solve that equation: 6y = 24 y = 4

Name: Thus, y-intercept is (0,40) (d) y-intercept: Set x = 0: Cover the x term with your finger: 2x + 6y = 240 Solve that equation: 6y = 24 y = 4 Name: GRAPHING LINEAR INEQUALITIES IN TWO VARIABLES SHOW ALL WORK AND JUSTIFY ALL ANSWERS. 1. We will graph linear inequalities first. Let us first consider 2 + 6 240 (a) First, we will graph the boundar

More information

download instant at

download instant at CHAPTER 1 - LAB SESSION INTRODUCTION TO EXCEL INTRODUCTION: This lab session is designed to introduce you to the statistical aspects of Microsoft Excel. During this session you will learn how to enter

More information

Cumulative Review Problems Packet # 1

Cumulative Review Problems Packet # 1 April 15, 009 Cumulative Review Problems Packet #1 page 1 Cumulative Review Problems Packet # 1 This set of review problems will help you prepare for the cumulative test on Friday, April 17. The test will

More information

Linear Programming Problems

Linear Programming Problems Linear Programming Problems Two common formulations of linear programming (LP) problems are: min Subject to: 1,,, 1,2,,;, max Subject to: 1,,, 1,2,,;, Linear Programming Problems The standard LP problem

More information

Tuesday, April 10. The Network Simplex Method for Solving the Minimum Cost Flow Problem

Tuesday, April 10. The Network Simplex Method for Solving the Minimum Cost Flow Problem . Tuesday, April The Network Simplex Method for Solving the Minimum Cost Flow Problem Quotes of the day I think that I shall never see A poem lovely as a tree. -- Joyce Kilmer Knowing trees, I understand

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

Standardized Tests: Best Practices for the TI-Nspire CX

Standardized Tests: Best Practices for the TI-Nspire CX The role of TI technology in the classroom is intended to enhance student learning and deepen understanding. However, efficient and effective use of graphing calculator technology on high stakes tests

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

4 Linear Programming (LP) E. Amaldi -- Foundations of Operations Research -- Politecnico di Milano 1

4 Linear Programming (LP) E. Amaldi -- Foundations of Operations Research -- Politecnico di Milano 1 4 Linear Programming (LP) E. Amaldi -- Foundations of Operations Research -- Politecnico di Milano 1 Definition: A Linear Programming (LP) problem is an optimization problem: where min f () s.t. X n the

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

MS Office for Engineers

MS Office for Engineers MS Office for Engineers Lesson 4 Excel 2 Pre-reqs/Technical Skills Basic knowledge of Excel Completion of Excel 1 tutorial Basic computer use Expectations Read lesson material Implement steps in software

More information

CSE 40/60236 Sam Bailey

CSE 40/60236 Sam Bailey CSE 40/60236 Sam Bailey Solution: any point in the variable space (both feasible and infeasible) Cornerpoint solution: anywhere two or more constraints intersect; could be feasible or infeasible Feasible

More information

Spreadsheet View and Basic Statistics Concepts

Spreadsheet View and Basic Statistics Concepts Spreadsheet View and Basic Statistics Concepts GeoGebra 3.2 Workshop Handout 9 Judith and Markus Hohenwarter www.geogebra.org Table of Contents 1. Introduction to GeoGebra s Spreadsheet View 2 2. Record

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

Matrix Representations

Matrix Representations CONDENSED LESSON 6. Matri Representations In this lesson, ou Represent closed sstems with transition diagrams and transition matrices Use matrices to organize information Sandra works at a da-care center.

More information

ORF 307: Lecture 14. Linear Programming: Chapter 14: Network Flows: Algorithms

ORF 307: Lecture 14. Linear Programming: Chapter 14: Network Flows: Algorithms ORF 307: Lecture 14 Linear Programming: Chapter 14: Network Flows: Algorithms Robert J. Vanderbei April 10, 2018 Slides last edited on April 10, 2018 http://www.princeton.edu/ rvdb Agenda Primal Network

More information

DM545 Linear and Integer Programming. Lecture 2. The Simplex Method. Marco Chiarandini

DM545 Linear and Integer Programming. Lecture 2. The Simplex Method. Marco Chiarandini DM545 Linear and Integer Programming Lecture 2 The Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. 2. 3. 4. Standard Form Basic Feasible Solutions

More information

Basic Software Maintenance. Ham Station Ultra Software Package

Basic Software Maintenance. Ham Station Ultra Software Package 1 Carl Skip Glover, Jr. K1SPG Custom Software & Hardware Solutions 4 Valley of Industry Boscawen, NH 03303 (603) 369-7015 Email: pctech.skip@gmail.com Email: k1spg@arrl.net Basic Software Maintenance Ham

More information

+ Solving Linear Inequalities. Mr. Smith IM3

+ Solving Linear Inequalities. Mr. Smith IM3 + Solving Linear Inequalities Mr. Smith IM3 + Inequality Symbols < > Less than Greater than Less than or equal to Greater than or equal to Not equal to + Linear Inequality n Inequality with one variable

More information

Solutions to assignment 3

Solutions to assignment 3 Math 9 Solutions to assignment Due: : Noon on Thursday, October, 5.. Find the minimum of the function f, y, z) + y + z subject to the condition + y + z 4. Solution. Let s define g, y, z) + y + z, so the

More information

The same can also be achieved by clicking on Format Character and then selecting an option from the Typeface list box.

The same can also be achieved by clicking on Format Character and then selecting an option from the Typeface list box. CHAPTER 2 TEXT FORMATTING A text without any special formatting can have a monotonous appearance. To outline text, to highlight individual words, quotations, or references, or to separate certain parts

More information

Lecture notes on Transportation and Assignment Problem (BBE (H) QTM paper of Delhi University)

Lecture notes on Transportation and Assignment Problem (BBE (H) QTM paper of Delhi University) Transportation and Assignment Problems The transportation model is a special class of linear programs. It received this name because many of its applications involve determining how to optimally transport

More information

Optimization Methods: Linear Programming Applications Transportation Problem 1. Module 4 Lecture Notes 2. Transportation Problem

Optimization Methods: Linear Programming Applications Transportation Problem 1. Module 4 Lecture Notes 2. Transportation Problem Optimization ethods: Linear Programming Applications Transportation Problem odule 4 Lecture Notes Transportation Problem Introduction In the previous lectures, we discussed about the standard form of a

More information

Generalized Network Flow Programming

Generalized Network Flow Programming Appendix C Page Generalized Network Flow Programming This chapter adapts the bounded variable primal simplex method to the generalized minimum cost flow problem. Generalized networks are far more useful

More information