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
173
We describe an O.R. technique which plans the allotment of
time of the collaborators of a big company. The proposed method not only
considers the immediate profitability of the company, but also the
training of
the collaborators in order to guarantee the success of the company's
rising
generation. The proposed method uses a greedy approach and constitutes
therefore a simple and fast tool for decision makers. It has been
successfully
implemented in an important Swiss bank society.
In this paper a formulation for the fuzzy p-median model in a fuzzy environment is presented. The model allows to find optimal locations of p facilities and their related cost when data related to the node demands and the edge distances are imprecise and uncertain and also to know the degree of certainty of the solution. For the sake of illustration, the proposed model is applied in a reduced map of Kinshasa (Democratic Republic of Congo) obtaining results which are rather than realistic ones.
An optimal control problem governed by a bilinear elliptic equation is considered. This problem is solved by the sequential quadratic programming (SQP) method in an infinite-dimensional framework. In each level of this iterative method the solution of linear-quadratic subproblem is computed by a Galerkin projection using proper orthogonal decomposition (POD). Thus, an approximate (inexact) solution of the subproblem is determined. Based on a POD a-posteriori error estimator developed by Tröltzsch...
An optimal control problem governed by a bilinear elliptic equation is considered. This
problem is solved by the sequential quadratic programming (SQP) method in an
infinite-dimensional framework. In each level of this iterative method the solution of
linear-quadratic subproblem is computed by a Galerkin projection using proper orthogonal
decomposition (POD). Thus, an approximate (inexact) solution of the subproblem is
determined. Based on a POD...
We deal here with a scheduling problem GPPCSP (Generalized Parallelism and Preemption Constrained Scheduling Problem) which is an extension of both the well-known Resource Constrained Scheduling Problem and the Scheduling Problem with Disjunctive Constraints. We first propose a reformulation of GPPCSP: according to it, solving GPPCSP means finding a vertex of the Feasible Vertex Subset of an Antichain Polyhedron. Next, we state several theoretical results related to this reformulation process and...
This paper is devoted to singular calculus of variations problems with constraint functional not regular at the solution point in the sense that the first derivative is not surjective. In the first part of the paper we pursue an approach based on the constructions of the p-regularity theory. For p-regular calculus of variations problem we formulate and prove necessary and sufficient conditions for optimality in singular case and illustrate our results by classical example of calculus of variations...
Based upon an observation that it is too restrictive to assume a definite correlation of the underlying asset price and its volatility, we use a hybrid model of the constant elasticity of variance and stochastic volatility to study a portfolio optimization problem for pension plans. By using asymptotic analysis, we derive a correction to the optimal strategy for the constant elasticity of variance model and subsequently the fine structure of the corrected optimal strategy is revealed. The result...
The problem of finding a gain matrix of the state-feedback of 2D linear system such that the closed-loop system is positive and asymptotically stable is formulated and solved. Necessary and sufficient conditions for the solvability of the problem are established. It is shown that the problem can be reduced to suitable linear programming problem. The proposed approach can be extended to 2D linear system described by the 2D Roesser model.
Currently displaying 61 –
80 of
173