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

Similar documents
Linear Programming: Basic Concepts. Chapter 2: Hillier and Hillier

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

Full file at Linear Programming Models: Graphical and Computer Methods

ISE 203 OR I. Chapter 3 Introduction to Linear Programming. Asst. Prof. Dr. Nergiz Kasımbeyli

Chapter 7. Linear Programming Models: Graphical and Computer Methods

Linear programming II João Carlos Lourenço

Solving linear programming

Setup and graphical solution of Linear Programming Problems [2-variables] Mathematical Programming Characteristics

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

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

4 LINEAR PROGRAMMING (LP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1

Network Optimization Models. Chapter 10: Hillier and Lieberman Chapter 8: Decision Tools for Agribusiness Dr. Hurley s AGB 328 Course

Quantitative Technique

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

Linear Programming. Meaning of Linear Programming. Basic Terminology

NOTATION AND TERMINOLOGY

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

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

Unit.9 Integer Programming

Linear Programming the simple Wyndor Glass example

LP Graphic Solution & Solver for LP

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

Application of Cutting Stock Problem in Minimizing The Waste of Al-Quran Cover

Microsoft Office Illustrated. Using Tables

Linear Programming: Model Formulation and Graphical Solution

Graphing Linear Inequalities in Two Variables.

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

Introduction to Linear Programming. Algorithmic and Geometric Foundations of Optimization

Graphical Methods in Linear Programming

Using Linear Programming for Management Decisions

PROCESS MANAGEMENT. Selected Exact Managerial Methods. Study supports

Linear Programming: Model Formulation and Graphical Solution

Chapter 2: Linear Programming - Maximization

Systems of Equations and Inequalities. Copyright Cengage Learning. All rights reserved.

Read: H&L chapters 1-6

EuroSymphony Solver. The Simplex Algorithm

Documenting Models in Word

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

Chapter 2 An Introduction to Linear Programming

WEEK NO. 12 MICROSOFT EXCEL 2007

CHAPTER 3 LINEAR PROGRAMMING: SIMPLEX METHOD

Basic Excel Forumlas

Mathematics. Linear Programming

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

Chapter 13-1 Notes Page 1

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

Chapter 2 - An Introduction to Linear Programming

TRANSPORTATION AND ASSIGNMENT PROBLEMS

AGB 260: Agribusiness Data Literacy. Tables

Using the Graphical Method to Solve Linear Programs J. Reeb and S. Leavengood

OPTIMIZAÇÃO E DECISÃO 09/10

Process Optimization

Network Optimization Problems. Chapter 6: Hillier and Hillier

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

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

Optimization in One Variable Using Solver

Linear Programming. them such that they

MLR Institute of Technology

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

A Survey of Software Packages for Teaching Linear and Integer Programming

Tutorial 10: Performing What-If Analyses. Microsoft Excel 2013 Enhanced

Lesson 08 Linear Programming

COMPUTERIZED OFFICE SUPPORT PROGRAM

Problem Set 2 Geometry, Algebra, Reality

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

5 The Theory of the Simplex Method

Lesson 6: Modeling Basics

FAQ: Advanced Functions

1 GIAPETTO S WOODCARVING PROBLEM

MS Office for Engineers

Benders Decomposition

Section 3. Formulas. By the end of this Section you should be able to:

A B C D E F. = 1/3 1 divided by 3, that is, The product of cells A2 and C12. Cell C6 divided by the difference of D4 and E4

Applications of Linear Programming

Convex Optimization CMU-10725

Introduction to Operations Research

Introduction to Linear Programming

II. Linear Programming

OPERATIONS RESEARCH. Linear Programming Problem

Other Algorithms for Linear Programming Chapter 7

EXCEL 2002 (XP) FOCUS ON: DESIGNING SPREADSHEETS AND WORKBOOKS

: Principles of Automated Reasoning and Decision Making Midterm

Math Models of OR: The Simplex Algorithm: Practical Considerations

Concept: Solving Inequalities Name:

The Menu and Toolbar in Excel (see below) look much like the Word tools and most of the tools behave as you would expect.

Chapter 4. Linear Programming

SUM - This says to add together cells F28 through F35. Notice that it will show your result is

Constraint Handling. Fernando Lobo. University of Algarve

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

Excel Forecasting Tools Review

CDG2A/CDZ4A/CDC4A/ MBT4A ELEMENTS OF OPERATIONS RESEARCH. Unit : I - V

Linear Programming Problems: Geometric Solutions

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

Chapter 2--An Introduction to Linear Programming

Module 4 : Spreadsheets

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

The Islamic University of Gaza Faculty of Commerce Quantitative Analysis - Dr. Samir Safi Midterm #2-28/4/2014

Microsoft Office Excel 2007

CHAPTER 4: MICROSOFT OFFICE: EXCEL 2010

เพ มภาพตามเน อหาของแต ละบท. Microsoft Excel Benjamas Panyangam and Dr. Dussadee Praserttitipong. Adapted in English by Prakarn Unachak

Transcription:

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 Form, Optimal Solution, Graphical Method, Decision Variables, Parameters, Objective Function, Constraints, Functional Constraints, Non- Negativity Constraints, Feasible Solution, Infeasible Solution, Feasible Region

Terms to Know Cont No Feasible Solution, Optimal Solution, Most Favorable Value, Multiple Optimal Solutions, No Optimal Solutions, Unbounded Z, Corner-Point Feasible Solution (CPF), Blending Problem, Data Cells, Range Name, Changing Cells, Output Cells, Target Cell

Wyndor Glass Co Example Company has two new products a door and a window The company has three plants to develop these two new products The goal of the company is to maximize profits

Key Data for Wyndor Doors Windows Time Available Hours Plant 1 Usage (Hours) 1 0 4 Plant 2 Usage (Hours) 0 2 12 Plant 3 Usage (Hours) 3 2 18 Unit Profit $3,000 $5,000

Mathematical Model Let x 1 = number of doors produced per week Let x 2 = number of windows produced per week Let Z = profit per week Maximize Z = 3x 1 + 5x 2 Subject to: x 1 4 2x 2 12 3x 1 + 2x 2 18 x 1 0, x 2 0

Graphical Solution x 2 x 1 =4 9 6 2x 2 =12 3x 1 +2x 2 =18 Z=3x 1 +5x 2 =36 0 4 6 Z=3x 1 +5x 2 =20 x 1 Z=3x 1 +5x 2 =10

The General Linear Programming Model Z = measure of performance x j = a decision variable that indicates how much you are doing of activity j for j = 1, 2,, n c j = a parameter that converts activity j into the overall measure of performance b i = the amount of resource i you have available to allocate to your different activities for i = 1, 2,, m a ij = a parameter that converts activity j into the amount of resource i used

Resource Allocation Data Matrix Activity 1 Activity 2 Activity n Resource Available Resource 1 a 11 a 12 a 1n b 1 Resource 2 a 21 a 22 a 2n b 2 Resource m a m1 a m2 a mn b m Contribution to Z c 1 c 2 c n

Standard Mathematical Form Maximize Z = c 1 x 1 + c 2 x 2 + +c n x n Subject to: a 11 x 1 + a 12 x 2 + +c 1n x n b 1 a 21 x 1 + a 22 x 2 + +c 2n x n b 2 a m1 x 1 + a m2 x 2 + +c mn x n b m x 1 0, x 2 0,, x n 0

Changes that Can Be Made to the Standard Form The objective function could be minimized instead of maximized The functional constraints can be met with equality (=) or greater than ( ) signs The decision variables x j could be unrestricted in sign, ie, x j < 0 is also possible

Major Assumptions Behind Linear Programming All functions are linear Proportionality Assumption Additivity Divisibility Certainty

Solving Linear Programming Problems Using a Spreadsheet Excel has an add-in called Solver that can solve linear programming problems Major components to Solver are: Set Objective: To: By Changing Variable Cells: Subject to the Constraints: Make Unconstrained Variables Non-negative should be checked Select a Solving Method:

Guidelines for Building Good Spreadsheets Enter the data first Since the data can dictate the structure of the spreadsheet model, it is valuable to input the data in the spreadsheet first This can also allow you to build the spreadsheet to closely resemble the structure of the data

Guidelines for Building Good Spreadsheets Cont Organize and clearly identify the data Data should be grouped together in a convenient format Each piece of data or group of data should be appropriately labeled Enter each piece of data into one cell only If you need to use the data elsewhere in the model, you can reference it

Guidelines for Building Good Spreadsheets Cont Separate data from formulas If possible, formulas should have no specific parameters encoded in them By keeping the data separate from formulas, you can save time when changes are needed by only having to change one parameter rather than looking for all the formulas that use a specific piece of data This allows all the data to be visual in the spreadsheet

Guidelines for Building Good Spreadsheets Cont Keep it simple You should avoid more powerful functions when simpler ones will accomplish the same task Keep formulas simple If you have a very complicated formula, you should break it up into components on the spreadsheet Use range names Range names should be indicative of what they represent When using range names, care should be taken not to allow too many range names so the names become unwieldy

Guidelines for Building Good Spreadsheets Cont Use relative and absolute references to simplify copying formulas This also allows you to copy cells without making as many errors Use borders, shading, and colors to distinguish between cell types This will make it easy for you to keep track of the items within your spreadsheet model

Guidelines for Building Good Spreadsheets Cont Show the entire model on the spreadsheet You should attempt to put as many of the elements of the model on the spreadsheet This will allow others to more easily understand your model This will allow people using the spreadsheet to more easily understand the Solver dialog box

Review the Following Spreadsheet Models Wyndor Glass Radiation Therapy Kibbutzim Nori and Leets Save-It Union Airways Distribution Unlimited

Example 31-10 in the textbook Develop a mathematical model Solve the problem using the graphical method Solve the problem using excel by developing a spreadsheet model

In-Class Activity (Not Graded) Solve the following using the graphical method and the spreadsheet method: Maximize Z = 200x 1 + 100x 2 Subject to: 20x 1 10x 2 150 15x 1 + 15x 2 180 3x 1 + 5x 2 45 x 1 0, x 2 0