دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي constraints in mpc
DESCRIPTION
دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC. کنترل پيش بين-دکتر توحيدخواه. Feasibility in MPC. Infeasibility implies that, for the current state, the constraints within the MPC algorithm cannot be satisfied. - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/1.jpg)
![Page 2: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/2.jpg)
دانشگاه صنعتي اميركبيردانشكده مهندسي پزشكي
Constraints in MPC
بين-دکتر کنترل پيشتوحيدخواه
![Page 3: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/3.jpg)
• Infeasibility implies that, for the current state, the constraints within the MPC algorithm cannot be satisfied.
• Without feasibility the MPC optimisation is ill posed and there is no assurance that the answer has any useful meaning.
• MPC looks at mechanisms for overcoming or avoiding this.
Feasibility in MPC
![Page 4: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/4.jpg)
Hard constraintsHard constraints are constraints which must be satisfied.
![Page 5: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/5.jpg)
Soft constraints
• Soft constraints are those which should be satisfied if possible. Soft constraints can be violated (ignored).
• Usually soft constraints are on outputs/states although they could also be applied to inputs. Such violations may have no effect on nominal stability results.
![Page 6: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/6.jpg)
Terminal constraints
![Page 7: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/7.jpg)
Summary: Constraints are a combination of hard, soft and terminal constraints.
![Page 8: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/8.jpg)
Model uncertainty may cause infeasibility because the actual behaviour differs from the predicted behaviour. Hence, even though the nominal predictions could satisfy constraints over the entire future, a small change in the model will cause the actual behaviour to differ, and the associated predictions at the subsequent sampling instantcould then violate constraints.
Model uncertainty
![Page 9: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/9.jpg)
One can form algorithms based on invariant sets (Section 11.11) to handle model uncertainty; however, the results are usually very conservative, as guarantees must allow for the worst case (which will arise with negligible probability).
A more pragmatic approach is to accept that guarantees cannot be given where there is significant uncertainty and make other contingencies for the rare occasions where infeasibility arises.
Model uncertainty (cont.)
![Page 10: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/10.jpg)
• The stronger a guarantee you want, the more conservative your control law will be.
• In practise there must be a compromise between feasibility assurances and performance.
• Feasibility would usually be ensured by a systematic relaxation of soft constraints. This would be determined at a supervisory level.
![Page 11: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/11.jpg)
• Using artificially tight constraints on future predictions automatically builds in some slack which can be used to retain feasibility in the presence of moderate uncertainty. The slack should be montonically increasing with the horizon.
Example: input limits:
![Page 12: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/12.jpg)
Example 1. A mathematical model for an undamped oscillator is given by:
![Page 13: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/13.jpg)
What happens if the control amplitude is limited to +/- 25 ?
![Page 14: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/14.jpg)
![Page 15: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/15.jpg)
closed-loop eigenvalues are at −0.1946, 0, 0.
![Page 16: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/16.jpg)
Case A. Closed loop control without saturation
![Page 17: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/17.jpg)
Case B- Closed-loop control with saturation
![Page 18: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/18.jpg)
If we do not pay attention to the saturation of the control, then in the presence of constraints, the closed-loop control performance could severely deteriorate.
![Page 19: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/19.jpg)
Example 2:
A common practice in dealing with saturation is to let the model know the difference in Δu(k) when saturation becomes effective.
![Page 20: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/20.jpg)
over-shoot in the closed-loop response is significantly reduced.
![Page 21: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/21.jpg)
![Page 22: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/22.jpg)
Formulation of Constrained Control Problems
![Page 23: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/23.jpg)
There are three major types of constraints frequently encountered in applications:
The first two types deal with constraints imposed on the control variables u(k),
and the third type of constraint deals with output y(k) or state variable x(k) constraints.
![Page 24: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/24.jpg)
Constraints on the Amplitude of the Control Variable
![Page 25: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/25.jpg)
:در بيهوشی بعنوان مثال
Constraints on the Control Variable Incremental Variation
![Page 26: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/26.jpg)
Output Constraints
Output constraints are often implemented as ‘soft’ constraints in the way that a slack variable sv > 0 is added to the constraints
![Page 27: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/27.jpg)
Constraints in a Multi-input and Multi-output Setting
![Page 28: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/28.jpg)
![Page 29: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/29.jpg)
Constraints as Part of the Optimal Solution
![Page 30: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/30.jpg)
![Page 31: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/31.jpg)
![Page 32: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/32.jpg)
![Page 33: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/33.jpg)
![Page 34: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/34.jpg)
Numerical Solutions Using Quadratic Programming
E is assumed to be symmetric and positive definite.
![Page 35: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/35.jpg)
Quadratic Programming for Equality Constraints
Example 4. Minimize
Solution. The global minimum, without constraint, is at
![Page 36: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/36.jpg)
Illustration of constrained optimal solution
![Page 37: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/37.jpg)
![Page 38: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/38.jpg)
Lagrange Multipliers
![Page 39: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/39.jpg)
![Page 40: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/40.jpg)
Example 5. Minimize
subject to:
![Page 41: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/41.jpg)
Solution:
Without the equality constraints, the optimal solution is:
![Page 42: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/42.jpg)
![Page 43: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/43.jpg)
![Page 44: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/44.jpg)
Example 6. what happens to the constrained optimal solution when the linear constraints are dependent.
There is no feasible solution of x1 and x2
Matrix MTE−1M is not invertible
![Page 45: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/45.jpg)
Solution:
![Page 46: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/46.jpg)
Illustration of no feasible solution of the constrained optimization problem.Solid-line x1 + x2 = 1; darker-solid-line 2x1 +2x2 = 6
![Page 47: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/47.jpg)
Example 7:
How the number of equality constraints is also an issue in the constrained optimal solution? (Ex. 5)
We add an extra constraint to the original constraints so that:
![Page 48: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/48.jpg)
The only feasible solution:
In summary, the number of equality constraints is required to be less than or equal to the number of decision variables (i.e., x).
If the number of equality constraints equals the number of decision variables, the only feasible solution is the one that satisfies the constraints and there is no additional variable in x that can be used to optimize the original objective function.
![Page 49: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/49.jpg)
Minimization with Inequality Constraints
In the minimization with inequality constraints, the number of constraints could be larger than the number of decision variables.
An inequality Mix ≤ γi is said to be active if Mix = γi and inactive if Mix < γi.
![Page 50: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/50.jpg)
Kuhn-Tucker Conditions
![Page 51: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/51.jpg)
![Page 52: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/52.jpg)
![Page 53: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/53.jpg)
Example 8.
![Page 54: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/54.jpg)
Illustration of the constrained optimization problem with inequality constraints.Solid-line x1 + x2 = 1; darker-solid-line 3x1 +3x2 = 6
![Page 55: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/55.jpg)
Active Set Method
![Page 56: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/56.jpg)
Example 9
![Page 57: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/57.jpg)
The third constraint is an inactive constraint and will be dropped from the constrained equation set.
The first two constraints as the active constraints, and solve the optimization problem as minimizing:
subject to:
![Page 58: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/58.jpg)
From Example 5:
We drop the second constraint and solve the optimization problem as:
subject to:
![Page 59: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/59.jpg)
![Page 60: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/60.jpg)
1. In the case of equality constraints, the maximum number of equality constraints equals the number of decision variables. In this example, it is 3, and the only feasible solution x is to satisfy the equality constraints (see (2.50)). In contrast, in the case of inequality constraints, the number of inequality constraints is permitted to be larger than the number of decision variables, as long as they are not all active. In this example, only one constraint becomes active so it becomes an equality constraint. Once the optimal solution is found against this active constraint, the rest of the inequalities are automatically satisfied.
![Page 61: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/61.jpg)
2. It is clear that an iterative procedure is required to solve the optimization problem with inequality constraints, because we did not know which constraints would become active constraints. If the active set could be identified in advance, then the iterative procedure would be shortened.
![Page 62: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/62.jpg)
3. Note that the conditions for the inequality constraints are more relaxed than the case of imposing equality constraints. For instance, the number of constraints is permitted to be greater than the number of decision
variables, and the set of inequality constraints is permitted to be linearly dependent. However, these relaxations are only permitted to the point that the active constraints need to be linearly independent and the number of active constraints needs to be less than or equal to the number of decision variables.
![Page 63: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/63.jpg)
Primal-Dual Method
The minimization over x is unconstrained and is attained by
Substituting this, the dual problem is written as:
![Page 64: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/64.jpg)
![Page 65: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/65.jpg)
Hildreth’s Quadratic Programming Procedure(Luenberger,1969, Wismer and Chattergy, 1978)
In this algorithm, the direction vectors were selected to be equalto the basis vectors ei = [0 0 . . . 1 . . . 0 0]T . Then, the λ vector can be varied one component at a time. At a given step in the process, having obtained a vector λ ≥ 0, we fix our attention on a single component λi. The objective function may be regarded as a quadratic function in this single component. We adjust λi to minimize the objective function. If that requires λi < 0, we set λi = 0. In either case, the objective function is decreased. Then, we consider the next component λi+1. If we consider one complete cycle through the components to be one iteration taking the vector λm to λm+1,
![Page 66: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/66.jpg)
Hildreth’s Quadratic Programming Procedure
converged λ∗ vector contains either zero or positive values
![Page 67: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/67.jpg)
Remarks:
Hildreth’s quadratic programming algorithm is based on an element-by-element search, therefore, it does not require any matrix inversion. As a result, if the active constraints are linearly independent and their number is less than or equal to the number of decision variables, then the dual variables will converge.
As we will observe in the coming examples, the algorithm will give a compromised, near-optimal solution with constraints if the situation of conflict constraints arises. This is one of the key strengths of using this approach in real-time applications, because the algorithm’s ability to automatically recover from an ill-conditioned constrained problem is paramount for the safety of plant operation.
![Page 68: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/68.jpg)
Example 10. Minimize the cost function:
![Page 69: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/69.jpg)
![Page 70: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/70.jpg)
![Page 71: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/71.jpg)
![Page 72: دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي Constraints in MPC](https://reader036.vdocuments.net/reader036/viewer/2022081507/56815ccb550346895dcad83c/html5/thumbnails/72.jpg)
Example 11