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

Informacja

Wyszukujesz frazę "mathematical programming" wg kryterium: Temat