Temat: mathematical programming

Skocz do pozycji: 1.

Tytuł:: "On the Shoulders of Giants" A brief excursion into the history of mathematical programming
Autorzy:: Tichatschke, Rainer
Tematy:: history
mathematical programming; Pokaż więcej
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Powiązania:: https://bibliotekanauki.pl/articles/729300.pdf Link otwiera się w nowym oknie
Opis:: Similar to many mathematical fields also the topic of mathematical programming has its origin in applied problems. But, in contrast to other branches of mathematics, we don't have to dig too deeply into the past centuries to find their roots. The historical tree of mathematical programming, starting from its conceptual roots to its present shape, is remarkably short, and to quote Isaak Newton, we can say:
"We are standing on the shoulders of giants".
The goal of this paper is to describe briefly the historical growth of mathematical programming from its beginnings to the seventies of the last century and to review its basic ideas for a broad audience. During this process we will demonstrate that optimization is a natural way of thinking which follows some extremal principles.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 2.

Tytuł:: Optimal algorithms for seeking the minimum
Autorzy:: Adamski, A.
Korytowski, A.
Mitkowski, W.
Tematy:: Mathematical programming methods, Numerical analysis, Mathematical programming, optimization and variational techniques; Pokaż więcej
Wydawca:: Polskie Towarzystwo Matematyczne
Powiązania:: https://bibliotekanauki.pl/articles/747469.pdf Link otwiera się w nowym oknie
Opis:: .
The definition of the optimality of an algorithm is modified so that the optimal algorithm satisfies Bellman's principle. The search for a minimum using this technique is compared with J. Kiefer's algorithm
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 3.

Tytuł:: Stochastic algorithms in discrete optimization with noisy values for the function
Autorzy:: Wieczorkowski, Robert
Tematy:: Stochastic programming
Mathematical programming methods
Integer programming; Pokaż więcej
Wydawca:: Polskie Towarzystwo Matematyczne
Powiązania:: https://bibliotekanauki.pl/articles/747459.pdf Link otwiera się w nowym oknie
Opis:: .
The paper deals with stochastic methods for searching approximately global minimum of function defined on discrete set. A measure of quality of solution is defined to compare different algorithms. Simple Monte Carlo method is analysed as main algorithm for which formulas dealing with the measure of quality are derived(two cases: exact values and noisy values of function). This Monte Carlo method is used as a base in simulation experiments for comparing other stochastic algorithms. The second part of the paper analyses asymptotic properties of the generalised simulated annealing algorithms. Theory of Markov chains is used in modelling this class of algorithms. Theorems about convergence of the records of algorithms to set of optima with probability one are presented in the case of function having random noisy values. The paper also reviews known results in the field of simulated annealing type algorithms for function with randomly perturbated values.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 4.

Tytuł:: On estimation of parameter functions in a weakly singular linear model with linear inequality restrictions
Autorzy:: Kłaczyński, Krzysztof
Tematy:: Linear regression
Applications of mathematical programming; Pokaż więcej
Wydawca:: Polskie Towarzystwo Matematyczne
Powiązania:: https://bibliotekanauki.pl/articles/748076.pdf Link otwiera się w nowym oknie
Opis:: .
In this paper, the problem of ICGLS (Inequality Constrained Generalized Least Squares) estimation of a given set function K in the weakly singular model M={y, X| A > b, ^2V} is considered. The ICGLS estimator is not linear and it is expressed in a form of at most of 2^m formulae, where m denotes a number of rows in the matrix A. For a given vector y the one of these formulae can be used. On the basis of the Kuhn-Tucker optimality conditions, necessary and sufficient conditions for a vector Kβ^t to be the ICGLS estimator of Kβ are presented. The estimators are given in explicit form.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 5.

Tytuł:: Python programming language as a tool for creating three-dimensional figures of glider aerobatics
Autorzy:: Linka, A.
Wróblewska, A.
Tematy:: aerobatics
general aviation
fly trajectory
mathematical programming; Pokaż więcej
Wydawca:: Instytut Techniczny Wojsk Lotniczych
Powiązania:: https://bibliotekanauki.pl/articles/241817.pdf Link otwiera się w nowym oknie
Opis:: The article presents the possibilities and validity of the implementation in the field of developing mathematical models for aerobatics trajectory. Proposing a catalogue of three-dimensional figures and those described mathematically will allow improving judging and scoring level, as well as the art of piloting in aerobatics. In the first chapter, article describes the processes of aerobatic flight, judge evaluation method and the current state of technology supporting the scoring process. The second chapter presents the capabilities of the Python programming language, which will be a tool for the construction of three-dimensional models. The third chapter of this article is a description of the comparative analysis of ideal trajectories and obtained in real flight. This chapter also demonstrates the validity and necessity of introducing new standards for assessing aerobatic flights. Aerobatics flights and judging, intelligent system to control aerobatic flights, three-dimensional models of aerobatic flights are presented in the article. The article concerns on use modern technologies to support the judges during the competition. The introduction of ASSD + PL system and the possibility of implementing designed models of aerobatic figures open new paths for improving the art of pilotage and arbitration.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 6.

Tytuł:: A Method to Improve Planning of Product Placement on a Printing Sheet
Autorzy:: Czerniachowska, Kateryna
Żywicki, Krzysztof
Wichniarek, Radosław
Tematy:: manufacturing operation
production planning
optimization
mathematical programming; Pokaż więcej
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Powiązania:: https://bibliotekanauki.pl/articles/1841430.pdf Link otwiera się w nowym oknie
Opis:: Major manufactures are moving towards a sustainability goal. This paper introduces the results of collaboration with the leading company in the packaging and advertising industry in Germany and Poland. The problem addresses the manufacturing planning problem in terms of minimizing the total cost of production. The challenge was to bring a new production planning method into cardboard manufacturing and paper processing which minimizes waste, improves the return of expenses, and automates daily processes heavily dependent on the production planners’ experience. The authors developed a module that minimizes the total cost, which reduces the overproduction and is used by the company’s manufacturing planning team. The proposed approach incorporates planning allowances rules to compromise the manufacturing requirements and production cost minimization.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 7.

Tytuł:: A mathematical programming method for the topology optimization of a truss-like continuum
Autorzy:: Cui, Hao
Zhou, Kemin
Tematy:: topology optimization
mathematical programming method
truss-like continuum; Pokaż więcej
Wydawca:: Polskie Towarzystwo Mechaniki Teoretycznej i Stosowanej
Powiązania:: https://bibliotekanauki.pl/articles/280187.pdf Link otwiera się w nowym oknie
Opis:: A mathematical programming method to optimize the distribution field of a truss-like material is presented. The densities and angles of members are optimized in two separate procedures in each iteration. An explicit sub-problem in a variable separation form is established at every iteration procedure. At each sub-problem, the stress constraint function is expanded into a trigonometric series of the member angles. According to the extreme condition, the optimal orientations of members are determined. The member densities are optimized using the method of moving asymptotes (MMA). Two examples demonstrate that the optimal truss-like structures are very close to analytic solutions.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 8.

Tytuł:: An optimal assignment procedure for multiple online surveys
Autorzy:: Kamiński, B.
Kozakiewicz, M.
Jakuczun, W.
Półtorak, M.
Tematy:: mathematical programming
optimal allocation problem
online survey management; Pokaż więcej
Wydawca:: Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Powiązania:: https://bibliotekanauki.pl/articles/406623.pdf Link otwiera się w nowym oknie
Opis:: The problem of optimal assignment of respondents to internet surveys has been considered. The task is taken from a leading online research company in Central and Eastern Europe, which runs several dozen surveys in parallel. Each survey is assigned a target number of responses to be collected and unique selection criteria for choosing respondents based on their socio-demographic data. A mathematical programming model has been proposed that enables us to find an optimal mechanism for assigning respondents to surveys so as to minimize the required total number of invitations to surveys issued. A side effect of the assignment procedure is that the samples obtained are not representative of the population under survey. Therefore, a sample weighting scheme has been developed that takes this fact into account and allows us to obtain unbiased estimators of the characteristics of the population surveyed.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 9.

Tytuł:: On the strong metric subregularity in mathematical programming
Autorzy:: Osmolovskii, Nikolai P.
Veliov, Vladimir M.
Tematy:: optimization
mathematical programming
Karush-Kuhn-Tucker conditions
metric regularity; Pokaż więcej
Wydawca:: Polska Akademia Nauk. Instytut Badań Systemowych PAN
Powiązania:: https://bibliotekanauki.pl/articles/2183475.pdf Link otwiera się w nowym oknie
Opis:: This note presents sufficient conditions for the property of strong metric subregularity (SMSr) of the system of first order optimality conditions for a mathematical programming problem in a Banach space (the Karush-Kuhn-Tucker conditions). The constraints of the problem consist of equations in a Banach space setting and a finite number of inequalities. The conditions, under which SMSr is proven, assume that the data are twice continuously Fréchet differentiable, the strict Mangasarian-Fromovitz constraint qualification is satisfied, and the second-order sufficient optimality condition holds. The obtained result extends the one known for finite-dimensional problems. Although the applicability of the result is limited to the Banach space setting (due to the twice Fréchet differentiability assumptions and the finite number of inequality constraints), the paper can be valuable due to the self-contained exposition, and provides a ground for extensions. One possible extension was recently implemented in Osmolovskii and Veliov (2021).
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 10.

Tytuł:: Matheuristics for the Order-picking Problem with Sequence-dependant Constraints in a Logistic Center with a One-directional Conveyor Between Buffers
Autorzy:: Czerniachowska, Kateryna
Wichniarek, Radosław
Żywicki, Krzysztof
Tematy:: order picking
mathematical programming
matheuristics
logistics center
distribution center; Pokaż więcej
Wydawca:: Polska Akademia Nauk. Czasopisma i Monografie PAN
Powiązania:: https://bibliotekanauki.pl/articles/59112221.pdf Link otwiera się w nowym oknie
Opis:: In the logistics center (warehouse or distribution center), customer orders need to be picked up by the pickers. In this research, we examine the order-picking problem with sequencedependent constraints with two decision variables (container start time and product quantity) in a distribution center with a one-directional conveyor. The decision-making is based on the developed two variations of two-step matheuristics. At first, the main order-picking problem is divided into two subproblems. Next, each step of each variant of the subproblem is solved using a mathematical programming-based technique. Both matheuristics were better in 85 of 120 test instances compared to the initial model solved by mathematical programming. Pickers matheuristics were better on average at 46.56%, while Buffers matheuristics were better on average at 46.87%. The proposed matheuristics approach allows distributors to schedule orders in the logistics center fast enough and with fewer resources.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 11.

Tytuł:: Optymalny zrandomizowany test na skończonym rynku zupełnym
Optimal Randomized Test in the Finite Complete Market
Autorzy:: Utkin, Joanna
Tematy:: Optymalizacja matematyczna
Programowanie matematyczne
Rynek kapitałowy
Capital market
Mathematical optimization
Mathematical programming; Pokaż więcej
Wydawca:: Uniwersytet Ekonomiczny w Katowicach
Powiązania:: https://bibliotekanauki.pl/articles/588323.pdf Link otwiera się w nowym oknie
Opis:: We deal with the finite complete arbitrage free financial market model. There are given a liability ( as selling an european option) and an initial amount lower than the initial value of the liability. The quantile hedging is based upon the generalized Neyman- Pearson lemma, but this approach don't give all information on the optimal solution in the considered case. In the present paper the optimal randomized test is analysed with some methods of the mathematical programming. It is showed that the minimal generalized density of probabilities equals the needed lower quantil. Moreover we construct the optimal solutions set. It is the basis to formulate the sufficient condition of the classical quantile hedging.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 12.

Tytuł:: Algebraization of the fundamentals of the theory of accounting systems
Autorzy:: Ginalska, Stefania
Tematy:: Operations research, mathematical programming
Operations research and management science; Pokaż więcej
Wydawca:: Polskie Towarzystwo Matematyczne
Powiązania:: https://bibliotekanauki.pl/articles/747930.pdf Link otwiera się w nowym oknie
Opis:: Praca poświęcona jest omówieniu pewnego ujęcia podstaw teorii systemu kont, wywodzi się z uprawianej przede wszystkim przez T. Pechego i W. Brzezina teorii modeli ewidencyjnych oraz czerpie terminologię (w większej części) z rachunkowości i z myślą o zastosowaniach konstruowanego ujęcia jest napisana.
The article contains no abstract
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 13.

Tytuł:: Optimization programming tools supporting supply chain management
Autorzy:: Szkutnik-Rogoż, Joanna
Małachowski, Jerzy
Tematy:: mathematical programming
optimization
supply chain
programowanie matematyczne
optymalizacja
łańcuch dostaw; Pokaż więcej
Wydawca:: Polska Akademia Nauk. Czasopisma i Monografie PAN
Powiązania:: https://bibliotekanauki.pl/articles/27311443.pdf Link otwiera się w nowym oknie
Opis:: The issue of transportation is a particular type of mathematical programming that facilitates searching for and determining an optimal distribution network, considering the set of suppliers and recipients. This paper uses a numerical example to present a solution to a transport problem utilizing classical computation methods, i.e., the northwest corner, the least cost in a matrix, and the VAM approximation method. The objective of the paper was to develop tools in the form of algorithms that would then be implemented in three various computing environments (R, GNU Octave, and Matlab) that allow us to optimize transport costs within an assumed supply network. The model involved determining decision variables and indicating limiting conditions. Furthermore, the authors interpreted and visualized the obtained results. The implementation of the proposed solution enables users to determine an optimal transport plan for individually defined criteria.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 14.

Tytuł:: Fireworks Algorithm for Unconstrained Function Optimization Problems
Autorzy:: Baidoo, E.
Tematy:: Fireworks algorithm
Function optimization
swarm intelligence
Mathematical programming
Natural computing; Pokaż więcej
Wydawca:: Polskie Towarzystwo Promocji Wiedzy
Powiązania:: https://bibliotekanauki.pl/articles/117784.pdf Link otwiera się w nowym oknie
Opis:: Modern real world science and engineering problems can be classified as multi-objective optimisation problems which demand for expedient and efficient stochastic algorithms to respond to the optimization needs. This paper presents an object-oriented software application that implements a firework optimization algorithm for function optimization problems. The algorithm, a kind of parallel diffuse optimization algorithm is based on the explosive phenomenon of fireworks. The algorithm presented promising results when compared to other population or iterative based meta-heuristic algorithm after it was experimented on five standard ben-chmark problems. The software application was implemented in Java with interactive interface which allow for easy modification and extended expe-rimentation. Additionally, this paper validates the effect of runtime on the al-gorithm performance.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 15.

Tytuł:: Manpower Planning with Annualized Hours Flexibility: A Fuzzy Mathematical Programming Approach
Autorzy:: Hasan, Md. G.
Hasan, S. S.
Tematy:: annualized hours
fuzzy mathematical programming
manpower planning
workforce management
flexible working; Pokaż więcej
Wydawca:: Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Powiązania:: https://bibliotekanauki.pl/articles/375925.pdf Link otwiera się w nowym oknie
Opis:: We have considered the problem of annualized hours (AH) in workforce management. AH is a method of distributing working hours with respect to the demand over a year. In this paper, the basic Manpower planning problem with AH flexibility is formulated as a fuzzy mathematical programming problem with flexible constraints. Three models of the AH planning problem under conditions of fuzzy uncertainty are presented using different aggregation operators. These fuzzy models soften the rigidity of the deterministic model by relaxing some constraints with the use of flexible programming. Finally, an illustration is given with a computational experiment performed on a realistic-scale case problem of an automobile company to demonstrate and analyze the effectiveness of the fuzzy approach over a deterministic model.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 16.

Tytuł:: A new approach for criteria weight elicitation of the ARAS-H method
Autorzy:: Ghram, Maroua
Moalla Frikha, Hela
Tematy:: ARAS-H
Criteria weights
Mathematical programming
Multiple Criteria Decision Aiding
Preference disaggregation; Pokaż więcej
Wydawca:: Uniwersytet Ekonomiczny w Katowicach
Powiązania:: https://bibliotekanauki.pl/articles/2027997.pdf Link otwiera się w nowym oknie
Opis:: Criteria weight inference is a crucial step for most of multi-criteria methods. However, criteria weights are often determined directly by the decision-maker (DM) which makes the results unreliable. Therefore, to overcome the imprecise weighting, we suggest the use of the preference programming technique. Instead of obtaining criteria weights directly from the DM, we infer them in a more objective manner to avoid the subjectivity and the unreliability of the results. Our aim is to elicit the ARAS-H criteria weights at each level of the hierarchy tree via mathematical programming, taking into account the DM’s preferences. To put it differently, starting from preference information provided by the DM, we proceed to model our constraints. The ARAS-H method is an extension of the classical ARAS method for the case of hierarchically structured criteria. We adopt a bottom-up approach in order to elicit ARAS-H criteria weights, that is, we start by determining the elementary criteria weights (i.e. the criteria at the lowest level of the hierarchy tree). The solution of the linear programs is obtained using LINGO software. The main contribution of our criteria weight elicitation procedure is in overcoming imprecise weighting without excluding the DM from the decision making process.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 17.

Tytuł:: Lagrange principle and necessary conditions
Autorzy:: Tikhomirov, V.
Tematy:: mathematical programming
convex analysis
calculus of variations
optimal control
Lagrange multiplier rule; Pokaż więcej
Wydawca:: Polska Akademia Nauk. Instytut Badań Systemowych PAN
Powiązania:: https://bibliotekanauki.pl/articles/970737.pdf Link otwiera się w nowym oknie
Opis:: Necessary conditions of extremum (from the times of Fermat and Lagrange till our times) for extremal problems where smoothness is interlaced with convexity, and some type of regularity takes place, correspond to a unique general principle, which is due to Lagrange. This report is devoted to the Lagrange principle in the theory of optimization.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 18.

Tytuł:: Models of Coal Industry in Poland
Modele sektora węglowego dla Polski
Autorzy:: Suwała, W.
Tematy:: przemysł węglowy
modele sektorowe
programowanie matematycze
coal industry
sectoral models
mathematical programming; Pokaż więcej
Wydawca:: Polska Akademia Nauk. Instytut Gospodarki Surowcami Mineralnymi i Energią PAN
Powiązania:: https://bibliotekanauki.pl/articles/216234.pdf Link otwiera się w nowym oknie
Opis:: Development of fuels and energy systems is widely supported bymodels on different levels. Most common are global or country level as well as sectoral ones. Polish energy system depends on hard coal supplies and coal sector models are required tomake valid provisions of energy system development. The paper describes briefly three such models: of coal supplies, coal market and coal supplies for power generation. The first model is devoted to the analysis of coal mining restructuring and development, the sector facing substantial changes in transformation period. The coal market model is of spatial equilibrium type and is used for forecasting coal prices and distribution. Power sector, which produces more than 60% of electricity from hard coal, needs detailed data on supplies perspectives in order to take devoid of risk decisions on investments forced by stringent emissions regulations. The model has been worked out to provide such data.
Podejmowanie decyzji w zakresie rozwoju systemów paliwowo-energetycznych jest szeroko wspierane przez modele o rożnej skali agregacji. Najbardziej popularne są modele poziomu kraju oraz sektorowe. Polski system energetyczny jest zależny od zasilania w węgiel kamienny i stąd potrzeba budowy modeli dla uzyskania wiarygodnych prognoz do optymalnego rozwoju systemu energetycznego. Artykuł opisuje trzy typy modeli dla węgla kamiennego: podaży węgla, rynku węgla i zasilania elektroenergetyki. Pierwszy z modeli podejmuje problemy restrukturyzacji i rozwoju górnictwa węgla kamiennego - sektora, który przechodził zasadnicze zmiany w okresie transformacji gospodarczej. Model rynku węgla buduje równowagę przestrzenną dla oszacowania cen węgla i jego dystrybucji. Elektroenergetyka, produkująca ponad 60% energii elektrycznej z węgla kamiennego, potrzebuje szczegółowych analiz i danych o perspektywach zasilania w węgiel dla podjęcia pozbawionych ryzyka decyzji inwestycyjnych, zwłaszcza podczas zaostrzania regulacji w zakresie emisji. Opracowano odpowiednie modele dostarczające wymaganych danych.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 19.

Tytuł:: Milk runs model with overtime: application to cluster supply chain
Autorzy:: Tomczak, M.
Bucoń, R.
Tematy:: cluster supply chain
mathematical programming
multi-objective optimization
small and medium enterprises; Pokaż więcej
Wydawca:: Politechnika Lubelska. Wydawnictwo Politechniki Lubelskiej
Powiązania:: https://bibliotekanauki.pl/articles/390975.pdf Link otwiera się w nowym oknie
Opis:: Paper identifies obstacles limiting functioning and development of small and medium construction enterprises. It also includes a description of cluster supply chain (CSC) idea as a suggested solution to some of the problems resulting from the small scale of company activities. One of more important issues of every distribution centre, i.e. portions of deliveries smaller than truck capacity for particular consumers, is also discussed. This problem was formulated for the first time in dairy industry, therefore, it was called milk runs. Moreover, the authors of this paper presented the outcome analysis of survey carried out among construction engineers and managers. This study aimed at determining organizational principles for logistic centre working with CSC framework. The mathematical model depicting milk runs deliveries with overtime consideration, done for many construction sites within a distribution centre is presented hereunder. This model may be potentially used to optimize distribution centres working within cluster supply chain framework.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 20.

Tytuł:: On some average case analysis results of the set packing problems
Raport Badawczy = Research Report ; RB/31/2009
Autorzy:: Szkatuła, Krzysztof
Wydawca:: Instytut Badań Systemowych. Polska Akademia Nauk
Systems Research Institute. Polish Academy of Sciences
Powiązania:: Raport Badawczy = Research Report
Opis:: 17 stron ; 21 cm
Bibliografia s. 17
Bibliography p. 17
17 pages ; 21 cm
The paper deals with the well-known set packing problem and its special case when 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.
Dostawca treści:: RCIN - Repozytorium Cyfrowe Instytutów Naukowych

Książka

na półce

Skocz do pozycji: 21.

Tytuł:: Wpływ nowych regulacji podatkowo-socjalnych w Polsce na proces planowania transgranicznej działalności gospodarczej
Influence of the new social and tax regulations in Poland on the process of planning the transnational business activity
Autorzy:: Grzesiak, Stefan
Jóźwiak, Robert
Tematy:: Gospodarcza działalność transgraniczna
Optymalizacja podatkowa
Programowanie matematyczne
Mathematical programming
Tax optimisation
Transnational business activity; Pokaż więcej
Wydawca:: Uniwersytet Ekonomiczny w Katowicach
Powiązania:: https://bibliotekanauki.pl/articles/591815.pdf Link otwiera się w nowym oknie
Opis:: W artykule ukazano analizę wpływu wprowadzonych w Polsce zmian Ustawy o podatku dochodowym od osób fizycznych na proces planowania podatkowego działalności transgranicznej. W rozważaniach uwzględniono także program Rodzina 500+, ponieważ zasiłki na dzieci w większości krajów europejskich stanowią integralną część ich systemów podatkowych. Analizę poprowadzono na przykładzie działalności gospodarczej prowadzonej na terenie Polski oraz Niemiec, co zarówno z metodycznego, jak również praktycznego punktu widzenia wydaje się w pełni uzasadnione. Głównym narzędziem zastosowanym przez autorów były metody całkowitoliczbowego i nieliniowego programowania matematycznego. Do obliczeń wykorzystano oprogramowanie Matematica 9.0, a w niektórych przypadkach moduły stworzone przez autorów.
In the article, the analysis of the influence of introduced in Poland, changes of the Act on Personal Income Tax on the process of tax planning of the transnational activity, was analysed. The considerations also included the Rodzina 500+ Programme because child benefits in most European countries are the integral part of their tax systems. The analysis was conducted on the example of the business activity run on the areas of Poland and Germany, which seems to be justified from both methodological and practical point of view. The main tool, used by the authors, were the methods of integer and non-linear mathematical programming. The calculations were performed in the Mathematica 9.0 software and, in some cases, in the modules created by the authors.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 22.

Tytuł:: Raport Badawczy = Research Report ; RB/22/2007
On some average case analysis results of the set packing problem
Autorzy:: Szkatuła, Krzysztof
Wydawca:: Instytut Badań Systemowych. Polska Akademia Nauk
Systems Research Institute. Polish Academy of Sciences
Powiązania:: Raport Badawczy = Research Report
Opis:: 14 stron ; 21 cm
14 pages ; 21 cm
Bibliografia s. 14
The paper deals with the well-known set packing problem. It is assumed that some of the problem coefficients are realizations of mutually independent random variables. Average case properties of selected problem characteristics are investigated for the variety of possible instances of the problem.
Bibliography p. 14
Dostawca treści:: RCIN - Repozytorium Cyfrowe Instytutów Naukowych

Książka

na półce

Skocz do pozycji: 23.

Tytuł:: Application of mathematical programming methods for public debt management
Raport Badawczy = Research Report ; RB/11/2016
Autorzy:: Klukowski, Leszek
Wydawca:: Instytut Badań Systemowych. Polska Akademia Nauk
Systems Research Institute. Polish Academy of Sciences
Powiązania:: Raport Badawczy = Research Report
Opis:: 18 pages ; 21 cm
Bibliografia s. 17-18
Bibliography p. 17-18
18 stron ; 21 cm
The paper presents examples of application of mathematical programming approach for optimization of public debt management in Poland. The criterion functions (minimized) express servicing costs of a set of debt instruments; the cost of individual instrument is a product of its capital and profitability. The constraints of the problems comprise: budgetary requirements, measures of risk and other features of debt. The result of optimization determine a structure of debt, which minimizes servicing costs and satisfies constraints.
Dostawca treści:: RCIN - Repozytorium Cyfrowe Instytutów Naukowych

Książka

na półce

Skocz do pozycji: 24.

Tytuł:: A Novel Approach to the Solution of Matrix Games with Payoffs Expressed by Trapezoidal Intuitionistic Fuzzy Numbers
Autorzy:: Verma, T.
Kumar, A.
Kacprzyk, J.
Tematy:: trapezoidal intuitionistic fuzzy numbers
mathematical programming problem
two person zerosum game
α cut
β cut; Pokaż więcej
Wydawca:: Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Powiązania:: https://bibliotekanauki.pl/articles/384798.pdf Link otwiera się w nowym oknie
Opis:: We propose a novel approach to the solution of fuzzy matrix games with payoffs given as trapezoidal intuitionistic fuzzy numbers. We extend Li’s [36, Chapter 9] work based on a cut-set based method for finding an optimal solution to overcome the fact that the assumptions and properties assumed therein do not guarantee in general, first, the very existence of an optimal solution, and second, its attainment via a mathematical programming formulation proposed. We first briefly mention those problems in Li’s [36] approach, and then propose a new, corrected and general method, called the Mehar mehod, based on a modified mathematical pro- gramming formulation of a matrix game with payoffs represented by trapezoid intuitionistic fuzzy numbers. For illustration, we solve Li’s [36] example, and compare his and our results.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 25.

Tytuł:: Scheduling preemptable jobs on identical processors under varying availability of an additional continuous resource
Autorzy:: Różycki, R.
Waligóra, G.
Węglarz, J.
Tematy:: machine scheduling
preemptable jobs
continuous resource
makespan
mathematical programming
szeregowanie zadań
zasób ciągły
programowanie matematyczne; Pokaż więcej
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Powiązania:: https://bibliotekanauki.pl/articles/330888.pdf Link otwiera się w nowym oknie
Opis:: In this work we consider a problem of scheduling preemptable, independent jobs, characterized by the fact that their processing speeds depend on the amounts of a continuous, renewable resource allocated to jobs at a time. Jobs are scheduled on parallel, identical machines, with the criterion of minimization of the schedule length. Since two categories of resources occur in the problem: discrete (set of machines) and continuous, it is generally called a discrete-continuous scheduling problem. The model studied in this paper allows the total available amount of the continuous resource to vary over time, which is a practically important generalization that has not been considered yet for discrete-continuous scheduling problems. For this model we give some properties of optimal schedules on a basis of which we propose a general methodology for solving the considered class of problems. The methodology uses a two-phase approach in which, firstly, an assignment of machines to jobs is defined and, secondly, for this assignment an optimal continuous resource allocation is found by solving an appropriate mathematical programming problem. In the approach various cases are considered, following from assumptions made on the form of the processing speed functions of jobs. For each case an iterative algorithm is designed, leading to an optimal solution in a finite number of steps.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Informacja

Wyszukujesz frazę "mathematical programming" wg kryterium: Temat