Mathematical programming model for heat exchanger design through optimization of partial objectives

Mathematical programming can be used for the optimal design of shell-and-tube heat exchangers (STHEs). This paper proposes a mixed integer non-linear programming (MINLP) model for the design of STHEs, following rigorously the standards of the Tubular Exchanger Manufacturers Association (TEMA). Bell–Delaware Method is used for the shell-side calculations. This approach produces a large and non-convex model that cannot be solved to global optimality with the current state of the art solvers. Notwithstanding, it is proposed to perform a sequential optimization approach of partial objective targets through the division of the problem into sets of related equations that are easier to solve. For each one of these problems a heuristic objective function is selected based on the physical behavior of the problem. The global optimal solution of the original problem cannot be ensured even in the case in which each of the sub-problems is solved to global optimality, but at least a very good solution is always guaranteed. Three cases extracted from the literature were studied. The results showed that in all cases the values obtained using the proposed MINLP model containing multiple objective functions improved the values presented in the literature.

Constraint qualifications in linear vector semi-infinite optimization

Linear vector semi-infinite optimization deals with the simultaneous minimization of finitely many linear scalar functions subject to infinitely many linear constraints. This paper provides characterizations of the weakly efficient, efficient, properly efficient and strongly efficient points in terms of cones involving the data and Karush–Kuhn–Tucker conditions. The latter characterizations rely on different local and global constraint qualifications. The global constraint qualifications are illustrated on a collection of selected applications.

Dynamic, convex, and robust optimization with Bayesian learning for response-guided dosing

Thesis (Ph.D.)--University of Washington, 2016-08

Ornstein-Uhlenbeck operator in convex domains of Banach spaces

Studiamo l'operatore di Ornstein-Uhlenbeck e il semigruppo di Ornstein-Uhlenbeck in un sottoinsieme aperto convesso $\Omega$ di uno spazio di Banach separabile $X$ dotato di una misura Gaussiana centrata non degnere $\gamma$. In particolare dimostriamo la disuguaglianza di Sobolev logaritmica e la disuguaglianza di Poincaré, e grazie a queste disuguaglianze deduciamo le proprietà spettrali dell'operatore di Ornstein-Uhlenbeck. Inoltre studiamo l'equazione ellittica $\lambdau+L^{\Omega}u=f$ in $\Omega$, dove $L^\Omega$ è l'operatore di Ornstein-Uhlenbeck. Dimostriamo che per $\lambda>0$ e $f\in L^2(\Omega,\gamma)$ la soluzione debole $u$ appartiene allo spazio di Sobolev $W^{2,2}(\Omega,\gamma)$. Inoltre dimostriamo che $u$ soddisfa la condizione di Neumann nel senso di tracce al bordo di $\Omega$. Questo viene fatto finita approssimazione dimensionale.

On Typical Compact Convex Sets in Hilbert Spaces

Let E be an infinite dimensional separable space and for e ∈ E and X a nonempty compact convex subset of E, let qX(e) be the metric antiprojection of e on X. Let n ≥ 2 be an arbitrary integer. It is shown that for a typical (in the sence of the Baire category) compact convex set X ⊂ E the metric antiprojection qX(e) has cardinality at least n for every e in a dense subset of E.

On Uniformly Convex and Uniformly Kadec-Klee Renomings

We give a new construction of uniformly convex norms with a power type modulus on super-reflexive spaces based on the notion of dentability index. Furthermore, we prove that if the Szlenk index of a Banach space is less than or equal to ω (first infinite ordinal) then there is an equivalent weak* lower semicontinuous positively homogeneous functional on X* satisfying the uniform Kadec-Klee Property for the weak*-topology (UKK*). Then we solve the UKK or UKK* renorming problems for Lp(X) spaces and C(K) spaces for K scattered compact space.

Quadratic Time Computable Instances of MaxMin and MinMax Area Triangulations of Convex Polygons

We consider the problems of finding two optimal triangulations of a convex polygon: MaxMin area and MinMax area. These are the triangulations that maximize the area of the smallest area triangle in a triangulation, and respectively minimize the area of the largest area triangle in a triangulation, over all possible triangulations. The problem was originally solved by Klincsek by dynamic programming in cubic time [2]. Later, Keil and Vassilev devised an algorithm that runs in O(n^2 log n) time [1]. In this paper we describe new geometric findings on the structure of MaxMin and MinMax Area triangulations of convex polygons in two dimensions and their algorithmic implications. We improve the algorithm’s running time to quadratic for large classes of convex polygons. We also present experimental results on MaxMin area triangulation.

Algebraic duality theorems for infinite LP problems

In this paper we consider a primal-dual infinite linear programming problem-pair, i.e. LPs on infinite dimensional spaces with infinitely many constraints. We present two duality theorems for the problem-pair: a weak and a strong duality theorem. We do not assume any topology on the vector spaces, therefore our results are algebraic duality theorems. As an application, we consider transferable utility cooperative games with arbitrarily many players.

On the Set of Locally Convex Topologies Compatible with a Given Topology on a Vector Space: Cardinality Aspects

For a topological vector space (X, τ ), we consider the family LCT (X, τ ) of all locally convex topologies defined on X, which give rise to the same continuous linear functionals as the original topology τ . We prove that for an infinite-dimensional reflexive Banach space (X, τ ), the cardinality of LCT (X, τ ) is at least c.

Electromagnetic energy within a magnetic infinite cylinder and scattering properties for oblique incidence

We analytically calculate the time-averaged electromagnetic energy stored inside a nondispersive magnetic isotropic cylinder that is obliquely irradiated by an electromagnetic plane wave. An expression for the optical-absorption efficiency in terms of the magnetic internal coefficients is also obtained. In the low absorption limit, we derive a relation between the normalized internal energy and the optical-absorption efficiency that is not affected by the magnetism and the incidence angle. This relation, indeed, seems to be independent of the shape of the scatterer. This universal aspect of the internal energy is connected to the transport velocity and consequently to the diffusion coefficient in the multiple scattering regime. Magnetism favors high internal energy for low size parameter cylinders, which leads to a low diffusion coefficient for electromagnetic propagation in 2D random media. (C) 2010 Optical Society of America

Analyzing static three-dimensional elastic domains with a new infinite boundary element formulation

A new two-dimensionally mapped infinite boundary element (IBE) is presented. The formulation is based on a triangular boundary element (BE) with linear shape functions instead of the quadrilateral IBEs usually found in the literature. The infinite solids analyzed are assumed to be three-dimensional, linear-elastic and isotropic, and Kelvin fundamental solutions are employed. One advantage of the proposed formulation over quadratic or higher order elements is that no additional degrees of freedom are added to the original BE mesh by the presence of the IBEs. Thus, the IBEs allow the mesh to be reduced without compromising the accuracy of the result. Two examples are presented, in which the numerical results show good agreement with authors using quadrilateral IBEs and analytical solutions. (C) 2010 Elsevier Ltd. All rights reserved.

Unsaturated Infinite Slope Stability Considering Surface Flux Conditions

A slope stability model is derived for an infinite slope subjected to unsaturated infiltration flow above a phreatic surface. Closed form steady state solutions are derived for the matric suction and degree of saturation profiles. Soil unit weight, consistent with the degree of saturation profile, is also directly calculated and introduced into the analyzes, resulting in closed-form solutions for typical soil parameters and an infinite series solution for arbitrary soil parameters. The solutions are coupled with the infinite slope stability equations to establish a fully realized safety factor function. In general, consideration of soil suction results in higher factor of safety. The increase in shear strength due to the inclusion of soil suction is analogous to making an addition to the cohesion, which, of course, increases the factor of safety against sliding. However, for cohesive soils, the results show lower safety factors for slip surfaces approaching the phreatic surface compared to those produced by common safety factor calculations. The lower factor of safety is due to the increased soil unit weight considered in the matric suction model but not usually accounted for in practice wherein the soil is treated as dry above the phreatic surface. The developed model is verified with a published case study, correctly predicting stability under dry conditions and correctly predicting failure for a particular storm.

Robust integration of real time optimization with linear model predictive control

Here, we study the stable integration of real time optimization (RTO) with model predictive control (MPC) in a three layer structure. The intermediate layer is a quadratic programming whose objective is to compute reachable targets to the MPC layer that lie at the minimum distance to the optimum set points that are produced by the RTO layer. The lower layer is an infinite horizon MPC with guaranteed stability with additional constraints that force the feasibility and convergence of the target calculation layer. It is also considered the case in which there is polytopic uncertainty in the steady state model considered in the target calculation. The dynamic part of the MPC model is also considered unknown but it is assumed to be represented by one of the models of a discrete set of models. The efficiency of the methods presented here is illustrated with the simulation of a low order system. (C) 2010 Elsevier Ltd. All rights reserved.