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

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-8 z 8
    Tytuł:
    A comparative study on interval arithmetic operations with intuitionistic fuzzy numbers for solving an intuitionistic fuzzy multi-objective linear programming problem
    Autorzy:
    Vidhya, R.
    Irene Hepzibah, R.
    Powiązania:
    https://bibliotekanauki.pl/articles/330813.pdf
    Data publikacji:
    2017
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    fuzzy number
    fuzzy arithmetic
    linear programming problem
    liczba rozmyta
    arytmetyka rozmyta
    programowanie liniowe
    Opis:
    In a real world situation, whenever ambiguity exists in the modeling of intuitionistic fuzzy numbers (IFNs), interval valued intuitionistic fuzzy numbers (IVIFNs) are often used in order to represent a range of IFNs unstable from the most pessimistic evaluation to the most optimistic one. IVIFNs are a construction which helps us to avoid such a prohibitive complexity. This paper is focused on two types of arithmetic operations on interval valued intuitionistic fuzzy numbers (IVIFNs) to solve the interval valued intuitionistic fuzzy multi-objective linear programming problem with pentagonal intuitionistic fuzzy numbers (PIFNs) by assuming different α and β cut values in a comparative manner. The objective functions involved in the problem are ranked by the ratio ranking method and the problem is solved by the preemptive optimization method. An illustrative example with MATLAB outputs is presented in order to clarify the potential approach.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2017, 27, 3; 563-573
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A linear programming methodology for approximate dynamic programming
    Autorzy:
    Díaz, Henry
    Sala, Antonio
    Armesto, Leopoldo
    Powiązania:
    https://bibliotekanauki.pl/articles/330082.pdf
    Data publikacji:
    2020
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    linear programming
    approximate dynamic programming
    control applications
    neural network
    programowanie liniowe
    programowanie dynamiczne
    sieć neuronowa
    Opis:
    The linear programming (LP) approach to solve the Bellman equation in dynamic programming is a well-known option for finite state and input spaces to obtain an exact solution. However, with function approximation or continuous state spaces, refinements are necessary. This paper presents a methodology to make approximate dynamic programming via LP work in practical control applications with continuous state and input spaces. There are some guidelines on data and regressor choices needed to obtain meaningful and well-conditioned value function estimates. The work discusses the introduction of terminal ingredients and computation of lower and upper bounds of the value function. An experimental inverted-pendulum application will be used to illustrate the proposal and carry out a suitable comparative analysis with alternative options in the literature.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2020, 30, 2; 363-375
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Sensitivity of computer support game algorithms of safe ship control
    Autorzy:
    Lisowski, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/331390.pdf
    Data publikacji:
    2013
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    differential game
    positional game
    matrix game
    dual linear programming
    gra różnicowa
    gra pozycyjna
    gra macierzowa
    programowanie liniowe
    Opis:
    The paper investigates the sensitivity of safe ship control to inaccurate data from the ARPA anti-collision radar system and to changes in the process control parameters. The system structure of safe ship control in collision situations and computer support programmes exploring information from the ARPA anti-collision radar are presented. Sensitivity characteristics of the multistage positional non-cooperative and cooperative game and kinematics optimization control algorithms are determined through examples of navigational situations with restricted visibility at sea.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2013, 23, 2; 439-446
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Conditions and a computation method of the constrained regulation problem for a class of fractional-order nonlinear continuous-time systems
    Autorzy:
    Si, Xindong
    Yang, Hongli
    Ivanov, Ivan G.
    Powiązania:
    https://bibliotekanauki.pl/articles/1838174.pdf
    Data publikacji:
    2021
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    fractional order nonlinear system
    constrained regulation
    positively invariant set
    linear programming
    układ nieliniowy
    zbiór dodatnio niezmienny
    programowanie liniowe
    Opis:
    The constrained regulation problem (CRP) for fractional-order nonlinear continuous-time systems is investigated. New existence conditions of a linear feedback control law for a class of fractional-order nonlinear continuous-time systems under constraints are proposed. A computation method for solving the CRP for fractional-order nonlinear systems is also presented. Using the comparison principle and positively invariant set theory, conditions guaranteeing positive invariance of a polyhedron for fractional-order nonlinear systems are established. A linear feedback controller model and the corresponding algorithm of the CRP for fractional nonlinear systems are also proposed by using the obtained conditions. The presented model of the CRP is formulated as a linear programming problem, which can be easily implemented from a computational point of view. Numerical examples illustrate the proposed method.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2021, 31, 1; 17-28
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Conditions and a computation method of the constrained regulation problem for a class of fractional-order nonlinear continuous-time systems
    Autorzy:
    Si, Xindong
    Yang, Hongli
    Ivanov, Ivan G.
    Powiązania:
    https://bibliotekanauki.pl/articles/1838194.pdf
    Data publikacji:
    2021
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    fractional order nonlinear system
    constrained regulation
    positively invariant set
    linear programming
    układ nieliniowy
    zbiór dodatnio niezmienny
    programowanie liniowe
    Opis:
    The constrained regulation problem (CRP) for fractional-order nonlinear continuous-time systems is investigated. New existence conditions of a linear feedback control law for a class of fractional-order nonlinear continuous-time systems under constraints are proposed. A computation method for solving the CRP for fractional-order nonlinear systems is also presented. Using the comparison principle and positively invariant set theory, conditions guaranteeing positive invariance of a polyhedron for fractional-order nonlinear systems are established. A linear feedback controller model and the corresponding algorithm of the CRP for fractional nonlinear systems are also proposed by using the obtained conditions. The presented model of the CRP is formulated as a linear programming problem, which can be easily implemented from a computational point of view. Numerical examples illustrate the proposed method.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2021, 31, 1; 17-28
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Conditions and a computation method of the constrained regulation problem for a class of fractional-order nonlinear continuous-time systems
    Autorzy:
    Si, Xindong
    Yang, Hongli
    Ivanov, Ivan G.
    Powiązania:
    https://bibliotekanauki.pl/articles/1838196.pdf
    Data publikacji:
    2021
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    fractional order nonlinear system
    constrained regulation
    positively invariant set
    linear programming
    układ nieliniowy
    zbiór dodatnio niezmienny
    programowanie liniowe
    Opis:
    The constrained regulation problem (CRP) for fractional-order nonlinear continuous-time systems is investigated. New existence conditions of a linear feedback control law for a class of fractional-order nonlinear continuous-time systems under constraints are proposed. A computation method for solving the CRP for fractional-order nonlinear systems is also presented. Using the comparison principle and positively invariant set theory, conditions guaranteeing positive invariance of a polyhedron for fractional-order nonlinear systems are established. A linear feedback controller model and the corresponding algorithm of the CRP for fractional nonlinear systems are also proposed by using the obtained conditions. The presented model of the CRP is formulated as a linear programming problem, which can be easily implemented from a computational point of view. Numerical examples illustrate the proposed method.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2021, 31, 1; 17-28
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A linear programming based analysis of the CP-rank of completely positive matrices
    Autorzy:
    Li, Y.
    Kummert, A.
    Frommer, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/907323.pdf
    Data publikacji:
    2004
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    macierz pozytywna
    programowanie liniowe
    algorytm Simplex
    completely positive matrices
    cp-rank
    linear programming
    simplex algorithm
    basic feasible solution
    pivot process
    Opis:
    A real matrix A is said to be completely positive (CP) if it can be decomposed as A= B BT, where the real matrix B has exclusively non-negative entries. Let k be the rank of A and Phik the least possible number of columns of the matrix B, the so-called completely positive rank (cp-rank) of A. The present work is devoted to a study of a general upper bound for the cp-rank of an arbitrary completely positive matrix A and its dependence on the ordinary rank k. This general upper bound of the cp-rank has been proved to be at most k(k + 1)/2. In a recent pioneering work of Barioli and Berman it was slightly reduced by one, which means that Phik \leq k(k + 1)/2-1 holds for k \geq 2. An alternative constructive proof of the same result is given in the present paper based on the properties of the simplex algorithm known from linear programming. Our proof illuminates complete positivity from a different point of view. Discussions concerning dual cones are not needed here. In addition to that, the proof is of constructive nature, i.e. starting from an arbitrary decomposition A= B1 B1T (B1\geq 0) a new decomposition A= B2 B2T (B2\geq 0) can be generated in a constructive manner, where the number of column vectors of B2 does not exceed k(k + 1)/2-1. This algorithm is based mainly on the well-known techniques stemming from linear programming, where the pivot step of the simplex algorithm plays a key role.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2004, 14, 1; 25-31
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Exact and heuristic approaches to solve the Internet shopping optimization problem with delivery costs
    Autorzy:
    Lopez-Loces, M. C.
    Musial, J.
    Pecero, J. E.
    Fraire-Huacuja, H. J.
    Blazewicz, J.
    Bouvry, P.
    Powiązania:
    https://bibliotekanauki.pl/articles/330508.pdf
    Data publikacji:
    2016
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    internet shopping optimization
    integer linear programming
    cellular processing algorithm
    heuristic algorithms
    optimization in e-commerce
    zakupy internetowe
    programowanie liniowe
    algorytm heurystyczny
    handel elektroniczny
    Opis:
    Internet shopping has been one of the most common online activities, carried out by millions of users every day. As the number of available offers grows, the difficulty in getting the best one among all the shops increases as well. In this paper we propose an integer linear programming (ILP) model and two heuristic solutions, the MinMin algorithm and the cellular processing algorithm, to tackle the Internet shopping optimization problem with delivery costs. The obtained results improve those achieved by the state-of-the-art heuristics, and for small real case scenarios ILP delivers exact solutions in a reasonable amount of time.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2016, 26, 2; 391-406
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-8 z 8

      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