Zobrazeno 1 - 10
of 1 773
pro vyhledávání: '"Criss-cross algorithm"'
Autor:
M. Premkumar, Pradeep Jangir, C. Ramakrishnan, C. Kumar, R. Sowmya, Sanchari Deb, Nallapaneni Manoj Kumar
Publikováno v:
Energy Reports, Vol 8, Iss , Pp 15249-15285 (2022)
The performance of a PhotoVoltaic (PV) system could be inferred from the features of its current–voltage relationships, but the PV model parameters are uncertain. Because of its multimodal, multivariable, and nonlinear properties, the PV model requ
Externí odkaz:
https://doaj.org/article/1999fc5f2124443e97fa85252bb563f4
Publikováno v:
Acta Universitatis Sapientiae: Informatica, Vol 5, Iss 1, Pp 103-139 (2013)
In this paper we introduce the s-monotone index selection rules for the well-known criss-cross method for solving the linear complementarity problem (LCP). Most LCP solution methods require a priori information about the properties of the input matri
Externí odkaz:
https://doaj.org/article/9d054928fe844b55a7e788a41b9b09c9
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Javad Tayyebi, Massoud Aman
Publikováno v:
Discrete Applied Mathematics. 240:92-101
Given a linear programming problem with the objective function coefficients vector c and a feasible solution x 0 to this problem, a corresponding inverse linear programming problem is to modify the vector c as little as possible to make x 0 form an o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5ebc5c591c781df467c1923b277b87a9
https://doi.org/10.1016/j.dam.2015.12.017
https://doi.org/10.1016/j.dam.2015.12.017
Publikováno v:
Expert Systems with Applications. 93:39-49
A system of interval linear equations is formed and solved.Solutions of system specify the optimal solution set of interval linear programming.Solution space of some solving methods and the optimal solution set are compared.The solutions obtained by
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4b8c1f14b6606b028b3b50716481de9d
https://doi.org/10.1016/j.eswa.2017.10.020
https://doi.org/10.1016/j.eswa.2017.10.020
Publikováno v:
Computers & Operations Research. 89:17-30
We present a linear programming based algorithm for a class of optimization problems with a multi-linear objective function and affine constraints. This class of optimization problems has only one objective function, but it can also be viewed as a cl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d9129e524cf868ffbdb8536bc9afad0d
https://doi.org/10.1016/j.cor.2017.07.015
https://doi.org/10.1016/j.cor.2017.07.015
Publikováno v:
Knowledge-Based Systems. 138:113-123
This paper proposes a bilevel improved fruit fly optimization algorithm (BIFOA) to address the nonlinear bilevel programming problem (NBLPP). Considering the hierarchical nature of the problem, this algorithm is constructed by combining two sole impr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::03e7daf9b815c0fe821e761e912c8eb4
https://doi.org/10.1016/j.knosys.2017.09.038
https://doi.org/10.1016/j.knosys.2017.09.038
Autor:
R. Venkata Rao, Ankit Saroj
Publikováno v:
Swarm and Evolutionary Computation. 37:1-26
Multi-population algorithms have been widely used for solving the real-world problems. However, it is not easy to get the number of sub-populations to be used for a given problem. This work proposes a self-adaptive multi-population based Jaya (SAMP-J
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b82864e49bf1b2a3a1d671aa5d75a422
https://doi.org/10.1016/j.swevo.2017.04.008
https://doi.org/10.1016/j.swevo.2017.04.008
A Wide-Neighborhood Predictor-Corrector Interior-Point Algorithm for Linear Complementarity Problems
Publikováno v:
Journal of the Operations Research Society of China. 6:529-543
In this paper, a wide-neighborhood predictor-corrector feasible interior-point algorithm for linear complementarity problems is proposed. The algorithm is based on using the classical affine scaling direction as a part in a corrector step, not in a p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ebc61a1da3331137c5d03833afeacdce
https://doi.org/10.1007/s40305-017-0178-y
https://doi.org/10.1007/s40305-017-0178-y
Publikováno v:
Wuhan University Journal of Natural Sciences. 22:465-471
In this paper, we propose an arc-search interior-point algorithm for convex quadratic programming with a wide neighborhood of the central path, which searches the optimizers along the ellipses that approximate the entire central path. The favorable p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::25623e8f0b12b9a3974f27cef02d0c7b
https://doi.org/10.1007/s11859-017-1274-x
https://doi.org/10.1007/s11859-017-1274-x