Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "BI" wg kryterium: Temat


Wyświetlanie 1-3 z 3
Tytuł:
Objectives of an enterprise. Bi-criteria analysis and negotiation problems
Autorzy:
Gadomski, Jan
Kruś, Lech
Powiązania:
https://bibliotekanauki.pl/articles/2183431.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
economic modelling
production function
cost function
bi-criteria optimization
negotiations
Opis:
A decision-making process is considered for a firm, in which two coexisting groups of interests pursue different goals. An original model based on a non-neoclassical production function is proposed. The function satisfies the conditions formulated by R. Frisch, which makes it possible to investigate firms operating in the environment far from the perfect competition and pursuing goals other than profit maximization. A two-criteria optimization problem is formulated with the two criteria representing the goals of the groups: maximization of profit and maximization of income generated by the firm with respect to capital and labor. The problem is considered in two variants of the product market, namely the perfect and the imperfect competition. Solutions of the problem are analyzed including the derived Pareto sets. The importance of knowledge about the Pareto set in negotiations between the groups of interests in the firm is illustrated and discussed.
Źródło:
Control and Cybernetics; 2021, 50, 1; 169--193
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A method of approximating Pareto sets for assessments of implicit Pareto set elements
Autorzy:
Kaliszewski, I.
Powiązania:
https://bibliotekanauki.pl/articles/970402.pdf
Data publikacji:
2007
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
multiple criteria decision making
bi-criteria problems
Pareto set
efficiency
convex function approximation
sandwich algorithms
Opis:
Deriving efficient variants in complex multiple criteria decision making problems requires optimization. This hampers greatly broad use of any multiple criteria decision making method. In multiple criteria decision making Pareto sets, i.e. sets of efficient vectors of criteria values corresponding to feasible decision alternatives, are of primal interest. Recently, methods have been proposed to calculate assessments for any implicit element of a Pareto set (i.e. element which has not been derived explicitly but has been designated in a form which allows its explicit derivation, if required) when a finite representation of the Pareto set is known. In that case calculating respective bounds involves only elementary operations on numbers and does not require optimization. In this paper the problem of approximating Pareto sets by finite representations which assure required tightness of bounds is considered for bicriteria decision making problems. Properties of a procedure to derive such representations and its numerical behavior are investigated.
Źródło:
Control and Cybernetics; 2007, 36, 2; 367-381
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Representations of hypersurfaces and minimal smoothness of the midsurface in the theory of shells
Autorzy:
Delfour, M. C.
Powiązania:
https://bibliotekanauki.pl/articles/970297.pdf
Data publikacji:
2008
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
thin shell
asymptotic shell
midsurface
smoothness
representation of a surface
oriented distance function
bi-Lipschitz mapping
tubular neighborhood
Opis:
Many hypersurfaces ω in R^N can be viewed as a subset of the boundary Γ of an open subset Ω of R^N. In such cases, the gradient and Hessian matrix of the associated oriented distance function ba to the underlying set Ω completely describe the normal and the N fundamental forms of ω, and a fairly complete intrinsic theory of Sobolev spaces on C1'1-hypersurfaces is available in Delfour (2000). In the theory of thin shells, the asymptotic model only depends on the choice of the constitutive law, the midsurface, and the space of solutions that properly handles the loading applied to the shell and the boundary conditions. A central issue is the minimal smoothness of the midsurface to still make sense of asymptotic membrane shell and bending equations without ad hoc mechanical or mathematical assumptions. This is possible for a C1'1-midsurface with or without boundary and without local maps, local bases, and Christoffel symbols via the purely intrinsic methods developed by Delfour and Zolesio (1995a) in 1992. Anicic, LeDret and Raoult (2004) introduced in 2004 a family of surfaces ω that are the image of a connected bounded open Lipschitzian domain in R² by a bi-Lipschitzian mapping with the assumption that the normal field is globally Lipschizian. >From this, they construct a tubular neighborhood of thickness 2h around the surface and show that for sufficiently small h the associated tubular neighborhood mapping is bi-Lipschitzian. We prove that such surfaces are C1'1-surfaces with a bounded measurable second fundamental form. We show that the tubular neighborhood can be completely described by the algebraic distance function to ω and that it is generally not a Lipschitzian domain in R³ by providing the example of a plate around a flat surface ω verifying all their assumptions. Therefore, the G1-join of K-regular patches in the sense of Le Dret (2004) generates a new K-regular patch that is a C1'1-surface and the join is C1'1. Finally, we generalize everything to hypersurfaces generated by a bi-Lipschitzian mapping defined on a domain with facets (e.g. for sphere, torus). We also give conditions for the decomposition of a C1'1-hypersurface into C1'1-patches.
Źródło:
Control and Cybernetics; 2008, 37, 4; 879-911
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-3 z 3

    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