All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 4 Next

Displaying 61 – 80 of 107

Showing per page

Diseño de redes intercambiadoras de calor con utilidades múltiples por programación lineal.

A. Rodríguez, José Antonio Souto González, Juan J. Casares Long (1991)

Trabajos de Investigación Operativa

Se analiza la aplicación de un algoritmo de Programación de Redes, el método Out of Kilter, al análisis y diseño de redes de intercambiadores de calor con utilidades externas múltiples. Tradicionalmente, los métodos heurísticos y termodinámicos han sido los más utilizados. Sin embargo, estos métodos presentan dificultades de aplicación en aquellos problemas, como el planteado en este trabajo, en los que se incorpora más de una utilidad externa de calentamiento. Por el contrario, el método Out of...

Distancias elipsoidales y puntos eficientes. Un método interactivo.

María Teresa Ramos Domínguez, Miguel Sánchez García, Carlos González Martín (1988)

Trabajos de Investigación Operativa

En este trabajo se estudian las propiedades que relacionan las distancias elipsoidales con la generación de puntos eficientes de un problema de programación multiobjetivo. Basándonos en estas propiedades, hemos construido un algoritmo interactivo convergente.

Distributed aggregative optimization with quantized communication

Ziqin Chen, Shu Liang (2022)

Kybernetika

In this paper, we focus on an aggregative optimization problem under the communication bottleneck. The aggregative optimization is to minimize the sum of local cost functions. Each cost function depends on not only local state variables but also the sum of functions of global state variables. The goal is to solve the aggregative optimization problem through distributed computation and local efficient communication over a network of agents without a central coordinator. Using the variable tracking...

Distributed event-triggered algorithm for optimal resource allocation of multi-agent systems

Weiyong Yu, Zhenhua Deng, Hongbing Zhou, Xianlin Zeng (2017)

Kybernetika

This paper is concerned with solving the distributed resource allocation optimization problem by multi-agent systems over undirected graphs. The optimization objective function is a sum of local cost functions associated to individual agents, and the optimization variable satisfies a global network resource constraint. The local cost function and the network resource are the private data for each agent, which are not shared with others. A novel gradient-based continuous-time algorithm is proposed...

Distributed fuzzy decision making for production scheduling.

Thomas A. Runkler, Rudolf Sollacher, Wendelin Reverey (2004)

Mathware and Soft Computing

In production systems, input materials (educts) pass through multiple sequential stages until they become a product. The production stages consist of different machines with various dynamic characteristics. The coupling of those machines is a non-linear distributed system. With a distributed control system based on a multi-agent approach, the production system can achieve (almost) maximum output, where lot size and lot sequence are the most important control variables. In most production processes...

Distributed optimization for multi-agent system over unbalanced graphs with linear convergence rate

Songsong Cheng, Shu Liang (2020)

Kybernetika

Distributed optimization over unbalanced graphs is an important problem in multi-agent systems. Most of literatures, by introducing some auxiliary variables, utilize the Push-Sum scheme to handle the widespread unbalance graph with row or column stochastic matrix only. But the introduced auxiliary dynamics bring more calculation and communication tasks. In this paper, based on the in-degree and out-degree information of each agent, we propose an innovative distributed optimization algorithm to reduce...

Doubly reflected BSDEs with call protection and their approximation

Jean-François Chassagneux, Stéphane Crépey (2014)

ESAIM: Probability and Statistics

We study the numerical approximation of doubly reflected backward stochastic differential equations with intermittent upper barrier (RIBSDEs). These denote reflected BSDEs in which the upper barrier is only active on certain random time intervals. From the point of view of financial interpretation, RIBSDEs arise as pricing equations of game options with constrained callability. In a Markovian set-up we prove a convergence rate for a time-discretization scheme by simulation to an RIBSDE. We also...

Dual method for solving a special problem of quadratic programming as a subproblem at nonlinear minimax approximation

Ladislav Lukšan (1986)

Aplikace matematiky

The paper describes the dual method for solving a special problem of quadratic programming as a subproblem at nonlinear minimax approximation. Two cases are analyzed in detail, differring in linear dependence of gradients of the active functions. The complete algorithm of the dual method is presented and its finite step convergence is proved.

Dualidad de Haar y problemas de momentos.

Miguel Angel Goberna Torrent (1986)

Trabajos de Investigación Operativa

En la primera parte de este trabajo damos una versión simplificada de la conocida relación entre la dualidad en Programación Semi-Infinita y cierta clase de problemas de momentos, basándonos en las propiedades de los sistemas de Farkas-Minkowski. Planteamos a continuación otra clase de problemas de momentos para cuyo análisis resulta de utilidad una generalización del Lema de Farkas.

Dualidad en la programación lineal en subconjuntos difusos.

José Llena Sitjes (1988)

Trabajos de Investigación Operativa

La programación lineal sobre subconjuntos difusos, definida por Zimmermann, se desarrolla en estrecha relación con la definición de las funciones pertinentes funciones de pertenencia. Se estudia la dualidad difusa, ligada a la dualidad en los problemas de programación lineal con multicriterios.

Duality for a fractional variational formulation using η -approximated method

Sony Khatri, Ashish Kumar Prasad (2023)

Kybernetika

The present article explores the way η -approximated method is applied to substantiate duality results for the fractional variational problems under invexity. η -approximated dual pair is engineered and a careful study of the original dual pair has been done to establish the duality results for original problems. Moreover, an appropriate example is constructed based on which we can validate the established dual statements. The paper includes several recent results as special cases.

Duality in Constrained DC-Optimization via Toland’s Duality Approach

Laghdir, M., Benkenza, N. (2003)

Serdica Mathematical Journal

2000 Mathematics Subject Classification: 90C48, 49N15, 90C25In this paper we reconsider a nonconvex duality theory established by B. Lemaire and M. Volle (see [4]), related to a primal problem of minimizing the difference of two convex functions subject to a DC-constraint. The purpose of this note is to present a new method based on Toland-Singer duality principle. Applications to the case when the constraints are vector-valued are provided.

Currently displaying 61 – 80 of 107