Cairo University Institute of Statistical Studies and Research - ISSR

Slides:



Advertisements
Similar presentations
Linear Programming Problem
Advertisements

INTRODUCTION TO OPERATIONS RESEARCH Presented by Augustine Muhindo 祥瑞 Mentor: Prof. Zhou Jian 34 th Seminar /summer,2012.
Linear Programming Problem. Introduction Linear Programming was developed by George B Dantzing in 1947 for solving military logistic operations.
Linear Programming Problem
Linear Programming Models & Case Studies
Session II – Introduction to Linear Programming
CCMIII U2D4 Warmup This graph of a linear programming model consists of polygon ABCD and its interior. Under these constraints, at which point does the.
Introduction to Management Science
Water Resources Development and Management Optimization (Linear Programming) CVEN 5393 Feb 18, 2013.
Chapter 5 Linear Inequalities and Linear Programming
Linear Inequalities and Linear Programming Chapter 5 Dr.Hayk Melikyan/ Department of Mathematics and CS/ Linear Programming in two dimensions:
Learning Objectives for Section 5.3
Chapter 5 Linear Inequalities and Linear Programming Section 3 Linear Programming in Two Dimensions: A Geometric Approach.
Lesson 7.6, page 767 Linear Programming
Managerial Decision Modeling with Spreadsheets
1© 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Linear Programming: Formulations & Graphical Solution.
© 2008 Prentice-Hall, Inc. Chapter 7 To accompany Quantitative Analysis for Management, Tenth Edition, by Render, Stair, and Hanna Power Point slides created.
McGraw-Hill/Irwin © The McGraw-Hill Companies, Inc., Three Classic Applications of LP Product Mix at Ponderosa Industrial –Considered limited.
EMGT 501 HW # Due Day: Sep 14.
Chapter 2: Introduction to Linear Programming
1 1 Slide Chapter 14: Goal Programming Goal programming is used to solve linear programs with multiple objectives, with each objective viewed as a "goal".
Environmentally Conscious Design & Manufacturing (ME592) Date: May 3, 2000 Slide:1 Environmentally Conscious Design & Manufacturing Class 24: Optimization.
Linear Programming Econ Outline  Review the basic concepts of Linear Programming  Illustrate some problems which can be solved by linear programming.
Linear Programming Applications
Linear Programming Models: Graphical and Computer Methods
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 2 Introduction to Linear Programming.
Introduction to Quantitative Business Methods (Do I REALLY Have to Know This Stuff?)
1© 2003 by Prentice Hall, Inc. Upper Saddle River, NJ The Wyndor Glass Company Problem (Hillier and Liberman) The Wyndor Glass Company is planning.
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
Introduction to Linear Programming
Table of Contents Chapter 2 (Linear Programming: Basic Concepts)
Chapter 19 Linear Programming McGraw-Hill/Irwin
Ardavan Asef-Vaziri Systems and Operations Management
The Dual Problem: Minimization with problem constraints of the form ≥
Optimization Models Mathematical optimization models usually contain an objective (what to do) constraints (the rules that must be followed). Also referred.
Linear Programming: Basic Concepts
Chapter 6 Supplement Linear Programming.
1 Linear Programming Chapter 2 By Mohammad Shahid Khan M.Eco, MBA, B.Cs, B.Ed. Lecturer in Economics & Business Administration Department of Economics.
1 1 Slide © 2005 Thomson/South-Western Chapter 2 Introduction to Linear Programming n Linear Programming Problem n Problem Formulation n A Maximization.
 A concert promoter wants to book a rock group for a stadium concert. A ticket for admission to the stadium playing field will cost $125, and a ticket.
Opener. Notes: 3.4 Linear Programming Optimization  Many real-life problems involve a process called optimization.  This means finding a maximum or.
Linear Programming Introduction: Linear programming(LP) is a mathematical optimization technique. By “Optimization” technique we mean a method which attempts.
Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.
1 Linear Programming (LP) 線性規劃 - George Dantzig, 1947.
作業研究(二) Operations Research II - 廖經芳 、 王敏. Topics - Revised Simplex Method - Duality Theory - Sensitivity Analysis and Parametric Linear Programming -
Chapter 1 Introduction n Introduction: Problem Solving and Decision Making n Quantitative Analysis and Decision Making n Quantitative Analysis n Model.
HW # Due:
1 Optimization Techniques Constrained Optimization by Linear Programming updated NTU SY-521-N SMU EMIS 5300/7300 Systems Analysis Methods Dr.
BUAD306 Chapter 19 – Linear Programming. Optimization QUESTION: Have you ever been limited to what you can get done because you don’t have enough ________?
LINEAR PROGRAMMING MEANING:
© 2009 Prentice-Hall, Inc. 7 – 1 Decision Science Chapter 3 Linear Programming: Maximization and Minimization.
LINEAR PROGRAMMING. Linear Programming Linear programming is a mathematical technique. This technique is applied for choosing the best alternative from.
Linear Programming. George Dantzig 1947 NarendraKarmarkar Pioneers of LP.
University of Colorado at Boulder Yicheng Wang, Phone: , Optimization Techniques for Civil and Environmental Engineering.
EMGT 5412 Operations Management Science Nonlinear Programming: Introduction Dincer Konur Engineering Management and Systems Engineering 1.
Introduction Operations Research (OR) It is a scientific approach to determine the optimum (best) solution to a decision problem under the restriction.
Linear Programming Models: Graphical and Computer Methods 7 To accompany Quantitative Analysis for Management, Twelfth Edition, by Render, Stair, Hanna.
F2:Management Accounting. 2 Designed to give you knowledge and application of: Section F: Short–term decision–making techniques F1. Cost –Volume-Profit.
1 2 Linear Programming Chapter 3 3 Chapter Objectives –Requirements for a linear programming model. –Graphical representation of linear models. –Linear.
An Introduction to Linear Programming
Linear Programming.
Linear Programming Models: Graphical and Computer Methods
2.7 Linear Programming Objectives: Use linear programming procedures to solve applications. Recognize situations where exactly one solution to a linear.
Chapter 5 Linear Inequalities and Linear Programming
Linear Programming Dr. T. T. Kachwala.
Linear Programming Objectives: Set up a Linear Programming Problem
Linear Programming Problem
Module B Linear Programming.
Linear Programming.
Presentation transcript:

Cairo University Institute of Statistical Studies and Research - ISSR Operations Research Eng/ Noha Aboulfotoh

Course Information My advice: practice makes perfect! Textbook: Introduction to Operations research - Frederick S. Hillier & Gerald J. Lieberman Grading: [attendance + homework & quizzes + Case Study + mid-term exams = 30] [ Final Exam=70] [May be project will be added ] TA : Wael Rateb , Noha Aboulfotoh My advice: practice makes perfect! OR - ISSR

The Nature of Operations Research Operations Research is applied to problems that concern how to conduct and coordinate the operations (i.e., the activities) within an organization. The research part of the name means that operations research uses an approach that resembles the way research is conducted in established scientific fields. The scientific method is used to investigate the problem of concern. OR attempts to find a best solution (referred to as an optimal solution) for the problem under consideration. OR - ISSR

Steps: Define the problem of interest and gather relevant data. Determining the appropriate objectives and constraints, interrelationships between the area to be studied and other areas of the organization, possible alternative courses of action, time limits for making a decision, and so on. Formulate a mathematical model to represent the problem. Reformulate this problem in a form that is convenient for analysis. Mathematical models are also idealized representations, but they expressed in terms of mathematical symbols and expressions. Develop a computer-based procedure for deriving solutions to the problem from the model. OR - ISSR

Test the model and refine it as needed. Like the first version of the computer program. Some relevant factors or interrelationships have not been incorporated into the model, and some parameters have not been estimated correctly. So, Before you use the model, it must be thoroughly tested to try to identify and correct as many problems as possible. This process of testing and improving a model to increase its validity is commonly referred to as model validation. Prepare for the ongoing application of the model. install a well documented system for applying the model as prescribed by management. This system will include the model, solution procedure and operating procedures for implementation( Ex. number of computer programs) Implementation It is important both to make sure that model solutions are accurately translated to an operating procedure and to rectify any flaws in the solutions that are then uncovered. OR - ISSR

linear programming Linear programming uses a mathematical model to describe the problem. ” linear” means that all the mathematical functions in this model are required to be linear functions. “programming“ does not refer here to computer programming ; it refers to planning. Thus, linear programming involves the planning of activities to obtain an optimal result, i.e., a result that reaches the specified goal. Graphical method Simplex method OR - ISSR

The feasible region is the collection of all feasible solutions. A feasible solution is a solution for which all the constraints are satisfied. An infeasible solution is a solution for which at least one constraint is violated. The feasible region is the collection of all feasible solutions. An optimal solution is a feasible solution that has the most favorable value of the objective function. Most favorable value is the largest value if the objective function is to be maximized , whereas it is the smallest value if the objective function is to be minimized. OR - ISSR

Example 1-1 For each of the following constraints, draw a separate graph to show the nonnegative solutions that satisfy this constraint. (a) x1 + 3x2 <= 6 (b) 4x1 + 3x2 <= 12 (c) 4x1 + x2 <=8 OR - ISSR

Problem 1-2 Use the graphical method to solve the problem: Maximize Z = 2x1 + x2, subject to x2 ≤ 10 2x1 + 5x2 ≤ 60 x1 + x2 ≤ 18 3x1 + x2 ≤ 44 and x1 ≥ 0, x2 ≥ 0. OR - ISSR

Example 1-3 Use the graphical method to demonstrate that the following model has no feasible solutions. Maximize = 5x1 + 7x2, subject to 2x1 + x2 ≤ 1 x1 + 2x2 ≤ 1 and x1 ≥ 0, x2 ≥ 0. OR - ISSR

Example 1-4 The Apex Television Company has to decide on the number of 27- and 20-inch sets to be produced at one of its factories. Market research indicates that at most 40 of the 27-inch sets and 10 of the 20-inch sets can be sold per month. The maximum number of work-hours available is 500 per month. A 27-inch set requires 20 work-hours and a 20-inch set requires 10 work-hours. Each 27-inch set sold produces a profit of $120 and each 20-inch set produces a profit of $80. A wholesaler has agreed to purchase all the television sets produced if the numbers do not exceed the maxima indicated by the market research. (a) Formulate a linear programming model for this problem. (b) Use the graphical method to solve this model. OR - ISSR

Example 1-5 The Whitt Window Company is a company with only three employees which makes two different kinds of hand-crafted windows: a wood-framed and an aluminum-framed window. They earn $60 profit for each wood-framed window and $30 profit for each aluminum-framed window. Doug makes the wood frames, and can make 6 per day. Linda makes the aluminum frames, and can make 4 per day. Bob forms and cuts the glass, and can make 48 square feet of glass per day. Each wood-framed window uses 6 square feet of glass and each aluminum-framed window uses 8 square feet of glass. The company wishes to determine how many windows of each type to produce per day to maximize total profit. (a) Describe the analogy between this problem and the Wyndor Glass Co. problem discussed in Sec. 3.1. Then construct and fill in a table like Table 3.1 for this problem, identifying both the activities and the resources. (b) Formulate a linear programming model for this problem. (c) Use the graphical model to solve this model. (d) A new competitor in town has started making wood-framed windows as well. This may force the company to lower the price they charge and so lower the profit made for each wood framed window. How would the optimal solution change (if at all) if the profit per wood-framed window decreases from $60 to $40? From $60 to $20? (e) Doug is considering lowering his working hours, which would decrease the number of wood frames he makes per day. How would the optimal solution change if he makes only 5 wood frames per day? OR - ISSR

Example 1-6 The Primo Insurance Company is introducing two new product lines: special risk insurance and mortgages. The expected profit is $5 per unit on special risk insurance and $2 per unit on mortgages. Management wishes to establish sales quotas for the new product lines to maximize total expected profit. The work requirements are as follows: (a) Formulate a linear programming model for this problem. (b) Use the graphical method to solve this model. (c) Verify the exact value of your optimal solution from part (b) by solving algebraically for the simultaneous solution of the relevant two equations OR - ISSR

Example 1-7 The Omega Manufacturing Company has discontinued the production of a certain unprofitable product line. This act created considerable excess production capacity. Management is considering devoting this excess capacity to one or more of three products; call them products 1, 2, and 3. The available capacity on the machines that might limit output is summarized in the following table: The number of machine hours required for each unit of the respective products is The sales department indicates that the sales potential for products 1 and 2 exceeds the maximum production rate and that the sales potential for product 3 is 20 units per week. The unit profit would be $50, $20, and $25, respectively, on products 1, 2, and 3. The objective is to determine how much of each product Omega should produce to maximize profit. (a) Formulate a linear programming model for this problem. (b) Use a computer to solve this model by the simplex method. OR - ISSR

Example 1-8 Dwight is an elementary school teacher who also raises pigs for supplemental income. He is trying to decide what to feed his pigs. He is considering using a combination of pig feeds available from local suppliers. He would like to feed the pigs at minimum cost while also making sure each pig receives an adequate supply of calories and vitamins. The cost, calorie content, and vitamin content of each feed is given in the table below. Each pig requires at least 8,000 calories per day and at least 700 units of vitamins. A further constraint is that no more than one-third of the diet (by weight) can consist of Feed Type A, since it contains an ingredient which is toxic if consumed in too large a quantity. (a) Formulate a linear programming model for this problem. (b) Use the graphical method to solve this model. What is the resulting daily cost per pig? OR - ISSR

Example 1-9 A cargo plane has three compartments for storing cargo: front, center, and back. These compartments have capacity limits on both weight and space, as summarized below: Furthermore, the weight of the cargo in the respective compartments must be the same proportion of that compartment’s weight capacity to maintain the balance of the airplane. The following four cargoes have been offered for shipment on an upcoming flight as space is available: Any portion of these cargoes can be accepted. The objective is to determine how much (if any) of each cargo should be accepted and how to distribute each among the compartments to maximize the total profit for the flight. (a) Formulate a linear programming model for this problem. (b) Solve this model by the simplex method to find one of its multiple optimal solutions. OR - ISSR