INFM 718A / LBSC 705 Information For Decision Making Lecture 4.

Slides:



Advertisements
Similar presentations
Solving LP Problems in a Spreadsheet
Advertisements

Optimization problems using excel solver
Using Solver to solve a minimization LP + interpretation of output BSAD 30 Dave Novak Source: Anderson et al., 2013 Quantitative Methods for Business 12.
© 2003 Anita Lee-Post Linear Programming Part 2 By Anita Lee-Post.
Linear Programming Problem
Lecture 3 Linear Programming: Tutorial Simplex Method
Wyndor Example; Enter data Organize the data for the model on the spreadsheet. Type in the coefficients of the constraints and the objective function.
BA 452 Lesson A.2 Solving Linear Programs 1 1ReadingsReadings Chapter 2 An Introduction to Linear Programming.
Chapter 2 Linear Programming Models: Graphical and Computer Methods © 2007 Pearson Education.
Lecture outline Support vector machines. Support Vector Machines Find a linear hyperplane (decision boundary) that will separate the data.
Computational Methods for Management and Economics Carla Gomes Module 4 Displaying and Solving LP Models on a Spreadsheet.
Solver & Optimization Problems n An optimization problem is a problem in which we wish to determine the best values for decision variables that will maximize.
Linear Programming Digital Lesson. Copyright © by Houghton Mifflin Company, Inc. All rights reserved. 2 Linear programming is a strategy for finding the.
1 1 Slides by John Loucks St. Edward’s University Modifications by A. Asef-Vaziri.
Graphical Solutions Plot all constraints including nonnegativity ones
Linear Programming Operations Research – Engineering and Math Management Sciences – Business Goals for this section  Modeling situations in a linear environment.
Linear Programming Models: Graphical and Computer Methods
Chapter 3 Introduction to Optimization Modeling
Linear programming Lecture (4) and lecture (5). Recall An optimization problem is a decision problem in which we are choosing among several decisions.
Chapter 4 - Linear Programming: Computer Solution Excel Solver
START EXCEL BUILD OR RETRIEVE YOUR OPTIMIZATION MODEL SAVE YOUR WORKBOOK!! CHOOSE “Solver…” IN THE “Tools” MENU SPECIFY IN SOLVER DIALOG BOX: 1.CELL TO.
Chapter 15 Constrained Optimization. The Linear Programming Model Let : x 1, x 2, x 3, ………, x n = decision variables Z = Objective function or linear.
Solver & Optimization Problems n An optimization problem is a problem in which we wish to determine the best values for decision variables that will maximize.
1 1 Slide © 2005 Thomson/South-Western Slides Prepared by JOHN S. LOUCKS ST. EDWARD’S UNIVERSITY.
1 1 Slide Linear Programming (LP) Problem n A mathematical programming problem is one that seeks to maximize an objective function subject to constraints.
Linear Programming McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
Linear Programming – Simplex Method
1/24: Linear Programming & Sensitivity Analysis Review: –LP Requirements –Graphical solutions Using MS Excel for Linear Programming Sensitivity Analysis.
LP: Summary thus far Requirements Graphical solutions Excel Sensitivity Analysis.
1 Systems Analysis Methods Dr. Jerrell T. Stracener, SAE Fellow SMU EMIS 5300/7300 NTU SY-521-N NTU SY-521-N SMU EMIS 5300/7300 Statistical Analysis Other.
Linear Programming with Excel Solver.  Use Excel’s Solver as a tool to assist the decision maker in identifying the optimal solution for a business decision.
Linear Programming Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill.
DAY 10: EXCEL CHAPTER 8, 9, 10 Tazin Afrin September 23,
1 1 Slide © 2001 South-Western College Publishing/Thomson Learning Anderson Sweeney Williams Anderson Sweeney Williams Slides Prepared by JOHN LOUCKS QUANTITATIVE.
Linear Programming Problem. Definition A linear programming problem is the problem of optimizing (maximizing or minimizing) a linear function (a function.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 3 Basics of the Simplex Algorithm.
Chapter 2 Introduction to Linear Programming n Linear Programming Problem n Problem Formulation n A Maximization Problem n Graphical Solution Procedure.
Math Programming Concept of Optimization (L.O. a ) Linear Programming Managerial Value of Information (L.O. d) Theory (L.O. b) Example Applications (L.O.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Supplement 6 Linear Programming.
3 Components for a Spreadsheet Optimization Problem  There is one cell which can be identified as the Target or Set Cell, the single objective of the.
Kerimcan OzcanMNGT 379 Operations Research1 Linear Programming Chapter 2.
CDAE Class 15 Oct. 16 Last class: Result of group project 1 3. Linear programming and applications Class Exercise 7 Today: 3. Linear programming.
CDAE Class 16 Oct. 18 Last class: 3. Linear programming and applications Quiz 4 Today: Result of Quiz 4 3. Linear programming and applications Group.
Simplex Method Review. Canonical Form A is m x n Theorem 7.5: If an LP has an optimal solution, then at least one such solution exists at a basic feasible.
Linear Programming McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
Operations Research.  Operations Research (OR) aims to having the optimization solution for some administrative problems, such as transportation, decision-making,
Linear programming Lecture (4) and lecture (5). Recall An optimization problem is a decision problem in which we are choosing among several decisions.
Exploring Microsoft Office Exploring Excel Appendix C
Chapter 2 Linear Programming Models: Graphical and Computer Methods
An Introduction to Linear Programming Pertemuan 4
Digital Lesson Linear Programming.
Problem 1 Demand Total There are 20 full time employees, each can produce 10.
A seminar talk on “SOLVING LINEAR PROGRAMMING PROBLEM BY GRAPHICAL METHOD” By S K Indrajitsingha M.Sc.
Systems of Equations and Inequalities
Solver & Optimization Problems
Digital Lesson Linear Programming.
Excel Solver.
Constrained Optimization
Ch 11 Resource Constraints and Linear Programming
Introduction to linear programming (LP): Minimization
3-3 Optimization with Linear Programming
INFM 718A / LBSC 705 Information For Decision Making
7.5 – Constrained Optimization: The Method of Lagrange Multipliers
Linear Programming Example: Maximize x + y x and y are called
Linear Programming Problem
LINEARPROGRAMMING 4/26/2019 9:23 AM 4/26/2019 9:23 AM 1.
Lecture 19 Linear Program
Graphical solution A Graphical Solution Procedure (LPs with 2 decision variables can be solved/viewed this way.) 1. Plot each constraint as an equation.
Practical Issues Finding an initial feasible solution Cycling
BUS-221 Quantitative Methods
Presentation transcript:

INFM 718A / LBSC 705 Information For Decision Making Lecture 4

Overview Linear Programming Recap –Modeling –Graphical Solution Approach –In-Class Exercises 2.2 and 2.3 Excel Solution Approach (Solver) –Maximization Example –In-Class Exercises 2.1, 2.2 and 2.3 in Solver –Minimization Example

Linear Programming Decision models that involve decision variables whose feasible values are bounded by a set of constraints, aiming to maximize utility/profit, or minimize loss/cost.

Modeling LP Problems What are the decision variables? What is the goal (max./min.)? Maximize/Minimize what? What are the constraints?

Modeling

Graphical Solution

Solve for inequalities that intersect at the Optimal Solution Point.

In-Class Exercises

Excel Approach (Solver) Build a spreadsheet representation of the model. Define the target cell, max./min and constraints in Solver Let Solver solve.

Spreadsheet Representation Decision variables Values of decision variables at optimal solution point. (Leave blank.) Constraints Contributions to objective function Value of objective function at OSP. Cells in red type are formulas; other cell values are entered manually.

Solver Definition

Let Solver Solve

Solver Solution

Exercises Solve the following using Solver: –Maximization Example –In-Class Exercises 2.1, 2.2, and 2.3 –Minimization Example