This paper presents Chemo-tactic PSO-DE (CPSO-DE) optimization algorithm combined with Lagrange Relaxation method (LR) for solving Unit Commitment (UC) problem. The proposed approach employs Chemo-tactic PSO-DE algorithm for optimal settings of Lagrange multipliers. It provides high-quality performance and reaches global solution and is a hybrid heuristic algorithm based on Bacterial Foraging O...

The Lagrangian relaxation strategy (or dualization) is one of the most important methodologies of optimization for solving structured large-scale mathematical programming problems. The line search procedure is very often encountered in solving the dual problem by using some ascent algorithm, such as a bundle algorithm, or an interior point algorithm, etc.. The existing line search methods, for ...

We propose new primal-dual decomposition algorithms for solving systems of inclusions involving sums of linearly composed maximally monotone operators. The principal innovation in these algorithms is that they are block-iterative in the sense that, at each iteration, only a subset of the monotone operators needs to be processed, as opposed to all operators as in established methods. Determinist...

The assignment problem serves as the basis for a novel formulation and initial approach to assigning participants in holiday " Pollyanna " gift exchanges. This research presents the formalization of a typical heuristic assignment with constraints as commonly imposed by family and work dynamics. The constraints include restrictions on exchanging within the same nuclear family, restrictions on re...

This paper is concerned with building CCG-grounded, semantics-oriented deep dependency structures with a data-driven, factorization model. Three types of factorization together with different higherorder features are designed to capture different syntacto-semantic properties of functor-argument dependencies. Integrating heterogeneous factorizations results in intractability in decoding. We prop...

Abstract This paper presents a novel technique to compute Lagrangian bounds for nonconvex mixed-integer quadratically constrained quadratic programming problems presenting separable structure (i.e., problems) such as those arising in deterministic equivalent representations of two-stage stochastic problems. In general, the nature these models still poses challenge available solvers, which do no...

This paper introduces the Lagrangian relaxation method to solve multiobjective optimization problems. It is often required use appropriate technique determine multipliers in that leads finding optimal solution problem. Our analysis aims find a suitable generate multipliers, and later these are used Multiobjective We propose search-based Lagrange multipliers. In our paper, we choose well-known s...