Train-the-trainers activities and developing and implementing a CBE program (objectives 2 and 3): Four sessions were held and focused on the reformulation of the program modules according to the CBA, and on training activities regarding the clinical (Humanization, sexual and reproductive rights, etc).
Computers and Chemical Engineering, 24, 2125 2141] have developed a reformulation of Generalized Disjunctive Programming (GDP) problems that is based on determining the convex hull of each disjunction.
Their new vision of public health was reflected in the reformulation of the curriculum [ 11].
Further, to improve computational efficiency, we present a relaxed non-linear programming reformulation of the problem that allows us to find good initial points for the mixed-integer nonlinear programming problem.
Based on previous results, this work presents a new algorithm that features: (i) a dynamic programming reformulation of the MPC optimization, (ii) a robust reformulation of the constraints that accounts for uncertainty and (iii) a multi parametric programming solution step where the controls are obtained as an explicit function of the states.
As part of the reformulation program to market the capsule formulation, the similarity of dissolution profiles to the original MDR tablet formulation were needed across various pH values to provide the necessary assurance of comparable product performance (10).
Multiparametric programming allowed for the reformulation of the MPC problem into an explicit form (21, 22) where a single set of optimizations can be performed a priori.
The problem is initially modeled as a nonlinear integer programming formulation and two solution approaches are proposed: (i) a reformulation of the problem as a mixed integer second order cone program to optimally solve the problem for small to medium scale problem instances, and (ii) an evolutionary algorithm using elements of iterated local search and scatter search to provide upper bounds.
The proposed algorithm is a reformulation of the problem as a pure binary integer program called the set portioning problem.
In this paper, we address the solution of the symmetric eigenvalue complementarity problem (EiCP) by treating an equivalent reformulation of finding a stationary point of a fractional quadratic program on the unit simplex.
For three types of uncertain variables, the robust reformulation of (operatorname{SLVI}(l,u,F)) can be solved as either a quadratically constrained quadratic program (QCQP) or a convex program, which are all more tractable and can provide solutions for (operatorname{SLVI}(l,u,F)), no matter for monotone or non-monotone F. The authors declare that they have no competing interests.
