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ę "fractional programming" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-10 z 10
    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ł:
    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ł:
    Sufficient optimality condition and duality of nondifferentiable minimax ratio constraint problems under (p, r)-ρ-(η, θ)-invexity
    Autorzy:
    Kailey, Navdeep
    Sethi, Sonali
    Saini, Shivani
    Powiązania:
    https://bibliotekanauki.pl/articles/2183486.pdf
    Data publikacji:
    2022
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    minimax fractional programming
    optimality conditions
    duality
    generalized invexity
    Opis:
    There are several classes of decision-making problems that explicitly or implicitly prompt fractional programming problems. Portfolio selection problems, agricultural planning, information transfer, numerical analysis of stochastic processes, and resource allocation problems are just a few examples. The huge number of applications of minimax fractional programming problems inspired us to work on this topic. This paper is concerned with a nondifferentiable minimax fractional programming problem. We study a parametric dual model, corresponding to the primal problem, and derive the sufficient optimality condition for an optimal solution to the considered problem. Further, we obtain the various duality results under (p, r)-ρ-(η, θ)-invexity assumptions. Also, we identify a function lying exclusively in the class of (−1, 1)-ρ-(η, θ)- invex functions but not in the class of (1,−1)-invex functions and convex function already existing in the literature. We have given a non-trivial model of nondifferentiable minimax problem and obtained its optimal solution using optimality results derived in this paper.
    Źródło:
    Control and Cybernetics; 2022, 51, 1; 71--88
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Branch and bound algorithm for discrete multi- level linear fractional programming problem
    Autorzy:
    Arora, R.
    Gupta, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/406478.pdf
    Data publikacji:
    2018
    Wydawca:
    Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
    Tematy:
    linear fractional programming problem
    bilevel programming
    multilevel programming
    discrete variables
    integer solution
    branch and bound cut
    programowanie dwustopniowe
    programowanie wielopoziomowe
    zmienne dyskretne
    Opis:
    An algorithm is proposed to find an integer solution for bilevel linear fractional programming problem with discrete variables. The method develops a cut that removes the integer solutions which are not bilevel feasible. The proposed method is extended from bilevel to multilevel linear fractional programming problems with discrete variables. The solution procedure for both the algorithms is elucidated in the paper.
    Źródło:
    Operations Research and Decisions; 2018, 28, 2; 5-21
    2081-8858
    2391-6060
    Pojawia się w:
    Operations Research and Decisions
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    An algorithm for quadratically constrained multi-objective quadratic fractional programming with pentagonal fuzzy numbers
    Autorzy:
    Goyal, Vandana
    Rani, Namrata
    Gupta, Deepak
    Powiązania:
    https://bibliotekanauki.pl/articles/2175831.pdf
    Data publikacji:
    2022
    Wydawca:
    Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
    Tematy:
    multi-objective quadratic fractional programming model
    MOQFPM
    pentagonal fuzzy number
    PFN
    mean method of α-cut
    parametric approach
    ε-constraint method
    Opis:
    This study proposes a methodology to obtain an efficient solution for a programming model which is multi-objective quadratic fractional with pentagonal fuzzy numbers as coefficients in all the objective functions and constraints. The proposed approach consists of three stages. In the first stage, defuzzification of the coefficients is carried out using the mean method of α-cut. Then, in the second stage, a crisp multi-objective quadratic fractional programming model (MOQFP) is constructed to obtain a non-fractional model based on an iterative parametric approach. In the final stage, this multi- -objective non-fractional model is transformed to obtain a model with a single objective by applying the ε-constraint method. This final model is then solved to get desired solution. Also, an algorithm and flowchart expressing the methodology are given to present a clear picture of the approach. Finally, a numerical example illustrating the complete approach is given.
    Źródło:
    Operations Research and Decisions; 2022, 32, 1; 49--71
    2081-8858
    2391-6060
    Pojawia się w:
    Operations Research and Decisions
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Optimality conditions and duality for generalized fractional minimax programming involving locally Lipschitz (b,Ψ,Φ,ρ) -univex functions
    Autorzy:
    Antczak, T.
    Mishra, S. K.
    Upadhyay, B. B.
    Powiązania:
    https://bibliotekanauki.pl/articles/206666.pdf
    Data publikacji:
    2018
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    generalized fractional minimax programming
    locally Lipschitz (b,Ψ,Φ,ρ)-univex function
    optimality conditions
    duality
    Opis:
    In this paper, we are concerned with optimality conditions and duality results of generalized fractional minimax programming problems. Sufficient optimality conditions are established for a class of nondifferentiable generalized fractional minimax programming problems, in which the involved functions are locally Lipschitz (b,Ψ,Φ,ρ)-univex. Subsequently, these optimality conditions are utilized as a basis for constructing various parametric and nonparametric duality models for this type of fractional programming problems and proving appropriate duality theorems.
    Źródło:
    Control and Cybernetics; 2018, 47, 1; 5-32
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    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ł:
    Observer synthesis for linear discrete-time systems with different fractional orders
    Synteza obserwatora układów dyskretnych o różnych niecałkowitych rzędach
    Autorzy:
    Kociszewski, R.
    Powiązania:
    https://bibliotekanauki.pl/articles/276524.pdf
    Data publikacji:
    2013
    Wydawca:
    Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
    Tematy:
    rząd niecałkowity
    układ
    dodatni
    dyskretny
    obserwator
    programowanie liniowe
    liniowa nierówność macierzowa
    fractional
    positive
    discrete-time
    system
    observer
    linear programming
    linear matrix inequality
    Opis:
    The paper is devoted to observer synthesis for linear discrete-time positive fractional systems with different fractional orders. The problem of finding a nonnegative gain matrix of the observer such that the observer is positive and asymptotically stable is formulated and solved by the use of linear programming (LP) and linear matrix inequality (LMI) methods. The proposed approach to the observer synthesis is illustrated by theoretical example. Numerical calculations and simulations have been performed in the MATLAB/Simulink program environment.
    W pracy rozpatrzono problem syntezy obserwatorów dla dodatnich układów dyskretnych różnych niecałkowitych rzędów w równaniu stanu. Wykorzystując podejście oparte na typowym zadaniu programowania liniowego (LP) oraz zadaniu sformułowanym w ramach liniowych nierówności macierzowych (LMI) pokazano, że jest możliwe uzyskanie dodatniego asymptotycznie stabilnego obserwatora. Są to warunki dostateczne, alternatywne w stosunku do podanych w [5, 18] dla układów niedodatnich. Zaprojektowany obserwator poprawnie estymuje (odtwarza) zmienne stanu przyjętego do rozważań dyskretnego układu niecałkowitego rzędu. Wyniki obliczeniowe uzyskano w środowisku programowym MATLAB z wykorzystaniem biblioteki Optimization oraz pakietów SeDuMi i YALMIP. Rezultaty symulacyjne uzyskano przy wykorzystaniu dodatkowej biblioteki Fractional States Space Toolkit.
    Źródło:
    Pomiary Automatyka Robotyka; 2013, 17, 2; 376-381
    1427-9126
    Pojawia się w:
    Pomiary Automatyka Robotyka
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-10 z 10

      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