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

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 90
Tytuł:
Numerical checking method for positive invariance of polyhedral sets for linear dynamical systems
Autorzy:
Yang, H.
Hu, Y.
Powiązania:
https://bibliotekanauki.pl/articles/200512.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
positively invariant sets
linear system
polyhedral set
polyhedral cone
linear programming
Opis:
Positively invariant sets play an important role in the theory and applications of dynamical systems. The stability in Lyapunov sense of equilibrium x = 0 is equivalent to the existence of the ellipsoidal positively invariant sets. The constraints on the state and control vectors of dynamical systems can be formulated as polyhedral positively invariant sets in practical engineering problems. Numerical checking method of positive invariance of polyhedral sets is addressed in this paper. The validation of the positively invariant sets can be done by solving LPs which can be easily implemented numerically. The effectiveness of the proposed checking method is illustrated by examples. Compared with the now existing algebraic methods, numerical checking method is attractive and, importantly, easy to be implemented.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2020, 68, 3; 593-599
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An output sensitivity problem for a class of linear distributed systems with uncertain initial state
Autorzy:
Larrache, Abdelilah
Lhous, Mustapha
Rhila, Soukina Ben
Rachik, Mostafa
Tridane, Abdessamad
Powiązania:
https://bibliotekanauki.pl/articles/229238.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
linear system
distributed system
uncertain initial state
gain operators
observability
stability
linear programming
Opis:
In this paper,we consider an infinite dimensional linear systems. It is assumed that the initial state of system is not known throughout all the domain Ω C Rn, the initial state x0 ϵ L2(Ω) is supposed known on one part of the domain Ω and uncertain on the rest. That means Ω = ω1 U ω2 U... U ωt with ωi ∩ ωj = ∅, ∀i ≠ j ϵ {1,...,t}, i ≠ j where ωi ≠ ∅ and x0(θ) = αi for θ ϵ ωi, ∀i, i.e., x0(θ) = [wzór] (θ) where the values α1,...,αr are supposed known and αr+1,...,αt unknown and 1ωi is the indicator function. The uncertain part (α1,...,(α)rof the initial state x0 is said to be (ɛ1,...,ɛr )-admissible if the sensitivity of corresponding output signal (yi)i≥0 relatively to uncertainties (αk)1≤k≤r is less to the treshold ɛk, i.e., ∥∂yi)/(∂αk∥ ≤ ɛk, ∀i≥ 0, ∀k ϵ {1,...,r]. The main goal of this paper is to determine the set of all possible gain operators that makes the system insensitive to all uncertainties. The characterization of this set is investigated and an algorithmic determination of each gain operators is presented. Some examples are given.
Źródło:
Archives of Control Sciences; 2020, 30, 1; 139-155
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A locally polynomial method for solving a system of linear inequalities
Autorzy:
Evtushenko, Yuri
Szkatuła, Krzysztof
Tretyakov, Alexey
Powiązania:
https://bibliotekanauki.pl/articles/2183463.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
linear programming
system of linear inequalities
computational complexity
locally-polynomial algorithm
convergence rate
Opis:
The paper proposes a method for solving systems of linear inequalities. This method determines in a finite number of iterations whether the given system of linear ineqalities has a solution. If it does, the solution for the given system of linear inequalities is provided. The computational complexity of the proposed method is locally polynomial.
Źródło:
Control and Cybernetics; 2021, 50, 2; 301--314
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The application of linear programming for the optimal profit of PT. Naruna using the simplex method
Autorzy:
Syifa, Eka Auliya
Istiqomah, Tita Nuril
Puspita, Nikken Prima
Ratnasari, Lucia
Khabibah, Siti
Anggoro, Paulus Wisnu
Bawono, Baju
Powiązania:
https://bibliotekanauki.pl/articles/27315571.pdf
Data publikacji:
2023
Wydawca:
STE GROUP
Tematy:
optimation
profit
simplex method
linear programming
Opis:
PT. Naruna is a ceramics factory located in Salatiga, Indonesia. In PT. Naruna ceramics, all products are handmade with contemporary designs and have a high artistic value in shape and color. Getting profit is the company's primary goal, but many companies still need to learn the maximum profit that can be obtained by optimizing their resources, one of which is PT. Naruna. PT. Naruna produces goods based on intuition. As a result, a lot of goods are piled up in warehouses. Meanwhile, with the development of the times, new trends and images will appear more attractive so that consumer tastes and motifs from ceramics will change. In addition, ceramic products that have gone through the combustion process cannot be recycled and must be burned. This research focuses on the production of glasses with three different types according to price. The aim of this paper is to optimize profits by determining the composition of the number of products produced. We used linear programming with a simplex method to solve our problem in PT. Naruna. Linear programming is the most appropriate method for solving problems that exist in PT. Naruna, namely by paying attention to the objective and constraint functions. The objective function is to maximize profit, so it takes the form of a linear equation with the variable X1 being the first type of glass, X2 being the second type of glass, and X3 being the third type of glass. The constraint functions used include the number of products, the number of workers, the amount of clay, and the time for production. The results show that PT. Naruna can achieve maximum profit when producing glass type 1 less than type 3 less than type 2.
Źródło:
Management Systems in Production Engineering; 2023, 2 (31); 138--143
2299-0461
Pojawia się w:
Management Systems in Production Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A remark on sensitivity in linear programming and Gale-Samuelson nonsubstitution theorem
Autorzy:
De Giuli, M. E.
Giorgi, G.
Powiązania:
https://bibliotekanauki.pl/articles/969906.pdf
Data publikacji:
2010
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
linear programming
sensitivity analysis
nonsubstitution theorem
Opis:
The main purpose of this paper is to show that David Gale's result (1960, Lemma 9.3 on sensitivity in linear programming) is not generally valid. In this lemma, additional assumptions, that are instead required, are not made. We give some correct versions of the above mentioned lemma, and with these an elementary proof of the Gale-Samuelson nonsubstitution theorem.
Źródło:
Control and Cybernetics; 2010, 39, 3; 827-838
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Deployment of a predictive-like optimal control law on a servo drive system using linear programming approach
Autorzy:
Horla, Dariusz
Pinczewski, Piotr
Powiązania:
https://bibliotekanauki.pl/articles/27309954.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czasopisma i Monografie PAN
Tematy:
constraints
linear programming
optimal control
servo drive
Opis:
Current drive control systems tend to push control loops to the limits of their performance. One of the ways of doing so is to use advanced optimization algorithms, usually related to model-based off-line calculations, such as genetic algorithms, the particle swarmoptimisation or the others. There is, however, a simpler way, namely to use predictive control formalism and by formulation of a simple linear programming problem which is easy to solve using powerful solvers, without excessive computational burden, what is a reliable solution, as whenever the optimization problem has a feasible solution, a global minimizer can be efficiently found. This approach has been deployed for a servo drive system operated by a real-time sampled-data controller, verified between model-in-the-loop and hardwarein- the-loop configurations, for a range of prediction horizons, as an attractive alternative to classical quadratic programming-related formulation of predictive control task.
Źródło:
Archives of Electrical Engineering; 2023, 72, 4; 1005--1016
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Cost optimization and risk minimization during teamwork organization
Autorzy:
Krynke, Marek
Mielczarek, Krzysztof
Kiriliuk, Olga
Powiązania:
https://bibliotekanauki.pl/articles/1537467.pdf
Data publikacji:
2021
Wydawca:
STE GROUP
Tematy:
work organization
multi-station work
risk management
linear programming
Opis:
In the paper the problem of personnel allocation under threat was presented. The possibilities of undertaking optimization measures in the process of workers’ health and safety and expenses incurred were emphasized. A mathematical model for this issue has been formulated. An algorithm solving the problem of staff allocation was presented. The evaluation criterion for this assignment was the minimization of worker safety risks. Simultaneous optimization of expenses incurred in the implementation of production tasks was taken into account. The productivity of the staff and all existing jobs with the skills of the employees also was considered. This problem was solved using GNU Octave. The example presented in the paper shows that in case of the most unfavorable allocation of tasks to employees, it will lead to a significant reduction in profits and may increase the risk of undesirable situations. The proposed analysis is the starting point for determining the risk in case of multi-position work.
Źródło:
Management Systems in Production Engineering; 2021, 2 (29); 145-150
2299-0461
Pojawia się w:
Management Systems in Production Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A relaxation heuristic for scheduling flowshops with intermediate buffers
Autorzy:
Magiera, M.
Powiązania:
https://bibliotekanauki.pl/articles/200698.pdf
Data publikacji:
2013
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
scheduling
heuristic
linear programming
production planning
decision making
flowshop
Opis:
The paper presents a two-level relaxation heuristic for production planning for multistage flowshop systems with intermediate buffers. The method concerns unidirectional multistage systems where tasks with respect to many various types of products are performed simultaneously. The fixed and the alternative production routes are regarded in the method. The top-level is a stage loading, i.e., allocation of tasks among the stages. The base-level is a task scheduling - allocation of tasks among the stations. The linear mathematical models of mixed integer programming are used in the method. The time criterion is used in the minimization functions - the minimal schedule is fixed. The condition that variables are to be integers has been ignored in the heuristic. The relaxed heuristic developed in such a manner enables obtaining good results in a very short time. This paper discusses the multilevel approach as the developed production scheduling method serves the purpose of solving relatively large problems. Results of computational experiments with the proposed heuristic method are presented.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2013, 61, 4; 929-942
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Selected problems concerning strength of a floating dock with roof
Autorzy:
Bogdaniuk, M.
Górecki, Z.
Puch, W.
Powiązania:
https://bibliotekanauki.pl/articles/260313.pdf
Data publikacji:
2005
Wydawca:
Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
Tematy:
floatin dock structure and strength
FEM computations
linear programming
Opis:
The paper presents models and results of the structural strength analysis of a roofed floating dock. Computed thickness of the roof structure walls capable of withstanding the environmental loads is 24 mm. Heavy sliding roof segments generate the dock pontoon floor plate stresses reaching 25% of the permissible stress value. The dock pontoon structure effort under the roof and docked ship weight load was minimized by seeking an optimum balancing ballast distribution. The problem was solved in two ways: analytically, by means of a simplified model of a continuous beam on elastic foundation and numerically, using the linear programming method to construct an accurate discrete FEM model.
Źródło:
Polish Maritime Research; 2005, S 1; 51-55
1233-2585
Pojawia się w:
Polish Maritime Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Overlay Multicast Optimization : IBM ILOG CPLEX
Autorzy:
Kucharzak, M.
Zydek, D.
Poźniak-Koszałka, I.
Powiązania:
https://bibliotekanauki.pl/articles/226362.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
overlay multicast
maximum flows
linear programming
mixed-integer programming
Opis:
IBM ILOG CPLEX Optimization Studio delivers advanced and complex optimization libraries that solve linear programming (LP) and related problems, e.g., mixed integer. Moreover, the optimization tool provides users with its Academic Research Edition, which is available for teaching and noncommercial research at no-charge. This paper describes the usage of CPLEX C++ API for solving linear problems and, as an exhaustive example, optimization of network flows in overlay multicast is taken into account. Applying continuous and integral variables and implementing various constraints, including equations and inequalities, as well as setting some global parameters of the solver are presented and widely explained.
Źródło:
International Journal of Electronics and Telecommunications; 2012, 58, 4; 381-388
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The use of rank and optimisation methods in strategic management in higher education
Autorzy:
Ryńca, Radosław
Piórkowska, Natalia
Powiązania:
https://bibliotekanauki.pl/articles/2204101.pdf
Data publikacji:
2023
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
higher education institution
strategic management
strategy implementation
linear programming
Opis:
The article presents proposals for a university management model supporting the process of strategic management at a university. The proposed model is based on the use of multi-criteria methods such as the 0–10 technique, object ranking, and optimisation methods – linear programming. The proposed solution integrates ranking and optimisation methods, the use of which may be helpful in the hands of managers in making management decisions. The proposed approach may also be helpful in developing a strategic scorecard, especially in the stage of formulating goals. It also enables the optimal selection of goals with the existing time constraints for the implementation of the strategy. The article presents a proposal for the use of the strategy implementation model and an example of its use. The strengths and weaknesses of the model were also indicated.
Źródło:
Operations Research and Decisions; 2023, 33, 1; 93--111
2081-8858
2391-6060
Pojawia się w:
Operations Research and Decisions
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Observer synthesis for linear discrete-time systems with different fractional orders
Synteza obserwatora układów dyskretnych o różnych niecałkowitych rzędach
Autorzy:
Kociszewski, R.
Powiązania:
https://bibliotekanauki.pl/articles/276524.pdf
Data publikacji:
2013
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
rząd niecałkowity
układ
dodatni
dyskretny
obserwator
programowanie liniowe
liniowa nierówność macierzowa
fractional
positive
discrete-time
system
observer
linear programming
linear matrix inequality
Opis:
The paper is devoted to observer synthesis for linear discrete-time positive fractional systems with different fractional orders. The problem of finding a nonnegative gain matrix of the observer such that the observer is positive and asymptotically stable is formulated and solved by the use of linear programming (LP) and linear matrix inequality (LMI) methods. The proposed approach to the observer synthesis is illustrated by theoretical example. Numerical calculations and simulations have been performed in the MATLAB/Simulink program environment.
W pracy rozpatrzono problem syntezy obserwatorów dla dodatnich układów dyskretnych różnych niecałkowitych rzędów w równaniu stanu. Wykorzystując podejście oparte na typowym zadaniu programowania liniowego (LP) oraz zadaniu sformułowanym w ramach liniowych nierówności macierzowych (LMI) pokazano, że jest możliwe uzyskanie dodatniego asymptotycznie stabilnego obserwatora. Są to warunki dostateczne, alternatywne w stosunku do podanych w [5, 18] dla układów niedodatnich. Zaprojektowany obserwator poprawnie estymuje (odtwarza) zmienne stanu przyjętego do rozważań dyskretnego układu niecałkowitego rzędu. Wyniki obliczeniowe uzyskano w środowisku programowym MATLAB z wykorzystaniem biblioteki Optimization oraz pakietów SeDuMi i YALMIP. Rezultaty symulacyjne uzyskano przy wykorzystaniu dodatkowej biblioteki Fractional States Space Toolkit.
Źródło:
Pomiary Automatyka Robotyka; 2013, 17, 2; 376-381
1427-9126
Pojawia się w:
Pomiary Automatyka Robotyka
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Linear programming models for optimal workload and batching in pick-and-pass warehousing systems
Autorzy:
Tarczyński, Grzegorz
Powiązania:
https://bibliotekanauki.pl/articles/27315330.pdf
Data publikacji:
2023
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
linear programming
order picking
optimal storage
pick-and-pass system
Opis:
Pick-and-pass systems are a part of picker-to-parts order-picking systems and constitute a very common storage solution in cases where customer orders are usually small and need to be completed very quickly. As workers pick items in the zones connected by conveyors, their work needs to be coordinated. The paper presents MILP models that optimize the order-picking process. The first model uses information about the expected demand for items to solve the storage location problem and balance the workload across zones. The task of the next model is order-batching and sequencing – two concepts are presented that meet different assumptions. The results of the exemplary tasks solved with the use of the proposed MILP models show that the total picking time of a set of orders can be reduced by about 35-45% in comparison with random policies. The paper presents an equation for the lower bound of a makespan. Recommendations about the number of zones that guarantee the required system efficiency are also introduced.
Źródło:
Operations Research and Decisions; 2023, 33, 3; 141--158
2081-8858
2391-6060
Pojawia się w:
Operations Research and Decisions
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Decision problem for a finite states change of semi-Markov process
Autorzy:
Grabski, F.
Powiązania:
https://bibliotekanauki.pl/articles/2069327.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Morski w Gdyni. Polskie Towarzystwo Bezpieczeństwa i Niezawodności
Tematy:
reliability
semi-Markov decision processes
optimization
Howard algorithm
linear programming
Opis:
In the paper there are presented basic concepts and some results of the theory of semi-Markov decision processes. The algorithm of optimization a SM decision process with a finite number of state changes is discussed here. The algorithm is based on a dynamic programming method. To clarify it the SM decision model for the maintenance operation is shown.
Źródło:
Journal of Polish Safety and Reliability Association; 2015, 6, 1; 95--100
2084-5316
Pojawia się w:
Journal of Polish Safety and Reliability Association
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Planowanie przydziału autobusów do linii w aspekcie minimalizacji zużycia paliwa na przykładzie MPK w Ostrowcu Świętokrzyskim
Planning the allocation of the buses to the lines in terms of minimizing fuel consumption based on the example of MPK Ostrowiec Świętokrzyski
Autorzy:
Oziomek, J.
Rogowski, A.
Powiązania:
https://bibliotekanauki.pl/articles/251116.pdf
Data publikacji:
2015
Wydawca:
Instytut Naukowo-Wydawniczy TTS
Tematy:
programowanie liniowe
transport miejski
optymalizacja
linear programming
urban transport
optimization
Opis:
W artykule zaprezentowane zostały praktyczne możliwości wykorzystania metod programowania liniowego w transporcie miejskim. Przedmiotem rozważań stał się taki przydział autobusów do linii, który zapewni możliwie najmniejsze zużycie paliwa, a co za tym idzie przyczyni się do zmniejszenia kosztów prowadzenia działalności. Ma to bowiem szczególne znaczenie w sytuacji, gdy gminny przewoźnik realizuje część przewozów na zasadach komercyjnych. Przydział do autobusów nie może być dowolny. Należy uwzględnić szereg warunków ograniczających, tzn. z jednej strony rozmiary pracy przewozowej, a z drugiej różnorodność i ograniczoną liczbę wozów w parku taborowym.
The paper presents practical possibilities of using linear programming methods in urban transport. The problem was such allocation of the buses to the lines that assures the lowest possible fuel consumption and thus contributes to reducing the costs of doing business. This is especially important when the public carriers realise the part of transport on a commercial basis. The allocation of the buses cannot be arbitrary. The conditions should be considered, i.e. the size of the transport activity and diversity and limited number of the buses.
Źródło:
TTS Technika Transportu Szynowego; 2015, 12; 1175-1179, CD
1232-3829
2543-5728
Pojawia się w:
TTS Technika Transportu Szynowego
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 90

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