The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 61 –
80 of
156
Este trabajo estudia el problema de planificación de la producción representado por un modelo de costes cóncavos sujeto a limitaciones de capacidad. La relajación lineal del modelo es analizada usando un enfoque primal-dual. Las soluciones del dual se obtienen resolviendo para cada producto modelos sin restricciones de capacidad asignando un precio a las mismas. El primal reducido supone un test de admisibilidad de dichas soluciones. El dual reducido permite calcular los nuevos precios recomendados...
En este artículo estudiamos la utilización de métodos duales en el diseño de algoritmos híbridos para la resolución de problemas de "Set Partitioning" (SP). Las técnicas duales resultan de gran interés para resolver problemas con estructura combinatoria no sólo porque generan cotas inferiores sino porque, además, su utilización junto con heurísticas y procedimientos de generación de desigualdades en el diseño de algoritmos híbridos permite evaluar la calidad de las cotas superiores obtenidas. Los...
In terms of the normal cone and the coderivative,
we provide some necessary and/or sufficient conditions of metric subregularity for
(not necessarily closed) convex multifunctions in normed spaces. As applications, we present some
error bound results for (not necessarily lower semicontinuous) convex functions on normed
spaces. These results improve and extend some existing error bound results.
The numerical solution of granular dynamics problems with Coulomb friction leads to the problem of minimizing a convex quadratic function with semidefinite Hessian subject to a separable conical constraints. In this paper, we are interested in the numerical solution of this problem. We suggest a modification of an active-set optimal quadratic programming algorithm. The number of projection steps is decreased by using a projected Barzilai-Borwein method. In the numerical experiment, we compare our...
This paper provides an extension of results connected with the problem of the optimization of a linear objective function subject to fuzzy relational equations and an inequality constraint, where is an operation. This research is important because the knowledge and the algorithms presented in the paper can be used in various optimization processes. Previous articles describe an important problem of minimizing a linear objective function under a fuzzy relational equation and an inequality constraint,...
Assume that tasks must be processed by one machine in a fixed sequence. The processing time, the preferred starting time and the earliness and tardiness costs per time unit are known for each task. The problem is to allocate each task a starting time such that the total cost incurred by the early and tardy tasks is minimum. Garey et al. have proposed a nice algorithm for the special case of symmetric and task-independent costs. In this paper we first extend that algorithm to the case of asymmetric...
Assume that n tasks must be processed by one machine in a fixed
sequence. The processing time, the preferred starting time and
the earliness and tardiness costs per time unit are known for each
task. The problem is to allocate each task a starting time such
that the total cost incurred by the early and tardy tasks is
minimum. Garey et al. have proposed a nice O(nlogn)
algorithm for the special case of symmetric and task-independent
costs. In this paper we first extend that algorithm to the...
We apply four different methods to study an intrinsically bang-bang optimal control problem. We study first a relaxed problem that we solve with a naive nonlinear programming approach. Since these preliminary results reveal singular arcs, we then use Pontryagin’s Minimum Principle and apply multiple indirect shooting methods combined with homotopy approach to obtain an accurate solution of the relaxed problem. Finally, in order to recover a purely bang-bang solution for the original problem, we...
This paper considers the problem of scheduling n jobs on a single machine. A fixed processing time and an execution interval are associated with each job. Preemption is not allowed. The objective is to find a feasible job sequence that minimizes the number of tardy jobs. On the basis of an original mathematical integer programming formulation, this paper shows how good-quality lower and upper bounds can be computed. Numerical experiments are provided for assessing the proposed approach.
We present briefly some results we obtained with known methods to solve minimum cost tension problems, comparing their performance on non-specific graphs and on series-parallel graphs. These graphs are shown to be of interest to approximate many tension problems, like synchronization in hypermedia documents. We propose a new aggregation method to solve the minimum convex piecewise linear cost tension problem on series-parallel graphs in operations.
We present briefly some results we obtained with known methods to solve minimum cost tension problems, comparing their performance on non-specific graphs and on series-parallel graphs. These graphs are shown to be of interest to approximate many tension problems, like synchronization in hypermedia documents. We propose a new aggregation method to solve the minimum convex piecewise linear cost tension problem on series-parallel graphs in O(m3) operations.
Currently displaying 61 –
80 of
156