1 chapter 8 nonlinear programming with constraints
TRANSCRIPT
![Page 1: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/1.jpg)
1
Ch
apte
r 8
Chapter 8
Nonlinear Programming with Constraints
![Page 2: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/2.jpg)
2
Ch
apte
r 8
![Page 3: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/3.jpg)
3
Ch
apte
r 8
![Page 4: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/4.jpg)
4
Ch
apte
r 8
Methods for Solving NLP Problems
![Page 5: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/5.jpg)
5
Ch
apte
r 8
*)(**)( xhxf (a) Where 414.1/1* is called the Lagrange multiplier for the constraint h = 0
)21,21(* x ; see Fig. E 8.1a
![Page 6: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/6.jpg)
6
Ch
apte
r 8
![Page 7: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/7.jpg)
7
Ch
apte
r 8
![Page 8: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/8.jpg)
8
Ch
apte
r 8
![Page 9: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/9.jpg)
9
Ch
apte
r 8
![Page 10: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/10.jpg)
10
Ch
apte
r 8
![Page 11: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/11.jpg)
11
Ch
apte
r 8
![Page 12: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/12.jpg)
12
Ch
apte
r 8
Note that there are n + m equations in the n + m unknowns x and λ
![Page 13: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/13.jpg)
13
Ch
apte
r 8
![Page 14: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/14.jpg)
14
Ch
apte
r 8
![Page 15: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/15.jpg)
15
Ch
apte
r 8
![Page 16: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/16.jpg)
16
Ch
apte
r 8
![Page 17: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/17.jpg)
17
1 2Minimize : ( )f x xx
2 21 2Subject to : ( ) 25g x x x
By the Lagrange multiplier method.
Solution: The Lagrange function is
2 21 2 1 2( , ) ( 25)L u x x x x x u
The necessary conditions for a stationary point are
2 11
2 0L
x uxx
1 22
2 0L
x uxx
2 21 2 25
Lx x
u
2 21 2(25 ) 0u x x
Ch
apte
r 8
![Page 18: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/18.jpg)
18
Ch
apte
r 8
![Page 19: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/19.jpg)
19
Ch
apte
r 8
![Page 20: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/20.jpg)
20
Ch
apte
r 8
![Page 21: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/21.jpg)
21
Ch
apte
r 8
Penalty functions for handling equality constraints
![Page 22: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/22.jpg)
22
Ch
apte
r 8
![Page 23: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/23.jpg)
23
Ch
apte
r 8
for handling inequality constraints
Note g must be >0 ; r 0
![Page 24: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/24.jpg)
24
Ch
apte
r 8
The logarithmic barrier function formulation for m constraints is
![Page 25: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/25.jpg)
25
Ch
apte
r 8
![Page 26: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/26.jpg)
26
Ch
apte
r 8
![Page 27: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/27.jpg)
27
Ch
apte
r 8
![Page 28: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/28.jpg)
28
Ch
apte
r 8
![Page 29: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/29.jpg)
29
Ch
apte
r 8
Use xc = 2 yc = 2 for linearization
(step bounds)
![Page 30: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/30.jpg)
30
Ch
apte
r 8
![Page 31: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/31.jpg)
31
Ch
apte
r 8
![Page 32: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/32.jpg)
32
Ch
apte
r 8
![Page 33: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/33.jpg)
33
Ch
apte
r 8
Quadratic Programming (QP)
![Page 34: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/34.jpg)
34
Ch
apte
r 8
8.3 QUADRATIC PROGRAMMING
![Page 35: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/35.jpg)
35
Use of Quadratic Programming to Design Multivariable Controllers
(Model Predictive Control)
• Targets (set points) selected by real-time optimization software based on current operating and economic conditions
• Minimize square of deviations between predicted future outputs and specific reference trajectory to new targets using QP
• Framework handles multiple input, multiple output (MIMO) control problems with constraints on manipulated and controlled variables. Dynamics obtained from transfer function model.
Ch
apte
r 8
![Page 36: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/36.jpg)
36
Successive Quadratic Programming
• Considered by some to be the best general nonlinear programming algorithm
• Repetitively approximates nonlinear objective function with quadratic function and nonlinear constraints with linear constraints
• Uses line search rather than QP step for each iteration• Inequality constrained Quadratic Programming (IQP)
keeps all inequality constraints• Equality constrained Quadratic Programming (EQP) only
keeps equality constraints by utilizing and active set strategy
• SQP is an Infeasible Path method
Ch
apte
r 8
![Page 37: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/37.jpg)
37
Ch
apte
r 8
![Page 38: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/38.jpg)
38
Ch
apte
r 8
solve for ,x
![Page 39: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/39.jpg)
39
Ch
apte
r 8
Generalized Reduced Gradient (GRG)
![Page 40: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/40.jpg)
40
Ch
apte
r 8
![Page 41: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/41.jpg)
41
Ch
apte
r 8
![Page 42: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/42.jpg)
42
Ch
apte
r 8
![Page 43: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/43.jpg)
43
Ch
apte
r 8
![Page 44: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/44.jpg)
44
Ch
apte
r 8
![Page 45: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/45.jpg)
45
Ch
apte
r 8
![Page 46: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/46.jpg)
46
Ch
apte
r 8
![Page 47: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/47.jpg)
47
Ch
apte
r 8
![Page 48: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/48.jpg)
48
Ch
apte
r 8
![Page 49: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/49.jpg)
49
Ch
apte
r 8
![Page 50: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/50.jpg)
50
Ch
apte
r 8
![Page 51: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/51.jpg)
51
• sequential simplex• conjugate gradient• Newton’s method• Quasi-Newton
Ch
apte
r 8
![Page 52: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/52.jpg)
52
Ch
apte
r 8
![Page 53: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/53.jpg)
53
Ch
apte
r 8
![Page 54: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/54.jpg)
54
Ch
apte
r 8
![Page 55: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/55.jpg)
55
Ch
apte
r 8
![Page 56: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/56.jpg)
56
Ch
apte
r 8
![Page 57: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/57.jpg)
57
Ch
apte
r 8
![Page 58: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/58.jpg)
58
Ch
apte
r 8
![Page 59: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/59.jpg)
59
Ch
apte
r 8
![Page 60: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/60.jpg)
60
Ch
apte
r 8
![Page 61: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/61.jpg)
61
Ch
apte
r 8
![Page 62: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/62.jpg)
62
Ch
apte
r 1
we have to supplement blast furnace gas with fuel oil, but we want to minimize the purchase of fuel oil.
Ch
apte
r 8
![Page 63: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/63.jpg)
63
Ch
apte
r 1
define: X1 = amount of fuel oil used in generator 1X2 = amount of fuel oil used in generator 2X3 = amount of BFG used in generator 1X4 = amount of BFG used in generator 2P1 = mw output of generator 1P2 = mw output of generator 2
range of operation of generator 1 and generator 218 ≤ P1 ≤ 3014 ≤ P2 ≤ 25
Fuel effects in the generators are additive (can operateon either BFG or fuel oil)
Ch
apte
r 8
![Page 64: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/64.jpg)
64
Ch
apte
r 1
10 units of BFG are available (on the average):
1 unit BFG = Btu equivalent of 1 ton/hr. fuel oil.
We need 50 mw power at all times.
5021 PP
Experimental data needed?
Ch
apte
r 8
![Page 65: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/65.jpg)
65
Ch
apte
r 1
Mathematical Statement
1 2
fuel oil to gen 1 fuel oil to gen 2
Min f x x
a. operating ranges 18 ≤ P1 ≤ 30& requirements 14 ≤ P2 ≤ 25
P1 + P2 = 50
b. availability of x3 + x4
blast furnace gas
c. operating P11 (x1) fuel oilcharacteristics P12 (x3) BFG
P21 (x2) fuel oil P22 (x4)
BFG
gen 1
gen 2
2221212111 PPPPPP
Ch
apte
r 8
![Page 66: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/66.jpg)
66
Ch
apte
r 1
BFG addmay
wesince sufficientnot isequation this
00145.15186.4609.1 21111 XXP
22212
422
221
12111
312
BFG )(
oil fuel )(
1generator in reqt.)(
PPP
XP
XP
PPP
XBFGP
fcn of burners, heat transfer characteristics (convex functions)
Ch
apte
r 8
![Page 67: 1 Chapter 8 Nonlinear Programming with Constraints](https://reader033.vdocuments.mx/reader033/viewer/2022061614/56649e5d5503460f94b55d07/html5/thumbnails/67.jpg)
67
Ch
apte
r 1
Solution
NLP 4 ineq. const.piece-wise LP 6 eq. const.
1
2
3.05
30
20
optf
P
P
No fuel oil is used in generator 1.In generator 2, fuel oil provides 58%of the power (rest is BFG).
heat transfer characteristics may change, or BFG mayvary w.r.t. time (on-line solution)
Ch
apte
r 8