ماهي بحوث العمليات What is Operations Researches

Slides:



Advertisements
Similar presentations
Integer Optimization Basic Concepts Integer Linear Program(ILP): A linear program except that some or all of the decision variables must have integer.
Advertisements

Geometry and Theory of LP Standard (Inequality) Primal Problem: Dual Problem:
© 2003 Anita Lee-Post Linear Programming Part 2 By Anita Lee-Post.
1Introduction to Linear ProgrammingLesson 2 Introduction to Linear Programming.
Linear Programming Problem
LINEAR PROGRAMMING (LP)
Lesson 08 Linear Programming
Linear Programming (LP) Decision Variables Objective (MIN or MAX) Constraints Graphical Solution.
Chapter 2: Modeling with Linear Programming & sensitivity analysis
2-1 Linear Programming: Model Formulation and Graphical Solution Chapter 2 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall.
BA 452 Lesson A.2 Solving Linear Programs 1 1ReadingsReadings Chapter 2 An Introduction to Linear Programming.
Managerial Decision Modeling with Spreadsheets
Chapter 2 Linear Programming Models: Graphical and Computer Methods © 2007 Pearson Education.
Linear Programming Special Cases Alternate Optimal Solutions No Feasible Solution Unbounded Solutions.
Introduction to Management Science
Linear and Integer Programming Models
6s-1Linear Programming CHAPTER 6s Linear Programming.
Linear Programming: Model Formulation and Graphical Solution
Linear Programming Models: Graphical Methods 5/4/1435 (1-3 pm)noha hussein elkhidir.
Chapter 3 An Introduction to Linear Programming
LP formulation of Economic Dispatch
FORMULATION AND GRAPHIC METHOD
Linear programming. Linear programming… …is a quantitative management tool to obtain optimal solutions to problems that involve restrictions and limitations.
1 1 Slide LINEAR PROGRAMMING: THE GRAPHICAL METHOD n Linear Programming Problem n Properties of LPs n LP Solutions n Graphical Solution n Introduction.
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
9/1 More Linear Programming Collect homework Roll call Review homework Lecture - More LP Small Groups Lecture - Start using MS Excel Assign Homework.
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
Chapter 2 Linear Programming Models: Graphical and Computer Methods
3.4 Linear Programming.
1 1 Slide Integer Linear Programming Professor Ahmadi.
1 1 Slide Integer Linear Programming Professor Ahmadi.
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.
2-1 Linear Programming: Model Formulation and Graphical Solution Chapter 2 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall.
1 Linear Programming: Model Formulation and Graphical Solution.
THE GALAXY INDUSTRY PRODUCTION PROBLEM -
1 1 Slide © 2005 Thomson/South-Western Chapter 2 Introduction to Linear Programming n Linear Programming Problem n Problem Formulation n A Maximization.
Introduction to Linear Programming BSAD 141 Dave Novak.
Linear Programming – Simplex Method
1 1 Slide © 2001 South-Western College Publishing/Thomson Learning Anderson Sweeney Williams Anderson Sweeney Williams Slides Prepared by JOHN LOUCKS QUANTITATIVE.
1 Max 8X 1 + 5X 2 (Weekly profit) subject to 2X 1 + 1X 2  1000 (Plastic) 3X 1 + 4X 2  2400 (Production Time) X 1 + X 2  700 (Total production) X 1.
Linear Programming Problem. Definition A linear programming problem is the problem of optimizing (maximizing or minimizing) a linear function (a function.
Chapter 2 Introduction to Linear Programming n Linear Programming Problem n Problem Formulation n A Maximization Problem n Graphical Solution Procedure.
Introduction to linear programming:- - Linear programming (LP) applies to optimization models in which the objective and constraints functions are strictly.
Monday WARM-UP: TrueFalseStatementCorrected Statement F 1. Constraints are conditions written as a system of equations Constraints are conditions written.
Chapter 2 Linear Programming Models: Graphical and Computer Methods
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Supplement 6 Linear Programming.
Constraints Feasible region Bounded/ unbound Vertices
Foundation of the Simplex Method.  Constraints Boundary Equations  Graphical approach is very limited based on number of variables. The simplex method.
Kerimcan OzcanMNGT 379 Operations Research1 Linear Programming Chapter 2.
LINEAR PROGRAMMING 3.4 Learning goals represent constraints by equations or inequalities, and by systems of equations and/or inequalities, and interpret.
CDAE Class 15 Oct. 16 Last class: Result of group project 1 3. Linear programming and applications Class Exercise 7 Today: 3. Linear programming.
Reid & Sanders, Operations Management © Wiley 2002 Linear Programming B SUPPLEMENT.
LINEAR PROGRAMMING Classic Types of Constrained Decision Problems 1. Product Mix 2. Ingredient Mix 3. Transportation 4. Assignment 5. Time Period.
© 2009 Prentice-Hall, Inc. 7 – 1 Decision Science Chapter 3 Linear Programming: Maximization and Minimization.
Introduction Operations Research (OR) It is a scientific approach to determine the optimum (best) solution to a decision problem under the restriction.
1 1 Slide Graphical solution A Graphical Solution Procedure (LPs with 2 decision variables can be solved/viewed this way.) 1. Plot each constraint as an.
Chapter 2 Linear Programming Models: Graphical and Computer Methods
An Introduction to Linear Programming
Decision Support Systems
An Introduction to Linear Programming Pertemuan 4
Chapter 2 An Introduction to Linear Programming
A seminar talk on “SOLVING LINEAR PROGRAMMING PROBLEM BY GRAPHICAL METHOD” By S K Indrajitsingha M.Sc.
Linear Programming in Two Dimensions
Max Z = x1 + x2 2 x1 + 3 x2  6 (1) x2  1.5 (2) x1 - x2  2 (3)
Linear Programming Problem
Graphical solution A Graphical Solution Procedure (LPs with 2 decision variables can be solved/viewed this way.) 1. Plot each constraint as an equation.
Introduction to Linear Programming
Presentation transcript:

ماهي بحوث العمليات What is Operations Researches الباب الأول CHAPTER 1 ماهي بحوث العمليات What is Operations Researches د. فاتن مؤمن

Making a search a bout the history and developing of Assignment 1 : Making a search a bout the history and developing of “OPERATIONS RESEARCHES” د. فاتن مؤمن

النمذجة بالبرمجة الخطية MODELLING WITH LINEAR PROGRAMMING الباب الثاني CHAPTER 2 النمذجة بالبرمجة الخطية MODELLING WITH LINEAR PROGRAMMING د. فاتن مؤمن

The LP model, as in any OR model has three pasic components: page 12 1- Decision variables that we seek to determine. 2- Objective (goal) that we need to optimize ( maximize or minimize). 3- Constrains that the solution must satisfy. د. زكية الصيعري

Model page 14 Properties of the LP 1- Proportionality التناسبية التجميع 2- Additivity. التأكد التام 3- Certainly د. زكية الصيعري

GRAPHICAL SOLUTION The graphical procedure includes two steps: 1- Determination of the feasible solution space. Determination of the optimum solution from among all the bfeasible points in the solution space. د. فاتن مؤمن

The feasible solution space: page 17 The feasible solution space of the problem represents the area in the first quadrant in wich all the constrains are satisfied simultaneously. All points in or on the boundry of the area is feasible solution. All points outside this area are infeasible د.زكية الصيعري

Corner point: page 18 An important characteristic of the optimum LP solution is that it is always associatedيتحقق with a corner point of the solution space ( where two lines intersect)نقطة تقاطع خطين د. زكية الصيعري

Solution of a Mximization Model page 16 Example 2.2.1 د. زكية الصيعري

EXAMPLE Determine the feasible solution space and the optimum solution of the following model. د. زكية الصيعري

EXAMPLE Select the best answer: The corner points of the following system are : A) (0,0) , (0,2), (2,0) and (2,2) B) (0,0) , (0,2) and (2,0) C ) (0,0) , (2,0) and (2,2) D) (-2,0) , (2,0) and (2,2) د. زكية الصيعري

Solution of a Minimization Model page 23 Example 2.2.2 ( Diet Problem) Ozark Farms uses at least 800 Ib of special feed. the د. زكية الصيعري

Assignment 2 : Determine the feasible solution space and the optimum solution of the following model Max Z د. زكية الصيعري

Assignment 2 : Determine the feasible solution space and the optimum solution of the following model Min Z د. زكية الصيعري