A more complex LP problem with What’sBest!

Slides:

Advertisements

Similar presentations

Agenda of Week III. LP I LP Standardization Optimization LP intro Week Definition Basic assumptions Example General form Standard form Objective.

Advertisements

The Distance Formula. What is The Distance Formula? The Distance formula is a formula used to find the distance between to different given points on a.

© 2003 Anita Lee-Post Linear Programming Part 2 By Anita Lee-Post.

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.

LP Examples Solid Waste Management

Goal Programming How do you find optimal solutions to the following?

Chapter 2 Linear Programming Models: Graphical and Computer Methods © 2007 Pearson Education.

MANAGEMENT SCIENCE 461 Lecture 1a – Introduction September 9, 2008.

Lecture 7: Linear Programming in Excel AGEC 352 Spring 2011 – February 9, 2011 R. Keeney.

PROFESSOR GOODCHILD CEE 587 APRIL 15, 2009 Basic Optimization.

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

Lecture outline Support vector machines. Support Vector Machines Find a linear hyperplane (decision boundary) that will separate the data.

Hardness Results for Problems P: Class of “easy to solve” problems Absolute hardness results Relative hardness results –Reduction technique.

Linear Programming Optimal Solutions and Models Without Unique Optimal Solutions.

Session 1b. Decision Models -- Prof. Juran2 Overview Spreadsheet Conventions Copying, Pasting, Reporting Introduction to Solver.

Linear Programming Models: Graphical Methods 5/4/1435 (1-3 pm)noha hussein elkhidir.

3 Components for a Spreadsheet Linear Programming Problem There is one cell which can be identified as the Target or Set Cell, the single objective of.

1 Lecture 4 Maximal Flow Problems Set Covering Problems.

Quantitative Methods of Management

1 1 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole.

1 1 Slide © 2005 Thomson/South-Western Chapter 8 Integer Linear Programming n Types of Integer Linear Programming Models n Graphical and Computer Solutions.

Spreadsheets Introduction. What is a spreadsheet? A spreadsheet program is used to manipulate numbers One of the most popular spreadsheet programs is.

Example 15.1 Daily Scheduling of Postal Employees Workforce Scheduling Models.

Chapter 7 Transportation, Assignment, and Transshipment Problems

Advanced Excel Microsoft Excel Excel - Overview Calculator Create budgets, analyze results Perform Financial Analysis Creating charts Organizing.

Algebra 1 Mini-Lessons Which graph shows a solution that is at least 7 and less than 11? MA.912.A.3.4: Solve and graph simple and compound inequalities.

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.

DAY 10: EXCEL CHAPTER 8, 9, 10 Tazin Afrin September 23,

3 Characteristics of an Optimization Problem General descriptionKPiller Illustration Decisions that must be made; represented by decision variables How.

1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.

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.

Chapter 7 Problem 38 Part A Decision Variables: S – Standard grade material P – Professional grade material Objective: Minimize total cost: 7.50S P.

8/14/04 J. Bard and J. W. Barnes Operations Research Models and Methods Copyright All rights reserved Lecture 6 – Integer Programming Models Topics.

Chapter 8 Integer Linear Programming n Types of Integer Linear Programming Models n Graphical and Computer Solutions for an All- Integer Linear Program.

IE 312 Review 1. The Process 2 Problem Model Conclusions Problem Formulation Analysis.

Introduction to Integer Programming Integer programming models Thursday, April 4 Handouts: Lecture Notes.

-114- HMP654/EXECMAS Linear Programming Linear programming is a mathematical technique that allows the decision maker to allocate scarce resources in such.

2009/6/30 CAV Quantifier Elimination via Functional Composition Jie-Hong Roland Jiang Dept. of Electrical Eng. / Grad. Inst. of Electronics Eng.

Prepared By: Maxine Cunningham John Schmidt Jonathan Braams 4/4/2009 Production Facility Optimization.

Spreadsheet Engineering

Chapter 2 Linear Programming Models: Graphical and Computer Methods

Decision Support Systems

Aksel Thomsen Erik Sommer

Problem 1 Demand Total There are 20 full time employees, each can produce 10.

L14 Curve Fitting Homework Curve Fitting – least squares

A seminar talk on “SOLVING LINEAR PROGRAMMING PROBLEM BY GRAPHICAL METHOD” By S K Indrajitsingha M.Sc.

Solver & Optimization Problems

Presentation by Team 2.

Unit 9 – Spreadsheet Development

Ch 11 Resource Constraints and Linear Programming

The ABC’s of Optimization

How LINGO diagnoses solution issues

The ABC’s of Optimization

Handling Data Using Spreadsheets

Using WinQSB to solve Linear Programming Models

How What’sBest! diagnoses solution issues

Integer Programming with What’sBest

Integer Programming with LINGO

A more complex LP problem

Goal Programming How do you find optimal solutions to the following?

Decisions In today’s lesson we will look at:

Decisions In today’s lesson we will look at:

A more complex LP problem

Integer Programming with What’sBest

Graphical solution A Graphical Solution Procedure (LPs with 2 decision variables can be solved/viewed this way.) 1. Plot each constraint as an equation.

Using Formulas.

Chapter 1. Formulations.

BUS-221 Quantitative Methods

Presentation transcript:

A more complex LP problem with What’sBest! LSW2-1 A more complex LP problem with What’sBest! Parking Assignment LINDO Systems www.lindo.com

A new apartment condominium conversion is almost complete. A More Complex LP Example: Parking Assignment LSW2-2 A new apartment condominium conversion is almost complete. City fathers require each apartment to be assigned at least one parking spot. How to formulate? Are there likely to be alternate optimal solutions? If there are, what should be done about it? Apartments are in purple. Parking slots are in green.

Apartments Parking LSW2-3 From C. H. von Lanzenauer

Parking Assignment: What to do? LSW2-4 What are the decision variables? What sort of aggregation/approximation should we do? How do we measure “Best”? Simple total distance? What are the constraints? Other questions? How difficult would it be to minimize squared distance traveled?

Parking Problem in Simple Excel LSW2-5 What are the decision variables?

Parking Problem in Simple Excel LSW2-6

Parking Problem in Simple Excel LSW2-7 What are the constraints?

Parking Problem in Simple Excel LSW2-8 What are the constraints?

Parking Problem in Simple Excel LSW2-9 How do we measure “Best”?

Parking Problem in Simple Excel LSW2-10 A) Adjustable cells, D19:M28, B) Best cell (Min) N29, C) Constraints in D14:M14, and B19:B28 Solution shown is optimal.

Spreadsheets vs. LINGO LSW2-11 Spreadsheet advantages: 1) Large audience of users familiar with spreadsheets 2) Excellent report formatting, graphing, etc. 3) Good for two dimensional problems, e.g., suppliers & customers. LINGO Advantages: 1) Scalability and flexibility. Very easy to solve a 3 supplier, 5 customer, 2 period problem today, and a 10 supplier, 50 customer, 4 period problem tomorrow. No tedious copying of formulae. 2) Auditability: Very easy to see all the formulae in one place. 3) Multiple dimensions are not a problem, e.g. 10 suppliers, 50 customers, 12 periods, 60 products. 4) Sparse sets are easily handled, e.g., not all suppliers carry all products, do not serve all customers, etc.

Thank you for your attention. For more information, please visit www.m-focus.co.th or Call 02-513-9892