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ę "Optimization problem" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 128
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ł:
A model for the inverse 1-median problem on trees under uncertain costs
Autorzy:
Nguyen, K. T.
Chi, N. T. L.
Powiązania:
https://bibliotekanauki.pl/articles/254814.pdf
Data publikacji:
2016
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
location problem
uncertain variable
inverse optimization problem
tree
Opis:
We consider the problem of justifying vertex weights of a tree under uncertain costs so that a prespecified vertex become optimal and the total cost should be optimal in the uncertainty scenario. We propose a model which delivers the information about the optimal cost which respect to each confidence level α ∈ [0,1]. To obtain this goal, we first define an uncertain variable with respect to the minimum cost in each confidence level. If all costs are independently linear distributed, we present the inverse distribution function of this uncertain variable in [formula]time, where n is the number of vertices in the tree.
Źródło:
Opuscula Mathematica; 2016, 36, 4; 513-523
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A model for optimizing enterprise’s inventory costs : a fuzzy approach
Autorzy:
Kosiński, W
Muniak, R.
Kosiński, W. K.
Powiązania:
https://bibliotekanauki.pl/articles/406354.pdf
Data publikacji:
2013
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
economic order quantity
optimization problem
ordered fuzzy numbers
Opis:
Applicability of a fuzzy approach to a problem originating from administrative accounting, namely to determine an economic order quantity (EOQ) in a variable competitive environment with imprecise and vague data, has been presented. For this purpose, the model of ordered fuzzy numbers developed by the first author and his two co-workers is used. The present approach generalizes the one developed within the framework of convex fuzzy numbers and stays outside the probabilistic one.
Źródło:
Operations Research and Decisions; 2013, 23, 4; 39-54
2081-8858
2391-6060
Pojawia się w:
Operations Research and Decisions
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Variational approach to some optimization control problems
Autorzy:
Bianchini, R.
Powiązania:
https://bibliotekanauki.pl/articles/1359657.pdf
Data publikacji:
1995
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
tangent vectors
variational cone
local controllability
Mayer's optimization problem
Opis:
This paper presents the variational approach to some optimization problems: Mayer's problem with or without constraints on the final point, local controllability of a trajectory, time-optimal problems.
Źródło:
Banach Center Publications; 1995, 32, 1; 83-94
0137-6934
Pojawia się w:
Banach Center Publications
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ł:
Assets/liabilities portfolio immunization as an optimization problem
Autorzy:
Kondratiuk-Janyska, A.
Kałuszka, M.
Powiązania:
https://bibliotekanauki.pl/articles/969959.pdf
Data publikacji:
2006
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
immunizacja
zagadnienie optymalizacji
immunization
optimization problem
single risk measures
multiple risk measure
Opis:
The aim of this paper is to present bond portfolio immunization strategies in the case of multiple liabilities, based on single-risk or multiple-risk measure models under the assumption of multiple shocks in the term structure of interest rates referring, in particular, to Fong and Vasicek (1984), Nawalkha and Chambers (1996), Balbas and Ibanez (1998) and Hurlimann (2002). Immunization problem is formulated as a constrained optimization problem under a fixed open loop strategy. New risk measures associated with changes of the term structure are also defined.
Źródło:
Control and Cybernetics; 2006, 35, 2; 335-349
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Using an optimization methods to selection the best software developer
Wykorzystanie metod optymalizacji do wyznaczania najlepszego producenta oprogramowania
Autorzy:
Worwa, K.
Powiązania:
https://bibliotekanauki.pl/articles/404127.pdf
Data publikacji:
2011
Wydawca:
Polskie Towarzystwo Symulacji Komputerowej
Tematy:
metody optymalizacji
dwukryterialny problem optymalizacji
wybór najlepszego producenta
producent oprogramowania
optimization methods
bicriterial optimization problem
selection the best developer
software developer
Opis:
A practical problem of choosing a software developer is considered. This problem is investigated from a user’s viewpoint, i.e. it is assumed that the software which is needed should be not only reliable but as cheap as possible too. The purpose of the paper is to propose some formal way of determining software developer by formulating and solving the bicriterial optimization problem will both minimize the value of the number of software tasks which have incorrect realization during some time period and minimize the value of the software development cost. Some numerical example is presented to illustrate of practical usefulness of the method which is proposed. The exemplary bicriterial optimization problem is solved on the base of the general methodology of solving multicriteria optimization problems.
W artykule przedstawiono propozycję pewnego wskaźnika jakości programu, w konstrukcji którego uwzględniono warunki jego użytkowej eksploatacji. Dla zilustrowania przydatności skonstruowanego wskaźnika jakości programu w dalszej części artykułu sformułowano dwukryterialne zadanie wyboru wariantu produkcji programu, z kosztem produkcji i proponowanym wskaźnikiem jakości programu jako kryteriami składowymi.
Źródło:
Symulacja w Badaniach i Rozwoju; 2011, 2, 2; 123-133
2081-6154
Pojawia się w:
Symulacja w Badaniach i Rozwoju
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimal control for elasto-orthotropic plate
Autorzy:
Lovišek, J.
Králik, J.
Powiązania:
https://bibliotekanauki.pl/articles/969940.pdf
Data publikacji:
2006
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
control of variational inequalities
elasto-orthotropic plate
optimal design
weight minimization
approximate optimization problem
Opis:
The optimal control problems and a weight minimization problem are considered for elastic three-layered plate with inner obstacle and friction condition on a part of the boundary. The state problem is represented by a variational inequality and the design variables influence both the coefficients and the set of admissible state functions. We prove the existence of a solution to the above-mentioned problem on the basis of a general theorem on the control of variational inequalities. Next, the approximate optimization problem is proved on the basis of the general theorem for the continuous problem. When the mesh/size tends to zero, then any sequence of appropriate solutions converges uniformly to a solution of the continuous problem. Finally, the application to the optimal design of unilaterally supported of rotational symmetrical load elastic annular plate is presented.
Źródło:
Control and Cybernetics; 2006, 35, 2; 219-278
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Design of Pareto-Optimal Radar Receive Filters
Autorzy:
De Maio, A.
Piezzo, M.
Iommelli, S.
Farina, A.
Powiązania:
https://bibliotekanauki.pl/articles/227067.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
radar receive filter design
mismatched filte
design
multi-objective optimization problem
Pareto-optimal points
Opis:
This paper deals with the design of radar receive filters jointly optimized with respect to sidelobe energy and sidelobe peaks via Pareto-optimal theory. We prove that this criterion is tantamount to jointly minimizing two quadratic forms, so that the design can be analytically formulated in terms of a multi-objective optimization problem. In order to solve it, we resort to the scalarization technique, which reduces the vectorial problem into a scalar one using a Pareto weight defining the relative importance of the two objective functions. At the analysis stage, we assess the performance of the receive filters in correspondence of different values of the Pareto weight highlighting the performance compromises between the Integrated Sidelobe Level (ISL) and the Peak Sidelobe Level (PSL).
Źródło:
International Journal of Electronics and Telecommunications; 2011, 57, 4; 477-481
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Artificial bee colony based state feedback position controller for PMSM servo-drive – the efficiency analysis
Autorzy:
Tarczewski, T.
Niewiara, L. J.
Grzesiak, L. M.
Powiązania:
https://bibliotekanauki.pl/articles/200239.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
tuning
PMSM servo-drive
artificial bee colony algorithm
linear-quadratic optimization problem
pole placement
Opis:
This paper presents a state feedback controller (SFC) for position control of PMSM servo-drive. Firstly, a short review of the commonly used swarm-based optimization algorithms for tuning of SFC is presented. Then designing process of current control loop as well as of SFC with feedforward path is depicted. Next, coefficients of controller are tuned by using an artificial bee colony (ABC) optimization algorithm. Three of the most commonly applied tuning methods (i.e. linear-quadratic optimization, pole placement technique and direct selection of coefficients) are used and investigated in terms of positioning performance, disturbance compensation and robustness against plant parameter changes. Simulation analysis is supported by experimental tests conducted on laboratory stand with modern PMSM servo-drive.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2020, 68, 5; 997-1007
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Changes of the set of efficient solutions by extending the number of objectives and its evaluation
Zmiany zbioru rozwiązań sprawnych przy zwiększeniu liczby celów i ich ocena
Autorzy:
Malinowska, A.
Powiązania:
https://bibliotekanauki.pl/articles/206753.pdf
Data publikacji:
2002
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
nieistotna funkcja celu
rozwiązania sprawne
zadanie optymalizacji wektorowej
efficient solutions
nonessential objective function
vector optimization problem
Opis:
In this paper the vector optimization problem P with continuous and convex objective functions on a compact convex feasible set is considered. We form a new vector optimisation problem P* from P by adding an objective function to the problem P. The necessary and sufficient conditions for the sets of efficient solutions of these two problems to be equal are given. In the case where the set of efficient solutions of the problem P* contains that of P, we also suggest how the difference between the sets of efficient solutions of the problems P* and P might be evaluated. Examples are given to illustrate our results.
W artykule rozważa się zadanie optymalizacji wektorowej P z ciągłymi i wypukłymi funkcjami celu na zwartym wypukłym zbiorze rozwiazań dopuszczalnych. Tworzymy nowe zadanie optymalizacji wektorowej P* poprzez dodanie funkcji celu do zadania P. Podano warunki konieczne i wystarczające do tego, by zbiory rozwiązań sprawnych obu zadań były równe. Dla przypadku, gdy zbiór rozwiązan sprawnych zadania P* zawiera odpowiedni zbiór dla P, zaproponowano także sposób oceny różnicy między tymi zbiorami rozwiązań sprawnych. Wyniki podane w artykule zostały zilustrowane przykładami.
Źródło:
Control and Cybernetics; 2002, 31, 4; 965-974
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A factor graph based genetic algorithm
Autorzy:
Helmi, B. H.
Rahmani, A. T.
Pelikan, M.
Powiązania:
https://bibliotekanauki.pl/articles/330811.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
optimization problem
genetic algorithm
estimation
distribution algorithm
factor graph
matrix factorization
problem optymalizacji
algorytm genetyczny
algorytm estymacji rozkładu
faktoryzacja macierzy
Opis:
We propose a new linkage learning genetic algorithm called the Factor Graph based Genetic Algorithm (FGGA). In the FGGA, a factor graph is used to encode the underlying dependencies between variables of the problem. In order to learn the factor graph from a population of potential solutions, a symmetric non-negative matrix factorization is employed to factorize the matrix of pair-wise dependencies. To show the performance of the FGGA, encouraging experimental results on different separable problems are provided as support for the mathematical analysis of the approach. The experiments show that FGGA is capable of learning linkages and solving the optimization problems in polynomial time with a polynomial number of evaluations.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2014, 24, 3; 621-633
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Performance Study on Synchronous and Asynchronous Update Rules for A Plug-In Direct Particle Swarm Repetitive Controller
Autorzy:
Ufnalski, B.
Grzesiak, L. M.
Powiązania:
https://bibliotekanauki.pl/articles/141272.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
repetitive process control
particle swarm optimization (PSO)
synchronous and asynchronous update rules
dynamic optimization problem
repetitive disturbance rejection
optimal control
Opis:
In this paper two different update schemes for the recently developed plug-in direct particle swarm repetitive controller (PDPSRC) are investigated and compared. The proposed approach employs the particle swarm optimizer (PSO) to solve in on-line mode a dynamic optimization problem (DOP) related to the control task in the constant-amplitude constant-frequency voltage-source inverter (CACF VSI) with an LC output filter. The effectiveness of synchronous and asynchronous update rules, both commonly used in static optimization problems (SOPs), is assessed and compared in the case of PDPSRC. The performance of the controller, when synthesized using each of the update schemes, is studied numerically.
Źródło:
Archives of Electrical Engineering; 2014, 63, 4; 635-646
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimization of traveling salesman problem using affinity propagation clustering and genetic algorithm
Autorzy:
El-Samak, A. F.
Ashour, W.
Powiązania:
https://bibliotekanauki.pl/articles/91810.pdf
Data publikacji:
2015
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
combinatorial optimization problem
travel salesman problem
genetic algorithm
evolutionary computation algorithm
affinity propagation clustering technique
AP
problem optymalizacji kombinatorycznej
algorytm genetyczny
obliczenia ewolucyjne
Opis:
Combinatorial optimization problems, such as travel salesman problem, are usually NPhard and the solution space of this problem is very large. Therefore the set of feasible solutions cannot be evaluated one by one. The simple genetic algorithm is one of the most used evolutionary computation algorithms, that give a good solution for TSP, however, it takes much computational time. In this paper, Affinity Propagation Clustering Technique (AP) is used to optimize the performance of the Genetic Algorithm (GA) for solving TSP. The core idea, which is clustering cities into smaller clusters and solving each cluster using GA separately, thus the access to the optimal solution will be in less computational time. Numerical experiments show that the proposed algorithm can give a good results for TSP problem more than the simple GA.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2015, 5, 4; 239-245
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Local Levenberg-Marquardt algorithm for learning feedforwad neural networks
Autorzy:
Bilski, Jarosław
Kowalczyk, Bartosz
Marchlewska, Alina
Zurada, Jacek M.
Powiązania:
https://bibliotekanauki.pl/articles/1837415.pdf
Data publikacji:
2020
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
feed-forward neural network
neural network learning algorithm
optimization problem
Levenberg-Marquardt algorithm
QR decomposition
Givens rotation
Opis:
This paper presents a local modification of the Levenberg-Marquardt algorithm (LM). First, the mathematical basics of the classic LM method are shown. The classic LM algorithm is very efficient for learning small neural networks. For bigger neural networks, whose computational complexity grows significantly, it makes this method practically inefficient. In order to overcome this limitation, local modification of the LM is introduced in this paper. The main goal of this paper is to develop a more complexity efficient modification of the LM method by using a local computation. The introduced modification has been tested on the following benchmarks: the function approximation and classification problems. The obtained results have been compared to the classic LM method performance. The paper shows that the local modification of the LM method significantly improves the algorithm’s performance for bigger networks. Several possible proposals for future works are suggested.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2020, 10, 4; 299-316
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 128

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