Beruflich Dokumente
Kultur Dokumente
Book Review
Page 1
Page 2
(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
Page 4
Outline
Page 5
G. Zoutendijk
Mehtods of Feasible Directions, Elsevier, Amsterdam, 1960
Page 6
Preliminaries
Page 7
Preliminaries
Page 8
Page 9
In order for
, we have to have
Page 11
Page 13
Page 14
Page 15
Page 16
Page 17
and
Page 18
If no
exists, set
Page 19
Set
and continue.
Page 20
Example 9.1
Page 21
Example 9.1
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
Page 25
Page 26
Page 27
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 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
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
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
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