Search results for "programming"
showing 10 items of 3090 documents
A bilateral convergent bounding technique for plastic deformations
1990
For the class of elastic perfectly plastic discrete structures, subjected to a dynamic loading history, a bilateral bounding technique for plastic deformations has been studied. The computation of the bound is founded on the concept that to obtain it, any history of fictitious plastic deformations can be used, if only admissible. Such history is obtained by solving a sequence of linear programming problems (LPPs) with a multiple step compared to the step of the sequence of the quadratic programming problems (QPPs) adopting in the classic elasto-plastic analysis. The constraints of the LPPs coincide with the constraints of the QPPs, while the objective function is a linear combination of var…
Stability Analysis of Large Scale Networks of Autonomous Work Systems with Delays
2011
This paper considers the problem of stability analysis for a class of production networks of autonomous work systems with delays in the capacity changes. The system under consideration does not share information between work systems and the work systems adjust capacity with the objective of maintaining a desired amount of local work in progress (WIP). Attention is focused to derive explicit sufficient delay-dependent stability conditions for the network using properties of matrix norm. Finally, numerical results are provided to demonstrate the proposed approach.
Solving the Discrete Multiple Criteria Problem using Convex Cones
1984
An interactive method employing pairwise comparisons of attainable solutions is developed for solving the discrete, deterministic multiple criteria problem assuming a single decision maker who has an implicit quasi-concave increasing utility (or value) function. The method chooses an arbitrary set of positive multipliers to generate a proxy composite linear objective function which is then maximized over the set of solutions. The maximizing solution is compared with several solutions using pairwise judgments asked of the decision maker. Responses are used to eliminate alternatives using convex cones based on expressed preferences, and then a new set of weights is found that satisfies the i…
The Power of the “Pursuit” Learning Paradigm in the Partitioning of Data
2019
Traditional Learning Automata (LA) work with the understanding that the actions are chosen purely based on the “state” in which the machine is. This modus operandus completely ignores any estimation of the Random Environment’s (RE’s) (specified as \(\mathbb {E}\)) reward/penalty probabilities. To take these into consideration, Estimator/Pursuit LA utilize “cheap” estimates of the Environment’s reward probabilities to make them converge by an order of magnitude faster. This concept is quite simply the following: Inexpensive estimates of the reward probabilities can be used to rank the actions. Thereafter, when the action probability vector has to be updated, it is done not on the basis of th…
Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem
2012
This paper presents the first full-fledged branch-and-price (bap) algorithm for the capacitated arc-routing problem (CARP). Prior exact solution techniques either rely on cutting planes or the transformation of the CARP into a node-routing problem. The drawbacks are either models with inherent symmetry, dense underlying networks, or a formulation where edge flows in a potential solution do not allow the reconstruction of unique CARP tours. The proposed algorithm circumvents all these drawbacks by taking the beneficial ingredients from existing CARP methods and combining them in a new way. The first step is the solution of the one-index formulation of the CARP in order to produce strong cut…
Driven Primary Regulation for Minimum Power Losses Operation in Islanded Microgrids
2018
The paper proposes an improved primary regulation method for inverter-interfaced generating units in islanded microgrids. The considered approach employs an off-line minimum losses optimal power flow (OPF) to devise the primary frequency regulation curve’s set-points while satisfying the power balance, frequency and current constraints. In this way, generators will reach an optimized operating point corresponding to a given and unique power flow distribution presenting the minimum power losses. The proposed approach can be particularly interesting for diesel-based islanded microgrids that face, constantly, the issue of reducing their dependency from fossil fuels and of enhancing their gener…
Scatter Search and Path Relinking: Advances and Applications
2006
Scatter search (SS) is a population-based method that has recently been shown to yield promising outcomes for solving combinatorial and nonlinear optimization problems. Based on formulations originally proposed in the 1960s for combining decision rules and problem constraints, SS uses strategies for combining solution vectors that have proved effective in a variety of problem settings. Path relinking (PR) has been suggested as an approach to integrate intensification and diversification strategies in a search scheme. The approach may be viewed as an extreme (highly focused) instance of a strategy that seeks to incorporate attributes of high quality solutions, by creating inducements to favo…
Best Proximity Points for Some Classes of Proximal Contractions
2013
Given a self-mapping g: A → A and a non-self-mapping T: A → B, the aim of this work is to provide sufficient conditions for the existence of a unique point x ∈ A, called g-best proximity point, which satisfies d g x, T x = d A, B. In so doing, we provide a useful answer for the resolution of the nonlinear programming problem of globally minimizing the real valued function x → d g x, T x, thereby getting an optimal approximate solution to the equation T x = g x. An iterative algorithm is also presented to compute a solution of such problems. Our results generalize a result due to Rhoades (2001) and hence such results provide an extension of Banach's contraction principle to the case of non-s…
An index formula on manifolds with fibered cusp ends
2002
We consider a compact manifold whose boundary is a locally trivial fiber bundle and an associated pseudodifferential algebra that models fibered cusps at infinity. Using trace-like functionals that generate the 0-dimensional Hochschild cohomology groups, we express the index of a fully elliptic fibered cusp operator as the sum of a local contribution from the interior and a term that comes from the boundary. This answers the index problem formulated by Mazzeo and Melrose. We give a more precise answer in the case where the base of the boundary fiber bundle is the circle. In particular, for Dirac operators associated to a "product fibered cusp metric", the index is given by the integral of t…
Novel pedagogical tool for simultaneous learning of plane geometry and R programming
2018
Programming a computer is an activity that can be very beneficial to undergraduate students in terms of improving their mental capabilities, collaborative attitudes and levels of engagement in learning. Despite the initial difficulties that typically arise when learning to program, there are several well-known strategies to overcome them, providing a very high benefit-cost ratio to most of the students. Moreover, the use of a programming language usually raises the interest of students to learn any specific concept, which has caused that many teachers around the world employ a programming language as a learning environment to treat almost every possible topic. Particularly, mathematics can …