Characterization of the Nonemptiness and Compactness of Solution Sets in Convex and Nonconvex Vector Optimization

As a consequence of an abstract theorem proved elsewhere, a vector Weierstrass theorem for the existence of a weakly efficient solution without any convexity assumption is established. By using the notion (recently introduced in an earlier paper) of semistrict quasiconvexity for vector functions and assuming additional structure on the space, new existence results encompassing many results appearing in the literature are derived. Also, when the cone defining the preference relation satisfies some mild assumptions (but including the polyhedral and icecream cones), various characterizations for the nonemptiness and compactness of the weakly efficient solution set to convex vector optimization problems are given. Similar results for a class of nonconvex problems on the real line are established as well.Research supported in part by Conicyt-Chile through FONDECYT 104-0610 and FONDAP-Matemáticas Aplicadas II.     

On coderivatives and Lipschitzian properties of the dual pair in optimization

In this paper, we apply the concept of coderivative and other tools from the generalized differentiation theory for set-valued mappings to study the stability of the feasible sets of both the primal and the dual problem in infinite-dimensional linear optimization with infinitely many explicit constraints and an additional conic constraint. After providing some specific duality results for our dual pair, we study the Lipschitz-like property of both mappings and also give bounds for the associated Lipschitz moduli. The situation for the dual shows much more involved than the case of the primal problem.     

A fast $$(2 + \frac{2}{7})$$ ( 2 + 2 7 ) -approximation algorithm for capacitated cycle covering

Mathematical Programming - We consider the capacitated cycle covering problem: given an undirected, complete graph G with metric edge lengths and demands on the vertices, we want to cover the...     

On the complexity of linear programming under finite precision arithmetic

In this paper we study the complexity of solving linear programs in finite precision arithmetic. This is the normal setup in scientific computation, as digital computers work in finite precision. We analyze two aspects of the complexity: one is the number of arithmetic operations required to solve the problem approximately, and the other is the working precision required to carry out some critical computations safely. We show how the conditioning of the problem instance affects the working precision required and the computational requirements of a classical logarithmic barrier algorithm to approximate the optimal value of the problem within a given tolerance. Our results show that these complexity measures depend linearly on the logarithm of a certain condition measure. We carry out the analysis by looking at how well Newton's Method can follow the central trajectory of the feasible set, and computing error bounds in terms of the condition measure. These results can be interpreted as a theoretical indication of good numerical behavior of the logarithmic barrier method, in the sense that a problem instance twice as hard as the other from the numerical point of view, requires only at most twice as much precision to be solved. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.This research has been supported through grants from Fundación Andes, under agreement C12021/7, and FONDECYT (project number 1930948).     

Weak maximum principle and accessory problem for control problems on time scales

In this paper we derive the first and second variations for a nonlinear time scale optimal control problem with control and state-endpoints equality constraints. Using the first variation, a first order necessary condition for weak local optimality is obtained under the form of a weak maximum principle generalizing the Dubois–Reymond Lemma to the optimal control setting and time scales. A second order necessary condition in terms of the accessory problem is derived by using the nonnegativity of the second variation at all admissible directions. The control problem is studied under a controllability assumption, and with or without the shift in the state variable. These two forms of the problem are shown to be equivalent.     

Vorticity-velocity-pressure formulation for Stokes problem

We propose a three-field formulation for efficiently solving a two-dimensional Stokes problem in the case of nonstandard boundary conditions. More specifically, we consider the case where the pressure and either normal or tangential components of the velocity are prescribed at some given parts of the boundary. The proposed computational methodology consists in reformulating the considered boundary value problem via a mixed-type formulation where the pressure and the vorticity are the principal unknowns while the velocity is the Lagrange multiplier. The obtained formulation is then discretized and a convergence analysis is performed. A priori error estimates are established, and some numerical results are presented to highlight the perfomance of the proposed computational methodology.

     

Improving the rate of convergence of interior point methods for linear programming

This paper proposes a procedure for improving the rate of convergence of interior point methods for linear programming. If (x ^k ) is the sequence generated by an interior point method, the procedure derives an auxiliary sequence ( ). Under the suitable assumptions it is shown that the sequence ( ) converges superlinearly faster to the solution than (x ^k ). Application of the procedure to the projective and afflne scaling algorithms is discussed and some computational illustration is provided.     

An approach formulated in terms of conserved variables for the characterisation of propellant combustion in internal ballistics

A model formulated in terms of conserved variables is proposed for its use in the study of internal ballistic problems of pyrotechnical mixtures and propellants. It is a transient two‐phase flow model adapted from the non‐conservative Gough model. This conversion is mathematically attractive because of the wide range of numerical methods for this kind of systems that may be applied. We propose the use of the AUSM+, AUSM + up and Rusanov schemes as an efficient alternative for this type of two‐phase problem. A splitting technique is applied, which solves the system of equations in several steps. A second‐order approach based on Monotonic Upstream‐Centred Scheme for Conservation Laws (MUSCL) is also used. Some tests are used to validate the code, namely a shock wave test, a contact discontinuity problem and an internal ballistics problem. In this last case, one‐dimensional numerical results are compared with experimental data of 155‐mm gunshots. Copyright © 2015 John Wiley & Sons, Ltd.     

Drying of solids with irregular geometry: numerical study and application using a three-dimensional model

This article proposes a numerical solution for the diffusion equation applied to solids with arbitrary geometry using non-orthogonal structured grids for the boundary condition of the first kind. A transient three-dimensional mathematical formulation written in boundary fitted coordinates and numerical formalism to discretize the diffusion equation by using the finite volume method, including numerical analysis of the computational solution are presented. To validate the proposed solution, the results obtained in this work were compared with well-known numerical solution available in literature and good agreement was observed. In order to verify the potential of the proposed numerical solution, it was applied to describe mass transfer inside ceramic roof tiles during drying. For that, it was used experimental data of the drying kinetics at the following temperatures: 55.6; 69.7; 82.7 and 98.6 °C. An optimization technique using experimental dataset has been presented to estimation of transport properties. The obtained statistical indicators enable to conclude that the numerical solution satisfactorily describes the drying processes.