نتایج جستجو برای: mixed formulation

تعداد نتایج: 327290  

2010
Takanori Haga Haiyang Gao

The newly developed unifying discontinuous formulation based on flux reconstruction and lifting collocation penalty (LCP) approaches for conservation laws is extended to solve the Navier-Stokes equations for 3D mixed grids. In the current development, tetrahedrons and triangular prisms are considered. The LCP formulation is an extension of the flux reconstruction (FR) method to arbitrary elemen...

Journal: :SIAM J. Scientific Computing 2012
Carsten Carstensen Joscha Gedicke Eun-Jae Park

The stress-velocity formulation of the stationary Stokes problem allows an Arnold–Winther mixed finite element formulation with some superconvergent reconstruction of the velocity. This local postprocessing gives rise to two reliable a posteriori error estimators which recover optimal convergence order for the stress error estimates. The theoretical results are investigated in numerical benchma...

Journal: :Oper. Res. Lett. 2006
Abdullah Konak Sadan Kulturel-Konak Bryan A. Norman Alice E. Smith

This paper presents a mixed-integer programming formulation to find optimal solutions for the block layout problem with unequal departmental areas arranged in flexible bays. The nonlinear department area constraints are modeled in a continuous plane without using any surrogate constraints. The formulation is extensively tested on problems from the literature. © 2005 Elsevier B.V. All rights res...

Journal: :Oper. Res. Lett. 2006
Nilay Noyan Gábor Rudolf Andrzej Ruszczynski

Linear stochastic programming problems with first order stochastic dominance (FSD) constraints are non-convex. For their mixed 0–1 linear programming formulation we present two convex relaxations based on second order stochastic dominance (SSD). We develop necessary and sufficient conditions for FSD, used to obtain a disjunctive programming formulation and to strengthen one of the SSD-based rel...

2016
Zoran Maksimović Slobodan K. Simić

We give a new mixed integer linear programming (MILP) formulation for Maximum Degree Bounded Connected Subgraph Problem (MDBCSP). The proposed MILP formulation is the first in literature with polynomial number of constraints. Therefore, it will be possible to solve optimally much more instances before in a reasonable time.

2004
M. Borri S. N. Atluri

This paper presents general variational formulations for dynamical problems, which are easily implemented numerically. The development presents the relationship between the very general weak formulation arismg from linear and angular momentum balance considerations, and well known variational priciples. Two and three field mixed forms are developed from the general weak form. The variational pr...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید