6 views

Uploaded by slv_prasaad

ot

- 161411-161601-Modelling, Simulation and Operations Research
- Operation Research 1
- Lecture 7
- Unit 2
- Operation Research
- 8 - Managerial Decision Making and Mathematical Optimization Problems_31Jan2019
- Linear Programming on TI-89
- Op Tim Matlab
- Simplex Method - Maximisation Case
- 10[2].1.1.127
- Worked Examples 04
- Introduction to Operations Research, 7th Edition
- System of Transportation
- Assignment 1 Or
- production control
- AC 303 Lecture 6 & 7 Linear Programming and Theory of Constraints
- Operations Research_internal assessment
- 01 Lp Graphical Method
- Deployment Optimization
- RuksaarLallmahomedOR.docx

You are on page 1of 46

A. Ravindran, K. M. Ragsdell, G. V. Reklaitis

Book Review

Page 1

Part 1: Ferhat Dikbiyik Part 2:Mohammad F. Habib

Page 2

LP solution techniques to specify the sequence of intermediate solution points.

(t )

The linearized subproblem at this point is updated The exact location of next iterate is determined by LP

( t 1)

The linearized subproblem cannot be expected to give a very good estimate of either boundaries of the feasible solution region or the contours of the objective function

Page 3

Rather than relying on the admittedly inaccurate linearization to define the precise location of a point, it is more realistic to utilize the linear approximations only to determine a locally good direction for search.

Page 4

Outline

9.2 Simplex Extensions for Linearly Constrained Problems 9.3 Generalized Reduced Gradient Method 9.4 Design Application

Page 5

G. Zoutendijk

Mehtods of Feasible Directions, Elsevier, Amsterdam, 1960

Page 6

Preliminaries

Page 7

Preliminaries

Page 8

Page 9

Suppose Define x as The first order Taylor approximation of f(x) is given by is a feasible point

In order for

, we have to have

Page 10

This relationship dictates the angle between d and to be greater than 90 and less than 270 .

Page 11

The first order Taylor approximation for constraints And with assumption (because its binding) In order for x to be a feasible, hence

Page 12

This relationship dictates the angle between d and has to be between 0 and than 90 .

Page 13

In order for x to solve the inequality constrained problem, the direction d has to be both a descent and feasible solution.

Page 14

Zoutendijks basic idea is at each stage of iteration to determine a vector d that will be both a feasible direction and a descent direction. This is accomplished numerically by finding a normalized direction vector d and a scalar parameter > 0 such that

Page 15

Page 16

The active constraint set is defined as

Page 17

Step 1. Solve the linear programming problem

and

Page 18

Step 2. If the iteration terminates, since no further improvement is possible. Otherwise, determine

If no

exists, set

Page 19

Step 3. Find such that

Set

and continue.

Page 20

Example 9.1

Page 21

Example 9.1

Page 22

Example 9.1

Since

is positive for all 0 and is not violated as is increased. To determine the point at which will be intersected, we solve

to

Page 23

Example 9.1

Page 24

Example 9.2

Page 25

The active constraint set used in the basic form of feasible direction algorithm, namely, cannot only slow down the process of iterations but also lead to convergence to points that are not Kuhn-Tucker points. This type of false convergence is known as jamming

Page 26

1. At iteration point and with given , define and carry out step 1 of the basic algorithm. 2. Modify step 2 with the following: If , set and continue. However, if , set and proceed with line search of the basic method. If , then a KuhnTucker point has been found.

With this modification, it is efficient to set rather loosely initially so as to include the constraints in a larger neighborhood of the point . Then, as the iterations proceed, the size of the neighborhood will be reduced only when it is found to be necessary.

Page 27

This approach simply dispense with the active constraint concept altogether and redefine the direction-finding subproblem as follows:

If the constraint loose at , then the selection of d is less affected by constraint j, because the positive constraint value will counterbalance the effect of the gradient term. This ensures that no sudden changes are introduced in the search direction.

Page 28

9.2 Simplex Extensions for Linearly Constrained Problems At a given point, the number of directions that are both descent and feasible directions is generally infinite. In the case of linear programs, the generation of search directions was simplified by changing one variable at a time; feasibility was ensured by checking sign restrictions, and descent was ensured by selecting a variable with negative relative-cost coefficient.

Page 29

M rows Given a feasible point two sets: the basic variables the nonbasic variables

N components the x variable is partitioned into , which are all positive an M vector

Page 30

Page 31

The relative-cost coefficients The nonbasic variable to enter is selected by finding such that

The basic variable to leave the basis is selected using the minimum-ratio rule. That is, we find r such that

elements of matrix

Page 32

The new feasible solution

and all other variables zero. At this point, the variables and are relabeled. Since an exchange will have occurred, will be redefined. The matrix is recomputed and another cycle of iterations is begun.

Page 33

The application of same algorithm to linearized form of a non-linear objective function:

Page 34

Example 9.4

Page 35

Example 9.4

Page 36

Example 9.4

Page 37

Example 9.4

The nonbasic variable to enter will be , since

, since

Page 38

Example 9.4

The new point is thus

A line search between and is now required to locate minimum of . Note that remains at 0, while changes as given by

Page 39

Example 9.4

Page 40

Page 41

Page 42

The nonbasic variable direction vector:

This definition ensures that when for all i, the Kuhn-Tucker conditions are satisfied.

Page 43

If all

, then set

If all

, then set

Page 44

Page 45

Page 46

- 161411-161601-Modelling, Simulation and Operations ResearchUploaded bySheryaBhatt
- Operation Research 1Uploaded byRK Singh
- Lecture 7Uploaded byDanger Cat
- Unit 2Uploaded byRebecca Sanchez
- Operation ResearchUploaded byRani Puspita Sari
- 8 - Managerial Decision Making and Mathematical Optimization Problems_31Jan2019Uploaded bycihtanbio
- Linear Programming on TI-89Uploaded byorlando007
- Op Tim MatlabUploaded byBiguest Bags
- Simplex Method - Maximisation CaseUploaded byJoseph George Konnully
- 10[2].1.1.127Uploaded byprasanthraju
- Worked Examples 04Uploaded byHugo Mayorga
- Introduction to Operations Research, 7th EditionUploaded byelcboy
- System of TransportationUploaded byLuis
- Assignment 1 OrUploaded byPiyush Virmani
- production controlUploaded byAbdul Nazar
- AC 303 Lecture 6 & 7 Linear Programming and Theory of ConstraintsUploaded byHendry Pang
- Operations Research_internal assessmentUploaded byMegha Halasangimath
- 01 Lp Graphical MethodUploaded byJEROME ORILLOSA
- Deployment OptimizationUploaded bygenius1q2w
- RuksaarLallmahomedOR.docxUploaded byruksaar
- ddddUploaded byAnonymous N3LpAX
- 06 LP SimplexMethod-II BwUploaded byBiswajit Sahoo
- LP08 Two PhaseUploaded bykanjai
- p266 BartelsUploaded bynarendra
- .. TenthClass BitBanks MathsEM 4 LinearProgrammingUploaded byprasaad88
- Optimization TechniquesUploaded byDev S Jadon
- Linear programming 1.pdfUploaded bymike
- Done - Eunice Naa Anyema KorleyUploaded bymounirus
- 2. Cómo formular.pdfUploaded bySebastián Cáceres G
- 10-1.1.1.24Uploaded byMiloš Nikolić

- Lecture 26aUploaded byslv_prasaad
- JNTUA Mechanical Engineering (R09) Syllabus BookUploaded byslv_prasaad
- 9A03504 Design of Machine Elements 21Uploaded byslv_prasaad
- 9A03504 Design of Machine ElementsUploaded byslv_prasaad
- 47_219_TS4 AUploaded byslv_prasaad
- lacture29Uploaded byslv_prasaad
- Curved BeamsUploaded byAnonymous EKqkRJsJN
- 4_1Uploaded byslv_prasaad
- ME1302-LP-AUploaded byCKDinakarraj
- r7310305-Design of Machine Members-i2Uploaded byslv_prasaad
- r7310305-Design of Machine Members-iUploaded byslv_prasaad
- 9A03504 Design of Machine Elements I 1Uploaded byslv_prasaad
- 9A03504 Design of Machine Elements IUploaded byslv_prasaad
- ME2303Uploaded bybrbtvm
- r7320105-Estimating & CostingUploaded byslv_prasaad
- r7320102 Environmental EngineeringUploaded byslv_prasaad
- r7320101 Geotechnical Engineering iUploaded byslv_prasaad
- .. TenthClass BitBanks MathsEM 7GeomentryUploaded byslv_prasaad
- F2008-06-042Uploaded byslv_prasaad
- ajas53189-196Uploaded byslv_prasaad
- 10.1.1.106.8304Uploaded byslv_prasaad
- ch_4_1Uploaded byslv_prasaad
- ch_1Uploaded byslv_prasaad
- jul_06Uploaded byslv_prasaad
- Toyota 1ZZ-FEUploaded byIsrael Pamintuan

- Convex Optimization Exam January 2017Uploaded byAlexander Louwerse
- simplex methodUploaded byAfzal Khan
- Numerical Reciepe Presentam tionUploaded byShivang Sharma
- Gams user's guide by McCarlUploaded byBianca Marques
- Chap006sUploaded byRana Gaballah
- 2Uploaded byAvinash Katragadda
- 16-kktUploaded byDalionzo
- Integer programing.pptUploaded byDeepankumar Athiyannan
- uci_lecture9Uploaded byNguyen Trung Hieu
- Course_notes.pptUploaded byANMOL
- optimisationUploaded byShubhamAgarwal
- Lecture-1Uploaded byRaul Gil Bayardo
- Vb Tora Simplex 2Uploaded byvsyoi
- Solving Unit Commitment Problem Using Chemo-tactic PSO–DE Optimization Algorithm Combined with Lagrange RelaxationUploaded byIDES
- Optimum Coordination of Overcurrent Relays in Distribution SystemUploaded byAbhishek Kumar
- MILP PrimerUploaded byShankaranarayanan Gopal
- linear algebraUploaded bycarminavelasco21
- Optimization_of_Logistics_I_2_Typical_Problems_r20.pdfUploaded byDeisy Ñontol Muñoz
- Optimization class notes MTH-9842Uploaded byfelix.apfaltrer7766
- 9 Momentum Principle Tutorial SolutionUploaded byAniket Babuta
- Assignment SaPMUploaded byVinod Dahiya
- Math 19 ReviewerUploaded byVienna Corrine Q. Abucejo
- Online Quiz 1Uploaded bySteven Hou
- Chapter 6Uploaded byKaran Ramchandani
- Big M Method and Special CasesUploaded bySubhash Singh
- An Introduction to Convex Optimization ForCommunications and Signal ProcessingUploaded byAndrei Nedelcu
- chap4_2017Uploaded byTej Eddine Labidi
- M1L4slidesUploaded byShamendu Roy Rohit
- Mixed Integer Linear ProgrammingUploaded byAbdulrahman Aldeek
- ISM Finite Ch3-3Uploaded byAli Ezzat