An exact method for the 2D guillotine strip packing problem.
This paper investigates the problem of optimal partitioning of a measurable space among a finite number of individuals. We demonstrate the sufficient conditions for the existence of weakly Pareto optimal partitions and for the equivalence between weak Pareto optimality and Pareto optimality. We demonstrate that every weakly Pareto optimal partition is a solution to the problem of maximizing a weighted sum of individual utilities. We also provide sufficient conditions for the existence of core partitions...
We prove a result for the existence and uniqueness of the solution for a class of mildly nonlinear complementarity problem in a uniformly convex and strongly smooth Banach space equipped with a semi-inner product. We also get an extension of a nonlinear complementarity problem over an infinite dimensional space. Our last results deal with the existence of a solution of mildly nonlinear complementarity problem in a reflexive Banach space.
A bound for the greedy heuristic applied to the K-facility location problem can be calculated, using values gathered during the calculation of the heuristic. The bound strengthens a well-known bound for the heuristic. Computational experiments show that this bound can be beneficial when the number of facilities is small or close to the total number of potential sites. In addition, it is consistent with previous results about the influence of the data characteristics upon the optimal value.
The present study proposes an extended opportunity-based age replacement policy where opportunities occur according to a Poisson process. When the age, x of the system satisfies x < S for a prespecified value S, a corrective replacement is conducted if the objective system fails. In case x satisfies S ≤ x < T for another prespecified value T, we take an opportunity to preventively replace the system by a new one with probability p, and do not take the opportunity with probability 1 - p. At...
The article presents an extension of the theory of standard Markov decision processes on discrete spaces and with the average cost as the objective function which permits to take into account a fuzzy average cost of a trapezoidal type. In this context, the fuzzy optimal control problem is considered with respect to two cases: the max-order of the fuzzy numbers and the average ranking order of the trapezoidal fuzzy numbers. Each of these cases extends the standard optimal control problem, and for...
In this paper, we introduce a new iterative process for finding the common element of the set of fixed points of a nonexpansive mapping and the set of solutions of the variational inequality problem for an α-inverse-strongly-monotone, by combining an modified extragradient scheme with the viscosity approximation method. We prove a strong convergence theorem for the sequences generated by this new iterative process.
This paper considers the problem of robust reconstruction of simultaneous actuator and sensor faults for a class of uncertain Takagi-Sugeno nonlinear systems with unmeasurable premise variables. The proposed fault reconstruction and estimation design method with H∞ performance is used to reconstruct both actuator and sensor faults when the latter are transformed into pseudo-actuator faults by introducing a simple filter. The main contribution is to develop a sliding mode observer (SMO) with two...
A game is considered where the communication network of the first player is explicitly modelled. The second player may induce delays in this network, while the first player may counteract such actions. Costs are modelled through expectations over idempotent probability measures. The idempotent probabilities are conditioned by observational data, the arrival of which may have been delayed along the communication network. This induces a game where the state space consists of the network delays. Even...
A new biorthogonalization algorithm is defined which does not depend on the step-size used. The algorithm is suggested so as to minimize the total error after steps if imperfect steps are used. The majority of conjugate gradient algorithms are sensitive to the exactness of the line searches and this phenomenon may destroy the global efficiency of these algorithms.