AppOpt_II_Errata

page 167

The unit vector [1 0 0 0 0 ]T must be constructed under the x2 column

page 177

Simplex Table 2:  Using the pivot row identified in the last table, the unit vector [0 0 1 0]T under the s2 column

are to transfer the unit vector [1 0 0 0]T from the s1 column to the x2 column.

Simplex Table 3: Table 3.19 denotes the reduced table with the canonical form after the required row operations are completed. The basis variables are x2, x4, s3. The first row is the pivot row. The EBV is x1 and the LBV is x2. The pivot row is the first row.

page 178

x1  =  9.091,      x4  =  61.364,     x2  =  0,       x3  =  0,      s1 = 0,    s2 = 0,     s3 = 359.091,    f  =  -1281.82

page 184

After the introduction of the slack variables (s1, s2, s3, s4) the solution to the primal problem

page 191

Since x1 and x3 are basic,  with the reduced coat coefficient of 0, the corresponding slack/surplus s1, s3 variables will be zero, as observed in Table 3.31. 

page 195

x1* = 10.4761,    x2* = 6.4285,   x3* = 0.4524,   f* = -21407.14

page 196

From this discussion it is apparent that to keep the location the original solution unchanged, c1 must be less than   -450.

page 202

Problem 3.14

Problem 3.15

page 239

Equation (4.70a) is incorrect.  It is based on Equation (4.48b) which is correct.  This error is propogated is severla pages where this constraint is handled.

            (4.70b)             

page 240

             (4.71b)

page 243

                                                 (4.81)

page 244

                                                (4.82a)

page 246

                                                                                          (4.90b)

page 247

( The first equation in the Lagrange Multiplier Method Sub-section)

                                                                                                       (4.92d)

page 259

4.6.      Proove that the function will not change along the tangent

page 260

4.8       Express the Taylor series expansion (quadratic) of the function f(x) = (2 –3x  + x2) sin x about the point x = 0.707. Confirm your results through the Symbolic Math Toolbox.  Plot the original function and the approximation.

page 333

6.3  Apply the Pattern Search method to Example 5.3

page 334

6.6       Translate the Powell method into working MATLAB code. Verify solution to Example 6.1 and Example 5.3. Start from several points and verify that number of cycles to converge is the same.

6.19     Start the Steepest Descent method from different points for problem below and identify where the solution requires more than 15 iterations.

6.24     Example 6.2 was explicitly created to challenge the numerical techniques for unconstrained optimization.  There are many other similar test problems.  A problem with steep minimum (Beale, Survey of Integer Programming) is

page 497

In equation (11.15)  PA must be replaced as