Download presentation

Presentation is loading. Please wait.

Published byKeyon Dwight Modified over 2 years ago

1
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery Lecture 6

2
Optimization of thermal processes2007/2008 Linear programming (LP) problems −General statement −Standard form of LP problem Example of LP problem −Transformation to standard form −Graphical solution method Pivotal reduction of a system of linear equations (Gauss-Jordan method) Concepts and theorems fundamental for the simplex method Simplex algorithm Overview

3
Optimization of thermal processes2007/2008 A linear programming (LP) problem Objective function Feasible region Feasible region is convex as the constraint functions are convex (linear). Here is the maximum

4
Optimization of thermal processes2007/2008 Standard form of a linear programming problem Minimize subject to the constraints cost coefficients All decision variables are nonnegative m linear equations known constants

5
Optimization of thermal processes2007/2008 How to transform any linear programming problem into the standard form? Maximize is equivalent to minimize 1. 2. If some of the decision variables are unrestricted in sign, we can express them as the difference of two nonnegative variables: where

6
Optimization of thermal processes2007/2008 How to transform any linear programming problem into the standard form? 3. An inequality constraint in the form: can be converted into the equality by adding a nonnegative slack variable: Slack variable 4. Similarly, for inequality constraints in the form: we substract a nonnegative surplus variable: Surplus variable

7
Optimization of thermal processes2007/2008 Example of linear programming problem Two products (denoted by I and II respectively) can be manufactured at the factory with the use of three ingredients: A, B and C. The amount of the ingredients required for one unit of each of the products is as follows: III A45 B52 C38 The total avalaible amount of the ingredients is: ABC 10 12 The profit for product I is 5 zl per unit, for product II – 3 zl per unit. Maximize the profit.

8
Optimization of thermal processes2007/2008 Transformation to the standard form (example contd) Design vector Number of units of product I Number of units of product II Objective function (the profit) Constraints Standard form minimize Slack variables

9
Feasible region Optimization of thermal processes2007/2008 Graphical method of solution (example contd) 1 2 3 4 5 1234 Objective function surfaces optimum We are looking for the objective function surface representing the largest value, intersecting one of the extreme points (vertices) of the feasible region. Of course, this method is not very accurate and can be applied only to two dimensional problems (with two design variables). We definitely need a better and more general method.

10
Optimization of thermal processes2007/2008 How to solve a set of linear equations? (n equations, n unknowns) We can: multiply any equation by any non-zero constant add any two equations Using only these two operations we can eliminate a particular variable from all but one equations. This elimination is called pivot operation. For instance, we can eliminate x 2 : x 2 eliminated we pivot on this term

11
Optimization of thermal processes2007/2008 How to solve a set of linear equations? (n equations, n unknowns) Performing pivot operation on all variables we can solve the whole system of equations. This is Gauss-Jordan elimination. Canonical form From the canonical form the solution can be directly obtained as

12
Optimization of thermal processes2007/2008 Pivotal reduction of a general system of equations (m equations, n unknowns) Performing pivotal operations with respect to any set of m variables, say x 1, x 2,..., x m, we obtain: Canonical system with pivotal variables: x 1, x 2,..., x m Pivotal variablesNonpivotal or independent variables

13
Optimization of thermal processes2007/2008 Pivotal reduction of a general system of equations (m equations, n unknowns) One special solution can be deduced from the canonical system : This solution is called a basic solution. Thus, to obtain basic solution we: choose m pivotal variables; they are called basic variables; the set of basic variables is called a basis perform pivotal reduction with respect to the basic variables set the independent variables to zero; they are called nonbasic variables The importance of the basic solution stems from the fact that it corresponds to the extreme point (vertex) of a feasible region.

14
Optimization of thermal processes2007/2008 Some important theorems A region where constraints are satisfied (feasible region) in LP problem is a convex set. Convex sets a b Nonconvex (concave) sets For a convex set any segment line joining any two poins is also in the set. These points are outside. Extreme point (vertex) Vertex is a point in the convex set that does not lie on a line segment joing two other points of the set. The minimum of a linear function over a convex set is attained at a vertex of this set.

15
Optimization of thermal processes2007/2008 Some important theorems Feasible solution in LP problem is the solution that satisfies the constraints (see the standard form of LP problem): Equality constraints Nonnegativity conditions Basic feasible solution is basic solution that satisfies the nonnegativity conditions: Every basic feasible solution is an extreme point (vertex) of the convex set of feasible solutions. The minimum of a linear function over a convex set is attained at a vertex of this set. Looking for the optimal solution we just have to inspect basic feasible solutions. This is the basis of the simplex method

16
Optimization of thermal processes2007/2008 Motivation of the simplex method Given a system of linear equations corresponding to the constraints of the LP problem we can generate all basic solutions We pick only the feasible solutions (nonnegative variables) We calculate the value of the objective function for the given solution From obtained values we take the minimal one Unfortunetely, such procedure could be tedious and inefficient. The number of basic solutions to inspect is equal to: e.g. for n=20, m=10 we have 184756 basic solutions But many of these solutions are not feasible What we really need is a computational scheme that: examines a sequence of basic feasible solutions each of which corresponds to a lower value of f until minimum is reached

17
Nonbasic variables Basic variables (including -f) Optimization of thermal processes2007/2008 Simplex algorithm Start point – the constraints and the objective function in canonical form: Constraints Objective function Basic solution:

18
Optimization of thermal processes2007/2008 Simplex algorithm A basic feasible solution is an optimal solution with a minimum objective function value if all the cost coefficients are nonnegative. Why? We can write: These variables are presently zero and are constrained to be nonnegative. If all are positive then increasing any cannot decrease the value of the objective function Otherwise, we can improve the solution by increasing some of the nonbasic variables: we change the basis by introducing new variable x s for which:

19
Optimization of thermal processes2007/2008 Simplex algorithm Now, we can observe what happens to present basic variables, when we increase the new one: All the variables should stay nonnegative, so the largest value we are allowed to take is:

20
Optimization of thermal processes2007/2008 Simplex algorithm For this specific value we obtain: It is not difficult to see, that we can obtain the same result by single pivot operation on the element Thus, we reach another basic feasible solution with a new basis This new basic solution corresponds to a lower objective function value

21
Optimization of thermal processes2007/2008 Simplex algorithm - example Maximize subject to

22
Optimization of thermal processes2007/2008 Thank you for your attention

Similar presentations

OK

Chapter 6 Linear Programming: The Simplex Method Section 2 The Simplex Method: Maximization with Problem Constraints of the Form ≤

Chapter 6 Linear Programming: The Simplex Method Section 2 The Simplex Method: Maximization with Problem Constraints of the Form ≤

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on revolution of the earth and seasons diagram Ppt on agriculture in india pdf Ppt on event management system Ppt on any topic of maths for class 9 Best ppt on history of cricket Ppt on do's and don'ts of group discussion strategies Ppt on steam reforming of ethanol Ppt on art and craft movement furniture Ppt on business plan for new business Ppt on wildlife and natural vegetation of india