The terminal set M is a closed subset of Rn+1. The admissible control set U is assumed to be the set of piecewise continuous function on [t0, t1]. The performance function J is assumed to be C1. The function V (·, ·) is called the value function and we shall use the convention V (t0, x0) = ∞ if the control problem above admits no feasible solution. We will denote by U(x0, t0), the set of feasib...

‎A full Nesterov-Todd (NT) step infeasible interior-point algorithm‎ ‎is proposed for solving monotone linear complementarity problems‎ ‎over symmetric cones by using Euclidean Jordan algebra‎. ‎Two types of‎ ‎full NT-steps are used‎, ‎feasibility steps and centering steps‎. ‎The‎ ‎algorithm starts from strictly feasible iterates of a perturbed‎ ‎problem‎, ‎and, using the central path and feasi...

Swarm Microrobotics aims to apply Swarm Intelligence algorithms and strategies to a large number of fabricated miniaturized autonomous or semi-autonomous agents, allowing collective, decentralized and self-organizing behaviors of the robots. The ability to establish basic information networking is fundamental in such swarm systems, where inter-robot communication is the base of emergent behavio...

This paper presents big-M (penalty) method for optimum time coordination of overcurrent (OC) relays. The method is based on the simplex algorithm which is used to find optimum solution of linear programming problem (LPP). The method introduces artificial variables in the objective function to get an initial basic feasible solution (IBFS). Artificial variables are removed using iterative process...

An iterative two-stage decomposition solution strategy for solving real-world scheduling problems in multi-stage multi-product batch plants is presented. The proposed method has as a core a mixed integer mathematical model, and consists of a constructive step, wherein a feasible and good solution is rapidly generated by following some insertion criteria, and an improvement step, wherein the ini...

This paper studies a new multi-objective fuzzy optimization prob- lem. The objective function of this study has dierent levels. Therefore, a suitable optimized solution for this problem would be an optimized solution with preemptive priority. Since, the feasible domain is non-convex; the tra- ditional methods cannot be applied. We study this problem and determine some special structures related...

This paper presents an exact model for the resource investment problem with generalized precedence relations in which the minimum or maximum time lags between a pair of activities may vary depending on the chosen modes. All resources considered are renewable. The objective is to determine a mode and a start time for each activity so that all constraints are obeyed and the resource investment co...

To design a group layout of a cellular manufacturing system (CMS) in a dynamic environment, a multi-objective mixed-integer non-linear programming model is developed. The model integrates cell formation, group layout and production planning (PP) as three interrelated decisions involved in the design of a CMS. This paper provides an extensive coverage of important manufacturing features u...

Background & Aims of the Study: water pollution by synthetic organic dyes is mainly regarded as environmental and ecological critical issues worldwide. In this research, magnetite iron oxide/silica gel nanocomposite (termed as Fe3O4/SG) was synthesized chemically and then used as an effective adsorbent for removal of sulfur dyes from aqueous solution. Materials and Method...