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

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 157
Tytuł:
On solving linear programming problems with embedded network structure
Autorzy:
Zorychta, Krystian
Powiązania:
https://bibliotekanauki.pl/articles/748505.pdf
Data publikacji:
1991
Wydawca:
Polskie Towarzystwo Matematyczne
Tematy:
Linear programming
Opis:
W pracy przedstawiony jest uniwersalny algorytm rozwiązywania zagadnień optymalnej dystrybucji w sieci transportowej, poddanej dodatkowym ograniczeniom liniowym, czyli tzw. zadań programowania liniowego z wbudowaną strukturą sieciową. Algorytm ten funkcjonuje na zasadzie pierwotnej metody sympleksowej i opiera się na dekompozycji bazy na cztery bloki. Czynnikiem decydującym o efektywności algorytmu jest sposób realizacji operacji z udziałem bloku sieciowego. Dlatego szczególny nacisk położony jest w pracy na zaprojektowaniu struktur danych uwzględniających specyfikę tego bloku i pozwalających wykorzystać ją w pełni na poziomie implementacji.
A special partitioning algorithm for solving linear programming problems with embed-ded network structure is presented. As an example of such a problem the minimum-cost network flow problem under additional linear constraints can be considered. This algorithm is a primal simplex basis partitioning method that uses special updating and labeling procedures to accelerate computations involving the network linear programming interface. These procedures are discribed in detail to develop an efficient implementation of the method.
Źródło:
Mathematica Applicanda; 1991, 19, 33
1730-2668
2299-4009
Pojawia się w:
Mathematica Applicanda
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Sensitivity analysis in piecewise linear fractional programming problem with non-degenerate optimal solution
Autorzy:
Kheirfam, B.
Powiązania:
https://bibliotekanauki.pl/articles/255257.pdf
Data publikacji:
2009
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
piecewise linear fractional programming
fractional programming
piecewise linear programming
sensitivity analysis
Opis:
In this paper, we study how changes in the coefficients of objective function and the right-hand-side vector of constraints of the piecewise linear fractional programming problems affect the non-degenerate optimal solution. We consider separate cases when changes occur in different parts of the problem and derive bounds for each perturbation, while the optimal solution is invariant. We explain that this analysis is a generalization of the sensitivity analysis for LP, LFP and PLP. Finally, the results are described by some numerical examples.
Źródło:
Opuscula Mathematica; 2009, 29, 3; 253-269
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
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ł:
Postoptimal analysis in the coefficients matrix of piecewise linear fractional programming problems with non-degenerate optimal solution
Autorzy:
Kheirfam, B.
Powiązania:
https://bibliotekanauki.pl/articles/255497.pdf
Data publikacji:
2010
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
piecewise linear fractional programming
degeneracy
optimal basis
fractional programming
piecewise linear programming
sensitivity analysis
Opis:
In this paper, we discuss how changes in the coefficients matrix of piecewise linear fractional programming problems affect the non-degenerate optimal solution. We consider separate cases when changes occur in the coefficients of the basic and non-basic variables and derive bounds for each perturbation, while the optimal solution is invariant. We explain that this analysis is a generalization of the sensitivity analysis for LP, LFP and PLP. Finally, the results are described by some numerical examples.
Źródło:
Opuscula Mathematica; 2010, 30, 3; 281-294
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A new Integer Linear Programming and Quadratically Constrained Quadratic Programming Formulation for Vertex Bisection Minimization Problem
Autorzy:
Jain, P.
Saran, G.
Srivastava, K.
Powiązania:
https://bibliotekanauki.pl/articles/384223.pdf
Data publikacji:
2016
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
Vertex Bisection Minimization
Integer Linear Programming
quadratic programming
Opis:
Vertex Bisection Minimization problem (VBMP) consists of partitioning a vertex set V of graph G = (V, E) into two sets B and B′ where ∣B∣ = [\v|/2] such that vertex width (VW) is minimized where vertex width is defined as the number of vertices in B which are adjacent to at least one vertex in B′. It is an NP-complete problem in general. VBMP has applications in fault tolerance and is related to the complexity of sending messages to processors in interconnection networks via vertex disjoint paths. In this paper, we have proposed a new integer linear programming (ILP) and quadratically constrained quadratic programming (QCQP) formulation for VBMP. Both of them require number of variables and constraints lesser than existing ILPs and QCQP. We have also implemented ILP and obtained optimal results for various classes of graphs. The result of the experiments with the benchmark graphs shows that the proposed model outperforms the state of the art. Moreover, proposed model obtains optimal result for all the benchmark graphs.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2016, 10, 1; 69-73
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
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ł:
Scheduling of Flowshop Type Production with Dannenbring Method to Obtain Optimal Results with Observing Waiting Time and Weight of Jobs
Autorzy:
Rahmani, Ulfa
Wulan, Elis Ratna
Huda, Arief Fatchul
Supian, Sudradjat
Subiyanto, Subiyanto
Powiązania:
https://bibliotekanauki.pl/articles/1062846.pdf
Data publikacji:
2019
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Linear Programming
Makespan
Weigted Mean Flow Time
Opis:
Linear programming is a step or process to get maximum results with existing resources or it can be said the process of looking for optimal value. One part of scheduling is production scheduling. production scheduling is the use of resources that are few but make the most profit. This paper discusses production scheduling using flowshop type production scheduling by taking into account transportation times and work weights. This paper uses the Dannenbring method with the aim of finding the optimal sequence of problems by considering the total production time (makespan) and the average Weigted Mean Flow Time (WMFT). Based on the results of the Dannenbring method, the results of flowshop scheduling are obtained with a total makespan of 75 hours and the WMFT value is 28, 87 hours.
Źródło:
World Scientific News; 2019, 127, 3; 212-224
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The application of the AHP-LP method to assess the significance of strategic objectives and tasks influencing the socioeconomic development of the commune
Zastosowanie metody AHP-LP do oceny ważności celów i zadań strategicznych wpływających na rozwój społeczno-gospodarczy gminy
Autorzy:
Luczak, A.
Powiązania:
https://bibliotekanauki.pl/articles/869417.pdf
Data publikacji:
2014
Wydawca:
The Polish Association of Agricultural and Agribusiness Economists
Tematy:
application
AHP-LP method zob.analytic hierarchy process-linear programming
analytic hierarchy process-linear programming
socioeconomic development
commune
Opis:
The aim of the study was to present the possibility of applying the AHP-LP method to assess the significance of strategic factors (strategic goals and tasks) influencing the socioeconomic development of the commune. The Commune of Chrzypsko Wielkie in the Wielkopolskie Voivodeship was used to illustrate the suggested approach. The study was based on the data from questionnaire surveys conducted among the councillors of the Commune of Chrzypsko Wielkie in 2012. The empirical studies proved the usefulness of the AHP-LP for assessment of the significance of strategic factors. The method enabled quantification of the significance of individual strategic factors. The most important aims in the Commune of Chrzypsko Wielkie include improvement of technical infrastructure, followed by development of the economy. The reduction of unemployment and modernisation of agriculture were the most important tasks. The suggested approach may be used in the process of making development strategies of administrative units.
Celem badań było przedstawienie możliwości zastosowania AHP-LP do oceny ważności czynników strategicznych (celów strategicznych i zadań) w gminie, na przykładzie gminy Chrzypsko Wielkie w województwie wielkopolskim. W badaniach wykorzystano dane z badań ankietowych przeprowadzonych wśród radnych tej gminy w 2013 roku. Przeprowadzone badania empiryczne potwierdziły przydatność AHP-LP do oceny ważności czynników strategicznych. Metoda ta pozwoliła na skwantyfikowanie ważności poszczególnych czynników strategicznych. Do najważniejszych celów w gminie Chrzypsko Wielkie zaliczyć należy poprawę infrastruktury technicznej i gospodarkę. Wśród zadań najważniejsze były: zmniejszenie bezrobocia i modernizacja rolnictwa. Metoda ta jest użyteczna w planowaniu rozwoju.
Źródło:
Roczniki Naukowe Stowarzyszenia Ekonomistów Rolnictwa i Agrobiznesu; 2014, 16, 2
1508-3535
2450-7296
Pojawia się w:
Roczniki Naukowe Stowarzyszenia Ekonomistów Rolnictwa i Agrobiznesu
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ł:
MOLPTOL – a software package for sensitivity analysis in MOLP
Autorzy:
Sitarz, Sebastian
Botor, Krzysztof
Powiązania:
https://bibliotekanauki.pl/articles/2027992.pdf
Data publikacji:
2021
Wydawca:
Uniwersytet Ekonomiczny w Katowicach
Tematy:
Computer software
Multi-objective linear programming
Sensitivity analysis
Opis:
The paper introduces a new software package, MOLPTOL, for sensitivity analysis in multi-objective linear programming. In this application, which is available for free of charge on the web page (https:// sites.google.com/view/molptol), the tolerance approach as a measure of sensitivity is used. The motivation for creating MOLPTOL is the lack of such tools to date. MOLPTOL is novel for multi-criteria decision-making methods based on sensitivity analysis. The paper presents some new computational methods for obtaining the supremal tolerances as well.
Źródło:
Multiple Criteria Decision Making; 2021, 16; 140-152
2084-1531
Pojawia się w:
Multiple Criteria Decision Making
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Support in multi-criteria decision-making under uncertainty in a transport company
Autorzy:
Banaś, J.
Tomaszewska, K.
Powiązania:
https://bibliotekanauki.pl/articles/406494.pdf
Data publikacji:
2013
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
transportation problem
fuzzy linear programming
L-R notation
Opis:
The problem of finding an appropriate transportation plan for a transport company collaborating with a window manufacturer to reduce transport costs by minimizing the total distance travelled and to provide a minimum car fleet has been presented. The problem involves 3 major manufacturing bases and 15 local storehouses located in all the remaining Polish provincial capitals. Taking into account the fact that some of the parameters of the model may not be accurate due to uncertainty, fuzzy coefficients are used. Using this fuzzy model, optimistic, semi-pessimistic and pessimistic approaches are considered.
Źródło:
Operations Research and Decisions; 2013, 23, 2; 11-23
2081-8858
2391-6060
Pojawia się w:
Operations Research and Decisions
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The domination over time and its discretisation
Autorzy:
Abbasnezhad, Nazanin
Mehri-Takmeh, Javad
Vakili, Javad
Powiązania:
https://bibliotekanauki.pl/articles/406615.pdf
Data publikacji:
2020
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
domination over time
continuous linear programming
duality
discretisation
Opis:
Domination in graphs is well known and has been an extensively researched branch of graph theory. Since the variation over time is one of the important properties of real-world networks, we study the influence of time on the domination problem. In this paper, we introduce the domination over time problem, including time delay on arcs. Then, an optimal solution to its discretisation is obtained, which is the solution of the original problem.
Źródło:
Operations Research and Decisions; 2020, 30, 1; 5-24
2081-8858
2391-6060
Pojawia się w:
Operations Research and Decisions
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Extended model formulation of the Proportional Lot-sizing and Scheduling Problem with lost demand costs
Autorzy:
Kaczmarczyk, W.
Powiązania:
https://bibliotekanauki.pl/articles/375882.pdf
Data publikacji:
2011
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
production
lot-sizing
scheduling
mixed integer linear programming
Opis:
We consider mixed-integer linear programming (MIP) models of production planning problems known as the small bucket lot-sizing and scheduling problems. We present an application of a class of valid inequalities to the case with lost demand (stock-out) costs. Presented results of numerical experiments made for the the Proportional Lot-sizing and Scheduling Problem (PLSP) confirm benefits of such extended model formulation.
Źródło:
Decision Making in Manufacturing and Services; 2011, 5, 1-2; 49-56
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Approximating the solution of a dynamic, stochastic multiple knapsack problem
Autorzy:
Hartman, J. C.
Perry, T. C.
Powiązania:
https://bibliotekanauki.pl/articles/970874.pdf
Data publikacji:
2006
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
programowanie liniowe
dualność
stochastic dynamic programming
approximate dynamic programming
linear programming
duality
Opis:
We model an environment where orders arrive probabilistically over time, with their revenues and capacity requirements becoming known upon arrival. The decision is whether to accept an order, receiving a reward and reserving capacity, or reject an order, freeing capacity for possible future arrivals. We model the dynamic, stochastic multiple knapsack problem (DSMKP) with stochastic dynamic programming (SDP). Multiple knapsacks are used as orders may stay in the system for multiple periods. As the state space grows exponentially in the number of knapsacks and the number of possible orders per period, we utilize linear programming and duality to quickly approximate the end-of-horizon values for the SDP. This helps mitigate end-of-study effects when solving the SDP directly, allowing for the solution of larger problems and leading to increased quality in solutions.
Źródło:
Control and Cybernetics; 2006, 35, 3; 535-550
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 157

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