We are interested in the performance evaluation of timed event graphs with multipliers. The dynamical equation modelling such graphs are nonlinear in (min,+) algebra. This nonlinearity is due to multipliers and prevents from applying usual performance analysis results. As an alternative, we propose a linearization method in (min,+) algebra of timed event graphs with multipliers. From the obtain...

almost multiplier is rather a new concept in the theory of almost functions. in thispaper we discuss on the boundedness of almost multipliers on some special banach algebras,namely stable algebras. we also dene an adjoint and extension for almost multiplier.

Kyparisis proved in 1985 that a strict version of the MangasarianFromovitz constraint qualification (MFCQ) is equivalent to the uniqueness of Lagrange multipliers. However, the definition of this strict version of MFCQ requires the existence of a Lagrange multiplier and is not a constraint qualification (CQ) itself. In this note we show that LICQ is the weakest CQ which ensures (existence and) ...

This thesis proposes a two-stage optimization for solving unit commitment. In the first stage, Lagrangian Relaxation (LR) method is used to solve unit commitment using a sub-gradient algorithm for updating Lagrange multipliers. In the second stage, Particle Swarm Optimization (PSO) is applied to update Lagrange multipliers in the Lagrangian Relaxation method (PSOLR). Lagrange multipliers soluti...

In this paper, we determine the structure of the space of multipliers of the range of a composition operator $C_varphi$ that induces by the conditional expectation between two $L^p(Sigma)$ spaces.

Problem statement: The development cost for Application Specific Integrated Circuits (ASICs) are high, algorithms should be verified and optimized before implementation. The Digital Signal Processing (DSP), image processing and multimedia requires extensive use of multiplication. The truncated multipliers can easily be implemented using Field Programmable Gate Array (FPGA) devices. Approach: Th...

We introduce the concept of frame of multipliers in Hilbert modules over pro-C∗-algebras and show that many properties of frames in Hilbert C∗-modules are valid for frames of multipliers in Hilbert modules over proC∗-algebras.

We use the ideas of generalized convexity. We focus our attention on the set of multipliers. We look for an interpretation of multipliers as generalized derivatives of the performance function associated with a dualizing parameterization of the given problem.