Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Ali Al-Hasani"'
Autor:
Iftikhar Khan, Ali Al-Hasani, Mohsin H Khan, Aamir N Khan, Fakhr-E -Alam, Sajid K Sadozai, Abdelbary Elhissi, Jehanzeb Khan, Sakib Yousaf
Publikováno v:
PLoS ONE, Vol 18, Iss 3, p e0281860 (2023)
Drug delivery via aerosolization for localized and systemic effect is a non-invasive approach to achieving pulmonary targeting. The aim of this study was to prepare spray-dried proliposome (SDP) powder formulations to produce carrier particles for su
Externí odkaz:
https://doaj.org/article/3422296cdcb4489fb6a40b61971a9184
Publikováno v:
International Journal of Mathematical, Engineering and Management Sciences, Vol 5, Iss 6, Pp 1249-1269 (2020)
For any single-objective mathematical programming model, rank-based optimal solutions are computationally difficult to find compared to an optimal solution to the same single-objective mathematical programming model. In this paper, several methods ha
Externí odkaz:
https://doaj.org/article/f942c0c76e5b4c558a906fe89f7f927b
Publikováno v:
International Journal of Mathematical, Engineering and Management Sciences, Vol 4, Iss 5, Pp 1140-1153 (2019)
In this paper, a reformulation that was proposed for a knapsack problem has been extended to single and bi-objective linear integer programs. A further reformulation by adding an upper bound constraint for a knapsack problem is also proposed and exte
Externí odkaz:
https://doaj.org/article/159232cc03434dc890f4ed8fb35a44e9
Publikováno v:
International Journal of Mathematical, Engineering and Management Sciences, Vol 3, Iss 4, Pp 351-364 (2018)
In this paper, an existing algorithm known as Triangle Splitting Method (TSM) for the Bi-Objective Mixed Integer Program (BOMIP) has been modified, which has been named “An Improved Triangle Splitting Method (ITSM)”. The TSM solves many unnecessa
Externí odkaz:
https://doaj.org/article/2ef9628f396c4caa92921ba70578c650
Publikováno v:
International Journal of Mathematical, Engineering and Management Sciences, Vol 5, Iss 6, Pp 1249-1269 (2020)
For any single-objective mathematical programming model, rank-based optimal solutions are computationally difficult to find compared to an optimal solution to the same single-objective mathematical programming model. In this paper, several methods ha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ea3125f5de9efdfef834eea66e039949
https://doi.org/10.33889/ijmems.2020.5.6.093
https://doi.org/10.33889/ijmems.2020.5.6.093
Publikováno v:
International Journal of System Assurance Engineering and Management. 10:937-944
In this paper, a bi-objective integer programming problem is analysed using the characteristic equation that was developed to solve a single-objective pure integer program. This equation can also provides other ranked solutions i.e. 2nd, 3rd,... best
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::80e854e2f1fd25e569c15dc912e14863
https://doi.org/10.1007/s13198-019-00824-7
https://doi.org/10.1007/s13198-019-00824-7
Publikováno v:
Journal of Physics: Conference Series. 1490:012063
A need for an optimal solution for a given mathematical model is well known and many solution approaches have been developed to identify efficiently an optimal solution for a given situation. For example, one such class of mathematical models with in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a60456040285f194587c49bd108ad6a9
https://doi.org/10.1088/1742-6596/1490/1/012063
https://doi.org/10.1088/1742-6596/1490/1/012063
Publikováno v:
Journal of Physics: Conference Series. 1490:012061
In this paper, we developed a new algorithm to find the set of a non-dominated points for a multi-objective integer programming problem. The algorithm is an enhancement on the improved recursive method where the authors have used a lexicographic meth
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bd7d80d33950b8208360e05a74769a93
https://doi.org/10.1088/1742-6596/1490/1/012061
https://doi.org/10.1088/1742-6596/1490/1/012061
Publikováno v:
Journal of Physics: Conference Series. 1218:012004
In this paper, we consider a bi-objective generalized assignment problem (BOGAP) and find all non-dominated points using two methods; Two Phases Method (TPM) and the Balanced Box Method (BBM). The computational results are shown by testing a number o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2502c7f84f4547b8f84fa101dc3bca4d
https://doi.org/10.1088/1742-6596/1218/1/012004
https://doi.org/10.1088/1742-6596/1218/1/012004