Results 51 to 60 of about 4,990,685 (299)
The Distributionally Robust Optimization Reformulation for Stochastic Complementarity Problems
Abstract and Applied Analysis, 2014 We investigate the stochastic linear complementarity problem affinely affected by the uncertain parameters. Assuming that we have only limited information about the uncertain parameters, such as the first two moments or the first two moments as well as ...
Liyan Xu, Bo Yu, Wei Liu
doaj +1 more source
An MPCC Formulation and Its Smooth Solution Algorithm for Continuous Network Design Problem
Promet (Zagreb), 2017 Continuous network design problem (CNDP) is searching for a transportation network configuration to minimize the sum of the total system travel time and the investment cost of link capacity expansions by considering that the travellers follow a ...
Guangmin Wang, Junwei Yu, Shubin Li
doaj +1 more source
A Full-Newton step infeasible-interior-point algorithm for P*(k)-horizontal linear complementarity problems [PDF]
Yugoslav Journal of Operations Research, 2015 In this paper we generalize an infeasible interior-point method for linear optimization to horizontal linear complementarity problem (HLCP). This algorithm starts from strictly feasible iterates on the central path of a perturbed problem that is
Asadi S., Mansouri H.
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Introduction The use of herbal medical preparation (HMP) is rising among pediatric oncology patients, often to manage treatment‐related symptoms. Their effectiveness remains uncertain, and the risk of herb–drug interactions is underestimated.
Orianne Mahot +6 more
wiley +1 more source
Journal of Applied Mathematics, 2012 For the extended mixed linear complementarity problem (EML CP), we first present the characterization of the solution set for the EMLCP. Based on this, its global error bound is also established under milder conditions. The results obtained in this paper
Hongchun Sun, Yiju Wang
doaj +1 more source
Computers and Mathematics with Applications, 2019 In this paper, we present a general two-sweep modulus-based iteration method to solve a class of linear complementarity problems. Convergence analysis shows that the general two-sweep modulus-based matrix splitting iteration method will converge to the ...
H.-H. Ren +3 more
semanticscholar +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Although significant progress has been made in childhood leukemia survival, healthcare providers, and caregivers often face challenges in explaining this disease to patients. Disease‐targeted storybooks have been proposed as a tool to facilitate the understanding of diagnoses and treatment.
Nutvipha Ummartyotin +6 more
wiley +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Animal‐assisted activities (AAAs) with therapy dogs have shown positive effects on patient well‐being and quality of life in various areas of medicine, including pediatric oncology. However, research on this topic is limited. The aim of this study is to present the current status of AAA in pediatric oncology in Germany, Austria, and
Jan‐Marius Wedig +7 more
wiley +1 more source
پژوهشهای ریاضی, 2021 By using a new search direction, we propose an infeasible interior-point method for monotone linear complementarity problem. The algorithm uses only one feasibility step in each iteration, and we prove that it suffices in order to obtain a polynomial ...
Nezameddin Mahdavi-Amiri +1 more
doaj
A class of singular Ro-matrices and extensions to semidefinite linear complementarity problems [PDF]
Yugoslav Journal of Operations Research, 2013 For ARnxn and qRn, the linear complementarity problem LCP(A, q) is to determine if there is xRn such that x ≥ 0; y = Ax + q ≥ 0 and xT y = 0. Such an x is called a solution of LCP(A,q).
Sivakumar K.C.
doaj +1 more source