Multi-parametric Optimization and Control. Efstratios N. Pistikopoulos

Чтение книги онлайн.

СКАЧАТЬ

      the Basic Sensitivity Theorem holds, and it is identically satisfied for a neighborhood around and can be differentiated with respect to to yield explicit expressions for the partial derivatives of the vector function .

      The first‐order estimate of the variation of an isolated local solution x() of (1.16) and the associated unique Lagrange multipliers and can be approximated, given that is known and that is available.

      In particular, let be the concatenation of the vectors and . The first‐order Taylor expansion of the vector F around can be expressed as follows:

      (1.20)

Under the assumptions and the principles of the Basic Sensitivity Theorem, in a neighborhood of the first‐order KKT conditions hold and the value of F() around remains zero. For systems that consist of polynomial objective functions of up to second degree and linear constraints, with respect to the optimization variables and the uncertain parameters, the first‐order Taylor expansion is exact. Hence, the exact multi‐parametric solution can be obtained for the following multi‐parametric quadratic programming problem

      (1.21)

      where matrices , and , , and the scalars , correspond to the and inequality and equality constraints of the sets and , respectively. This problem serves as the basis that will be discussed in Part I, where its solution properties and solution strategies among other things are in focus. Part II then focusses on the application of such problems to optimal control, as the use of parameters enables the formulation of explicit model predictive control problems.

1.3 Polytopes

      Multi‐parametric programming is intimately related to the properties and operations applicable to polytopes. In the following, some basic definitions on polytopes are stated, which are used throughout the book.

      Definition 1.9

      A function , where is a polytope, is called piecewise affine if it is possible to partition into disjoint polytopes, called critical regions, and

      (1.22)

      Remark 1.2 The definition of piecewise quadratic is analogous.

Definition 1.10

      The set is called a ‐dimensional polytope if it satisfies

(1.23)

      where is finite.

A schematic representation of a polytope is given in Figure 1.1.

Figure 1.1 A schematic representation of a two‐dimensional polytope

.

In addition to Definition (1.10), the following well‐known characteristics of polytopes are considered:

       A polytope is called bounded if and only if there exists a finite and such for all .

       A polytope, which is closed and bounded, is called compact.

       Let be an ‐dimensional polytope. Then, a subset of a polytope is called a face of if it can be represented as(1.24) for some inequality , which holds for all . The faces of polytopes of dimension , 1, and 0 are referred to as facets, edges, and vertices, respectively.

       Two polytopes and are called disjoint if . Similarly, two polytopes and are called overlapping if . Lastly, two polytopes СКАЧАТЬ