The research extended the work of Chomtee and Borkowski (2012) which compared response surface designs—central composite designs (CCDs), Box-Behnken designs (BBDs), small composite designs (SCDs), Plackett-Burman composite designs (PBDs) and uniform shell designs (USDs)—over a set of reduced models in a spherical design region for five design variables (k = 5) based on the three alphabetic opti...

Preemptively scheduling a set of independent jobs with release time on one processor is a historical problem. In this paper, the same problem has been considered in which objective is to minimize the mean flow time. To prepare a perfect branch-and-bound, some optimality conditions have been represented and they have been compared with the optimality conditions which have been proposed before. O...

The problem of obtaining the optimum design, which is able to discriminate between several rival models has been considered in this paper. We give an optimality-criterion, using a Bayesian approach. This is an extension of the Bayesian KL-optimality to more than two models. A modification is made to deal with nested models. The proposed Bayesian optimality criterion is a weighted average, where...

This paper presents contractors’ assessment and selection based on the multi-attribute methods in a competitive and risky environment. The model is based on a multi-attributes evaluation of contractors, the determination of their optimality criterion values calculated according to Hodges-Lehman rule. The proposed model could further be applied to construction operations. The attributes of contr...

Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...

This report documents the program and the outcomes of Dagstuhl Seminar 14451 “Optimality and tight results in parameterized complexity”. Over the last two decades parameterized complexity has become one of the main tools for handling intractable problems. Recently, tools have been developed not only to classify problems, but also to make statements about how close an algorithm is to being optim...

This correspondence describes a method for nonlinear filtering based on an adaptive observer, which guarantees the local stability of the linearised error system. Filter gain selection is by use of a fake algebraic Riccati equation. The design procedure attempts to produce a stable filter at the expense of optimality. This contrasts with the extended Kalman filter (EKF) which attempts to preser...

Baum-Katz theorem asserts that the Cesàro means of i.i.d. increments distributed like X r-converge if and only if |X| is integrable. We generalize this, and we unify other results, by proving that the following equivalence holds, if and only if G is moderate: the Cesàro means G-converge if and only if G(La) is integrable for every a if and only if |X| G(|X|) is integrable. Here, La is the last ...

‎In this paper‎, ‎some KKT type sufficient global optimality conditions‎ ‎for general mixed integer nonlinear programming problems with‎ ‎equality and inequality constraints (MINPP) are established‎. ‎We achieve‎ ‎this by employing a Lagrange function for MINPP‎. ‎In addition‎, ‎verifiable sufficient global optimality conditions for general mixed‎ ‎integer quadratic programming problems are der...