Chapter 15 Constrained Optimization. The Linear Programming Model Let : x 1, x 2, x 3, ………, x n = decision variables Z = Objective function or linear.

Slides:



Advertisements
Similar presentations
Linear Programming, 1 Max c 1 *X 1 +…+ c n *X n = z s.t. a 11 *X 1 +…+ a 1n *X n  b 1 … a m1 *X 1 +…+ a mn *X n  b m X 1, X n  0 Standard form.
Advertisements

© 2003 Anita Lee-Post Linear Programming Part 2 By Anita Lee-Post.
Solving LP Models Improving Search Special Form of Improving Search
Linear Programming Problem
Lecture 3 Linear Programming: Tutorial Simplex Method
Linear Programming (LP) (Chap.29)
Linear Programming – Simplex Method
Introduction to Algorithms
Linear Programming.
Water Resources Development and Management Optimization (Linear Programming) CVEN 5393 Feb 18, 2013.
BA 452 Lesson A.2 Solving Linear Programs 1 1ReadingsReadings Chapter 2 An Introduction to Linear Programming.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or.
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
Linear Inequalities and Linear Programming Chapter 5 Dr.Hayk Melikyan/ Department of Mathematics and CS/ Linear Programming in two dimensions:
Linear Programming Fundamentals Convexity Definition: Line segment joining any 2 pts lies inside shape convex NOT convex.
Basic Feasible Solutions: Recap MS&E 211. WILL FOLLOW A CELEBRATED INTELLECTUAL TEACHING TRADITION.
Operation Research Chapter 3 Simplex Method.
INFM 718A / LBSC 705 Information For Decision Making Lecture 4.
ENGR 351 Numerical Methods Instructor: Dr. L.R. Chevalier
Chapter 10: Iterative Improvement
6s-1Linear Programming CHAPTER 6s Linear Programming.
Optimization Linear Programming and Simplex Method
The Simplex Method.
Optimization of Linear Problems: Linear Programming (LP) © 2011 Daniel Kirschen and University of Washington 1.
Solving Linear Programming Problems Using Excel Ken S. Li Southeastern Louisiana University.
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
Chapter 19 Linear Programming McGraw-Hill/Irwin
Linear Programming David Kauchak cs161 Summer 2009.
Linear Programming Topics General optimization model LP model and assumptions Manufacturing example Characteristics of solutions Sensitivity analysis Excel.
Some Key Facts About Optimal Solutions (Section 14.1) 14.2–14.16
1 1 Slide Linear Programming (LP) Problem n A mathematical programming problem is one that seeks to maximize an objective function subject to constraints.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Chapter 15.
ECE 556 Linear Programming Ting-Yuan Wang Electrical and Computer Engineering University of Wisconsin-Madison March
1 Chapter 7 Linear Programming. 2 Linear Programming (LP) Problems Both objective function and constraints are linear. Solutions are highly structured.
Chapter 7 Introduction to Linear Programming
1 1 Slide © 2005 Thomson/South-Western Chapter 2 Introduction to Linear Programming n Linear Programming Problem n Problem Formulation n A Maximization.
Linear Programming – Simplex Method
Linear Programming Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill.
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.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 3 Basics of the Simplex Algorithm.
CDAE Class 13 Oct. 10 Last class: Result of Quiz 3 3. Linear programming and applications Class exercise 5 Today: 3. Linear programming and applications.
McGraw-Hill/Irwin © The McGraw-Hill Companies, Inc., Table of Contents CD Chapter 14 (Solution Concepts for Linear Programming) Some Key Facts.
Simplex Method Simplex: a linear-programming algorithm that can solve problems having more than two decision variables. The simplex technique involves.
Foundation of the Simplex Method.  Constraints Boundary Equations  Graphical approach is very limited based on number of variables. The simplex method.
Linear Programming: Formulations, Geometry and Simplex Method Yi Zhang January 21 th, 2010.
CDAE Class 15 Oct. 16 Last class: Result of group project 1 3. Linear programming and applications Class Exercise 7 Today: 3. Linear programming.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
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.
1 Optimization Linear Programming and Simplex Method.
EMGT 5412 Operations Management Science Linear Programming: Introduction, Formulation and Graphical Solution Dincer Konur Engineering Management and Systems.
1 LP-3 Symplex Method. 2  When decision variables are more than 2, it is always advisable to use Simplex Method to avoid lengthy graphical procedure.
6s-1Linear Programming William J. Stevenson Operations Management 8 th edition.
1 Introduction to Linear Programming Linear Programming Problem Linear Programming Problem Problem Formulation Problem Formulation A Simple Maximization.
Chapter 4 The Simplex Algorithm and Goal Programming
Linear Programming for Solving the DSS Problems
Module Outline Introduction The Linear Programming Model
An Introduction to Linear Programming Pertemuan 4
Constrained Optimization
Linear Programming Prof. Sweta Shah.
Linear Programming.
ENGM 631 Optimization Ch. 4: Solving Linear Programs: The Simplex Method.
Chapter 3 The Simplex Method and Sensitivity Analysis
Solving Linear Programming Problems: Asst. Prof. Dr. Nergiz Kasımbeyli
Linear Programming Problem
Linear Programming.
Graphical solution A Graphical Solution Procedure (LPs with 2 decision variables can be solved/viewed this way.) 1. Plot each constraint as an equation.
Chapter 2. Simplex method
Presentation transcript:

Chapter 15 Constrained Optimization

The Linear Programming Model Let : x 1, x 2, x 3, ………, x n = decision variables Z = Objective function or linear function Objective: Maximize Z = c 1 x 1 + c 2 x 2 + c 3 x 3 + ………+ c n x n subject to the following constraints: where a ij, b i, and c j are given constants.

In more efficient notation: The decision variables, x I, x 2,..., x n, represent levels of n competing activities. The Linear Programming Model

EXAMPLE: Gas Processing Problem (Chemical/Petroleum Engineering Problem) Company receives a fixed amount of raw gas each week. Processes it to produce two grades of heating gas, regular and premium quality. Each yields different profits, and involves different time and on-site storage constraints. Objective: maximize profit without violating the material, time, and storage constraints Solve using: 1.Graphical Method 2.Simplex Method 3.Excel solver (Simplex LP)

Graphical Solution

Aside from a single optimal solution; there are three other possible outcomes: (a)Alternative optima (b)no feasible solution (c)an unbounded result

 When decision variables are more than 2, it is always advisable to use Simplex Method to avoid lengthy graphical procedure.  It does not examine all the feasible solutions. Only the extreme points  It deals only with a small and unique set of feasible solutions, the set of vertex points (i.e., extreme points) of the convex feasible space that contains the optimal solution. The Simplex Method

Steps involved: 1.Locate an extreme point of the feasible region. 2.Examine each boundary edge intersecting at this point to see whether movement along any edge increases the value of the objective function. 3.If the value of the objective function increases along any edge, move along this edge to the adjacent extreme point. If several edges indicate improvement, the edge providing the greatest rate of increase is selected. 4.Repeat steps 2 and 3 until movement along any edge no longer increases the value of the objective function. The Simplex Method

**Here

Try point A (x1=0, x2=0) first. Then pick a leaving variable and an entering variable which will make Z bigger. In this example, x2 should be chosen to enter but to make it simple we will choose x1 to enter. S2 will become a nonbasic variable (the leaving variable). This will take us to point B.

Gas Processing Problem *Write down the equations on the Excel Sheet. *Demonstrate how to use the solver in Excel Excel Solution