Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "problem" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 87
Tytuł:
Stefan problems in non-cylindrical domains arising in Czochralski process of crystal growth
Autorzy:
Fukao, T.
Kenmochi, N.
Pawłow, I.
Powiązania:
https://bibliotekanauki.pl/articles/206232.pdf
Data publikacji:
2003
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
problem Stefana
domena niecylinryczna
Stefan problem
non-cylindrical domain
prescribed convection
Opis:
In this paper we discuss a two-phase Stefan problem with convection in a non-cylindrical (time-dependent) domain. This work is motivated by phase change phenomenon arising in the Czochralski process of crystal growth. The time-dependence of domain is a mathematical description of the situation in which the material domain changes its shape with time by crystal growth. We consider the so-called enthalpy formulation for it and give its solvability, assuming that the time-dependence of the material domain is prescribed and smooth enough in time, and the convective vector is prescribed, too. Our main idea is to apply the theory of quasi-linear equations of parabolic type.
Źródło:
Control and Cybernetics; 2003, 32, 2; 201-221
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Average case analysis of the set packing problem
Autorzy:
Szkatuła, K.
Powiązania:
https://bibliotekanauki.pl/articles/206822.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
Lagrange
set packing problem
Opis:
The paper deals with the well known set packing problem and its special case, when the number of subsets is maximized. It is assumed that some of the problem coefficients are realizations of mutually independent random variables. Average case (i.e. asymptotical probabilistic) properties of selected problem characteristics are investigated for the variety of possible instances of the problem.
Źródło:
Control and Cybernetics; 2014, 43, 4; 557-575
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Target assignment problem for air raid
Autorzy:
Chudy, M.
Powiązania:
https://bibliotekanauki.pl/articles/205571.pdf
Data publikacji:
1999
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
problem przyporządkowania adresów
air raid planning
assignment problem
branch-and-bound method
Opis:
The article deals with two formulations of the target assignment problem. The first one concerns a homogeneous collection of air raid means (different types of aircrafts and missiles). We propose a method for solving a subclass of the problem. The approach consists of two parts. First, an equivalent assignment-type problem is constructed, then a modified branch-and-bound method is used to solve the problem. The other formulation concerns a heterogencous collection of means. To describe this problem a new algebra is introduced
Źródło:
Control and Cybernetics; 1999, 28, 1; 101-113
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On some optimization problem related to economic equilibrium
Autorzy:
Naniewicz, Z.
Powiązania:
https://bibliotekanauki.pl/articles/1839186.pdf
Data publikacji:
2002
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
dwoistość
nierówność wariacyjna
problem optymalizacji
równowaga
duality
equilibrium
optimization problem
variational inequalities
Opis:
The paper considers an optimization problem in which the minima of a finite collection of objective functions satisfy some unilateral constraints and are linked together by a certain subdifferential relationship. The governing relations are stated as a variational inequality defined on a nonconvex feasible set. By the reduction to the variational inequality involving nonmonotone multivalued mapping, defined over nonnegative orthant, the existence of solutions is examined. The prototype is the general economic equilibrium problem. The exemplification of the theory for the quadratic multi-objective function is provided.
Źródło:
Control and Cybernetics; 2002, 31, 1; 141-165
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Systems of variational inequalities related to economic equilibrium
Autorzy:
Naniewicz, Z.
Nockowska, M.
Powiązania:
https://bibliotekanauki.pl/articles/970931.pdf
Data publikacji:
2007
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
optimization problem
variational inequalities
duality
Opis:
In the paper a new approach to the Walrasian general equilibrium model of economy is presented. The classical market clearing condition is replaced by suitably formulated variational inequality. It states that the market clears for a commodity if its equilibrium price is positive; otherwise, there may be an excess supply of the commodity in equilibrium and then its price is zero. Such approach enables establishing new existence results without assumptions which were fundamental for the currently used methods: (i) Dis-utility functions are not required to be strictly convex and they may attain their minima in the consumption sets (the local nonsatiation of preferences is not required). (ii) The boundary of the positive orthant is allowed for the price vector in equilibrium. It allows for investigation of certain new problems, e.g. bankruptcy conditions.
Źródło:
Control and Cybernetics; 2007, 36, 4; 889-909
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On descriptor systems and related linear quadratic problem
Autorzy:
Gessing, R.
Czornik, A.
Powiązania:
https://bibliotekanauki.pl/articles/206689.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
descriptor system
linear quadratic problem
Opis:
It is shown that a descriptor system under the condition of impulse controllability, Cobb (1984), may be converted, by means of linear transformations, to a system described in a state space and composed of state and output equations. The transfomations determine one to one correspondence between the solutions of both the systems. It is noted that the control in a feedback form may not determine a unique solution of the descriptor system what is often overlooked in many previous papers. It is also shown that the LCD problem formulated in a descriptor space for the impulse observable system, Cobb (1984); may be converted by means of linear transformations to the usual LQ problem formulated in the state space. It is stressed that the second problem may be regular even then, when the weighting matrix of the control, in the cost functional of the first problem, is singular. The proposed approach simplifies the calculations related to the LQ problem solution significantly.
Źródło:
Control and Cybernetics; 2000, 29, 1; 79-89
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The principal-agent problem in supply chain management – the simulation based framework
Autorzy:
Siuta, Kinga
Kaszyński, Daniel
Powiązania:
https://bibliotekanauki.pl/articles/2183432.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
supply chain
quantitative models for decision-making
simulation framework
agency problem
principal-agent problem
ESOP
Opis:
This research deals with a phenomenon well-known in socio-economic studies and referred to as the Agency Theory: the principal-agent problem. The agent is designated to act on behalf of the company owner, i.e., the principal, in the domain of supply chain management in the face of a supplier’s default uncertainty. Each of the players is gain-oriented, but their objective functions and the degree of risk-bearing may significantly differ, leading to an agent’s decisions not being optimal in terms of the principal’s outcome. This article proposes a multi-period supply chain simulation model that can be used to perform a supply chain optimization and comparison between the agent and the principal. The proposed framework allows for differentiating the model parametrization depending on the industry, in particular the consequences of the inability to deliver the end product, costs of keeping safety stocks, or the uncertainty regarding the suppliers’ delivery failure. As players’ objective functions, we consider expected profit-based indicators and measures taking the inter-period variance into account. We find that the agent’s actions may diverge from the principal’s optimum if the agent’s incentive system is not selected correctly. We also propose a solution that unifies the goals of the players. The recent COVID-19 pandemic amplifies the importance of such research. Many companies had to limit production capacities due to global lockdowns and, per the JIT production strategy, the prior safety stock levels were low.
Źródło:
Control and Cybernetics; 2021, 50, 1; 195--221
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the use of data analysis and OR modelling in MCDM problems: a case analysis – a rejoinder to the paper by Sousa Ribeiro et al.
Autorzy:
Owsiński, Jan W.
Powiązania:
https://bibliotekanauki.pl/articles/2183471.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
location problem
variables
criteria
objectives
modelling
Opis:
Taking as an example the very interesting and moti vating paper by Sousa Ribeiro et al. (2021) an attempt is made of providing a couple of insights into the decision making process from the point of view of the potentially helpful aspects of data analysis and OR-related modelling. These are just hints and suggestions, meant primarily to emphasise the multifaceted character of the decision making situations and processes, especially when concerning more complex issues. While the course of the procedure proposed and exemplified in Sousa Ribeiro et al. (2021) is treated as fully correctly and successfully carried out to the end, we wish to show the potential use of information, constituting in a sense a “by-product” of such a procedure, or, actually, of any similar procedure, aimed at supporting decision making.
Źródło:
Control and Cybernetics; 2021, 50, 3; 413--422
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Theconjugate points sufficient conditions for an optimal control
Autorzy:
Szymanowska, A.
Powiązania:
https://bibliotekanauki.pl/articles/206818.pdf
Data publikacji:
1998
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
pola ekstremali
problem Bolza
sterowanie optymalne
warunek wystarczający
field of extremals
generalized problem of Bolza
sufficient conditions
Opis:
The paper concerns an application of the idea of field theory and the concept of "concourse of flights" to the sufficient optimality conditions for the optimal control problems stated in terms of focal and conjugate points. The concept of concourse of flights was begun by Young (1969), and later extended by Nowakowski (1988). In the paper the definition of a focal and conjugate point of a field of extremals is given. Using these concepts, we prove that the existence of a field of extremals without conjugate points implies the existence of concourse of flights and consequently we obtain the second order sufficient conditions for the generalized problem of Bolza. Another approach to the concept of focal and conjugate points is given by Zeidan (1983, 1984).
Źródło:
Control and Cybernetics; 1998, 27, 3; 353-362
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the global asymptotic stability problem and the Jacobian conjecture
Autorzy:
Drużkowski, L. M.
Powiązania:
https://bibliotekanauki.pl/articles/1839158.pdf
Data publikacji:
2005
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
hipoteza jakobianu
global stability problem
Jacobian Conjecture
Opis:
In this survey, we recall the formulation of the problems and give a review of some nontrivial results in the area. Let F = (F1,...,Fn] : R^n - --> R^n be a C^1 map and let F'(x) and Jac F(x) = det F'(x) denote the Jacobian matrix and the jacobian of F at a point x belongs to R^n, respectively. The Global Asymptotic Stability Problem (GASP) reads as follows: Assume that F(0] = 0 and at any point x belongs to R^n all eigenvalues of F'(x) have negative real parts. Then consider the associated system of differential equations x'j(t] = Fj(x1(t), ...,Xn(t)), j = 1,...,n. The question is whether the solution x[t] = 0 is globally asymptotically stable. If n > 2, then the answer is negative (even if F is a a polynomial automorphism), so from now on (GASP) denotes (GASP) restricted to R^2. In 1963, Olech showed that under the (GASP) assumption (i. e., Jac F[x) > 0 and Trace F'(x) = [...] < 0 for any x belong to R^2) the conclusion of (GASP) is equivalent to the injectivity of F. In 1994, Fessler, and independently Gutierrez, proved the injectivity of F and, due to the above mentioned Olech's equivalence, gave the affirmative answer to the two-dimensional (GASP). Let K denote R or C, n > 1. The Jacobian Conjecture can be formulated as follows: If F = (F1, ... ,Fn) : K^n --> K^n is a polynomial map with a constant nonzero jacobian, then F is a polynomial automorphism (i.e. there exists F^-1 and F^-1 is also a polynomial map). Although the Jacobian Conjecture is still unsolved even in the case of n = 2, it is convenient, to consider the so called Generalized Jacobian Conjecture (for short (GJC)): the Jacobian Conjecture holds for every n > 1. We give a review of some interesting conditions equivalent to the Jacobian Conjecture, including Meisters and Olech's result on the existence of a poly-flow solution of the associated Ważewski equation x'(t) = [F'(x(t))]^-1 (a). We also present, a reduction of (GJC) to the case of F of degree 3 and of special forms, then some partial results, and (JC)'s relations with other problems.
Źródło:
Control and Cybernetics; 2005, 34, 3; 747-762
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Neural networks for the N-Queens Problem : a review
Autorzy:
Mańdziuk, J.
Powiązania:
https://bibliotekanauki.pl/articles/205945.pdf
Data publikacji:
2002
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
optymalizacja kombinatoryczna
problem n-hetmanów
sieć Hopfielda
sieć neuronowa
combinatorial optimization
Hopfield network
N-Queens Problem
neural networks
Opis:
Neural networks can be successfully applied to solving certain types of combinatorial optimization problems. In this paper several neural approaches to solving constrained optimization problems are presented and their properties discussed. The main goal of the paper is to present various improvements to the wellknown Hopfield models which are intensively used in combinatorial optimization domain. These improvements include deterministic modifications (binary Hopfield model with negative self-feedback connections and Maximum Neural Network model), stochastic modifications (Gaussian Machine), chaotic Hopfield-based models (Chaotic Neural Network and Transiently Chaotic Neural Network), hybrid approaches (Dual-mode Dynamic Neural Network and Harmony Theory approach) and finally modifications motivated by digital implementation feasibility (Strictly Digital Neural Network). All these models are compared based on a commonly used benchmark prohlem - the N-Queens Problem (NQP). Numerical results indicate that each of modified Hopfield models can be effectively used to solving the NQP. Coonvergence to solutions rate of these methods is very high - usually close to 100%. Experimental time requirements are generally low - polynomial in most casos. Some discussion of non-neural, heuristic approaches to solving the NQP is also presented in the paper.
Źródło:
Control and Cybernetics; 2002, 31, 2; 217-248
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Turnpike properties of approximate solutions of autonomous variational problems
Autorzy:
Zaslavski, A. J.
Powiązania:
https://bibliotekanauki.pl/articles/969609.pdf
Data publikacji:
2008
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
good function
infinite horizon problem
integrand
turnpike property
Opis:
In this work we study the structure of approximate solutions of autonomous variational problems with vector-valued functions. We are interested in turnpike properties of these solutions, which are independent of the length of the interval, for all sufficiently large intervals. We show that the turnpike properties are stable under small perturbations of integrands.
Źródło:
Control and Cybernetics; 2008, 37, 2; 491-512
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Shape differentiability of the Neumann problem of the Laplace equation in the half-space
Autorzy:
Amrouche, C.
Necasova, S.
Sokołowski, J.
Powiązania:
https://bibliotekanauki.pl/articles/970287.pdf
Data publikacji:
2008
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
shape optimization
Neumann problem
unbounded domain
material derivative
Opis:
We deal with the existence of the material derivative of the Laplace equation with the Neumann boundary condition in the half space. We consider two different perturbations of domains to get the existence of weak Gateaux material derivative and the existence of Fréchet material derivatives.
Źródło:
Control and Cybernetics; 2008, 37, 4; 747-769
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Fusion filtration in LQG control for multisensor systems
Autorzy:
Duda, Z.
Powiązania:
https://bibliotekanauki.pl/articles/206075.pdf
Data publikacji:
2013
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
multisensor system
Kalman filter
LQG problem
fusion filtration
Opis:
In the paper, state filtration in a LQG problem formulated for a multisensor system is considered. Control is determined by a central node as a linear form of a state estimate. It is assumed that control values are not available to local nodes. Because of the drawbacks of centralized filtration an optimal fusion of decentralized local Kalman filters is proposed. When control values are not available to local nodes, then control should be treated as a random variable in the synthesis of local state estimates. This leads to a non-classical estimation. It is shown that the proposed filter is equivalent to the centralized one.
Źródło:
Control and Cybernetics; 2013, 42, 4; 743-754
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Generalized α-V-univex functions for multiobjective variational control problems
Autorzy:
Sharma, S.
Choudhury, S.
Jayswal, A.
Powiązania:
https://bibliotekanauki.pl/articles/206848.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
control problem
α-V-univexity
efficiency
sufficiency
duality
Opis:
The purpose of this paper is to introduce a new class of _-V-univex/ generalized _-V-univex functions for a class of multiobjective variational control problems. Moreover, sufficient optimality conditions and Mond-Weir type duality results, associated with the multiobjective variational control problem, are established under aforesaid assumptions.
Źródło:
Control and Cybernetics; 2014, 43, 3; 403-420
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 87

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies