Feasible path

Successive Quadratic Programming (SQP) The above approach to finding the optimum is called a feasible path method, as it attempts at all times to remain feasible with respect to the equahty and inequahty constraints as it moves to the optimum. A quite different method exists called the Successive Quadratic Programming (SQP) method, which only requires one be feasible at the final solution. Tests that compare the GRG and SQP methods generaUy favor the SQP method so it has the reputation of being one of the best methods known for nonlinear optimization for the type of problems considered here. 

Fig. 1. Schematic of a typical planning problem (solid line signifies a feasible path and dotted line an infeasible path).

Feasible path algorithms. The equality constraints and active inequality constraints are satisfied at the end of every intermediate stage of the calculations. 

With feasible path strategies, as the name implies, on each iteration you satisfy the equality and inequality constraints. The results of each iteration, therefore, provide a candidate design or feasible set of operating conditions for the plant, that is, sub-optimal. Infeasible path strategies, on the other hand, do not require exact solution of the constraints on each iteration. Thus, if an infeasible path method fails, the solution at termination may be of little value. Only at the optimal solution will you satisfy the constraints. 

A feasible path optimization approach can be very expensive because an iterative calculation is required to solve the undetermined model. A more efficient way is to use an unfeasible path approach to solve the NLP problem however, many of these large-scale NLP methods are only efficient in solving problems with few degrees of freedom. A decoupled SQP method was proposed by Tjoa and Biegler (1991) that is based on a globally convergent SQP method. 

Using this nonlinear programming approach (also termed the embedded model or feasible path approach), we denote as x the vector of parameters representing l/(t) as well as the parameters x. For example, if U t) is assumed piecewise constant over a variable distance, we include w, and t in x. Problem... 

These early approaches suffered from two drawbacks. First, simultaneous approaches lead to much larger nonlinear programs than embedded model approaches. Consequently, nonlinear programming methods available at that time were too slow to compete with smaller feasible path formulations. Second, care must be taken in the formulation in order to yield an accurate algebraic representation of the differential equations. 

In this approach, the process variables are partitioned into dependent variables and independent variables (optimisation variables). For each choice of the optimisation variables (sometimes referred to as decision variables in the literature) the simulator (model solver) is used to converge the process model equations (described by a set of ODEs or DAEs). Therefore, the method includes two levels. The first level performs the simulation to converge all the equality constraints and to satisfy the inequality constraints and the second level performs the optimisation. The resulting optimisation problem is thus an unconstrained nonlinear optimisation problem or a constrained optimisation problem with simple bounds for the associated optimisation variables plus any interior or terminal point constraints (e.g. the amount and purity of the product at the end of a cut). Figure 5.2 describes the solution strategy using the feasible path approach. 

Morison (1984) and Vassialidis (1993) developed sequential model solution and optimisation strategy which is commonly known as Feasible Path Approach. 

Nonlinear Programming (NLP) Based Dynamic Optimisation Problem-Feasible Path Approach... 

Examples of studies of local conformational dynamics include the films made by Richard Feldmann, in collaboration with M. Levitt and with M. Karplus, which show the dynamics of pancreatic trypsin inhibitor and its interaction with solvent, and the study by Case and Karplus of the pathway by which an oxygen molecule can enter and leave the binding pocket of myoglobin (31). (In the static structure, there is no stereochemically feasible path for binding oxygen — the process requires a distortion of the protein structure.)... 

Allenylsilanes and -stannanes combined with a titanium salt are versatile reagents for propargylation of aldehydes (Eq. 115) [297], ketones (Eq. 116) [298], (A,0)-acetals (Eq. 117) [299], and a,/ -unsaturated ketones in a conjugate fashion (Eq. 118) [300]. Intramolecular reaction has also been reported (Eq. 119) [301] in which a Bu3Sn-carbon bond was cleaved exclusively in the presence of a TBS-carbon bond. That the isomeric starting material, propargylstannane, did not give the desired product (Eq. 120) demonstrates that the direct scission of the carbon-Sn bond by the electrophile under these reaction conditions is not a feasible path [301]. 

Our judgment is that feasible path methods in which the solution of the model equations over time is carried out by conventional integration software, which has been extensively developed and refined, are at present more reliable than infeasible path methods. Feasible path optimization methods are also easier to implement as the size of the optimization problem is much smaller. For these reasons, we have pursued feasible path methods despite evidence that infeasible path methods are more efficient on some problems. 

We present below some easily implementable methods for improving the robustness and efficiency of feasible path dynamic optimization codes which have proved useful in our work. Here, we cover methods for preventing simulation error from disrupting optimization, representation of path constraints, and handling poor local approximations during the optimization. 

We have developed a code incorporating these characteristics and applied it successfully to more than ten industrial design problems, some of which are discussed later in this chapter. Limited testing on standard problems also supports its effectiveness. This is problem 5.1 in Vasantharajan and Biegler (1990) illustrating that some difficulties with feasible path methods were solved without any difficulty using the code developed. 

The second purity constraint over the whole prediction horizon acts as a terminal (stability) constraint, forcing the process to converge towards the optimal cyclic steady state. The goal of feedback control in a standard control approach (i.e. to fulfill the extract purity) is introduced as a constraint here. A feasible path SQP algorithm is used for the optimization (Zhou et al., 1997), which generates a feasible point before it starts to minimize the objective function. 

For most of the Fourier spectrometers, the maximum feasible path difference is about Smax == 20 cm i. The equivalent value of the resolved difference in wave numbers is AP = 0.05 cm i. This means that the resolving power had the value... 

Maximum feasible path difference Maximum wave number... 

Feasible path convergence of tear streams at each iteration on constraints. 

Formation of CDD proceeds, along the most feasible path, by estabhshing of a C-C o-bond between the terminal unsubstituted carbons of the ix -allyhc (C ) and the alkyl group (C °) in 5 that affords the [Ni (CDD)j product complex 8 (Fig. 7). 

---