Results 51 to 60 of about 1,574 (145)
General algorithm and sensitivity analysis for variational inequalities
International Journal of Stochastic Analysis, Volume 5, Issue 1, Page 29-41, 1992., 1991 The fixed point technique is used to prove the existence of a solution for a class of variational inequalities related to odd order boundary value problems, and to suggest a general algorithm. We also study the sensitivity analysis for these variational inequalities and complementarity problems using the projection technique.
Muhammad Aslam Noor
wiley +1 more source
On nonlinear variational inequalities
International Journal of Mathematics and Mathematical Sciences, Volume 14, Issue 2, Page 399-402, 1991., 1990 The fixed point technique is used to prove the existence of a solution for a class of nonlinear variational inequalities related with odd order constrained boundary value problems and to suggest an iterative algorithm to compute the approximate solution.
Muhammed Aslam Noor
wiley +1 more source
A new branch and bound algorithm for minimax ratios problems
Open Mathematics, 2017 This study presents an efficient branch and bound algorithm for globally solving the minimax fractional programming problem (MFP). By introducing an auxiliary variable, an equivalent problem is firstly constructed and the convex relaxation programming ...
Zhao Yingfeng, Liu Sanyang, Jiao Hongwei
doaj +1 more source
Soft Capacitors for Wave Energy Harvesting
, 2011 Wave energy harvesting could be a substantial renewable energy source without impact on the global climate and ecology, yet practical attempts have struggle d with problems of wear and catastrophic failure.
Abel, Markus +4 more
core +1 more source
Optimality conditions for pessimistic semivectorial bilevel programming problems
, 2014 In this paper, a class of pessimistic semivectorial bilevel programming problems is investigated. By using the scalarization method, we transform the pessimistic semivectorial bilevel programming problem into a scalar objective optimization problem with ...
Bingbing Liu +3 more
semanticscholar +1 more source
Multifacility location problems on a sphere
International Journal of Mathematics and Mathematical Sciences, Volume 10, Issue 3, Page 583-595, 1987., 1987 A unified approach to multisource location problems on a sphere is presented. Euclidean, squared Euclidean and the great circle distances are considered. An algorithm is formulated and its convergence properties are investigated.
Turgut Aykin, A. J. G. Babu
wiley +1 more source
Sufficient pruning conditions for MINLP in gas network design
EURO Journal on Computational Optimization, 2017 One-quarter of Europe’s energy demand is provided by natural gas distributed through a vast pipeline network covering the whole of Europe. At a cost of 1 million Euros per kilometer the extension of the European pipeline network is already a multi ...
Jesco Humpola, Felipe Serrano
doaj +1 more source
Integer Polynomial Optimization in Fixed Dimension
, 2004 We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the number of variables is fixed.
Barvinok A. I. +9 more
core +4 more sources
Coupled best proximity points in ordered metric spaces
, 2014 In this paper, we prove the existence and uniqueness of a coupled best proximity point for mappings satisfying the proximally coupled contraction condition in a complete ordered metric space.
Poom Kumam +3 more
semanticscholar +1 more source
A nonlinear preconditioner for optimum experimental design problems
EURO Journal on Computational Optimization, 2015 We show how to efficiently compute A-optimal experimental designs, which are formulated in terms of the minimization of the trace of the covariance matrix of the underlying regression process, using quasi-Newton sequential quadratic programming methods ...
Mario S. Mommer +3 more
doaj +1 more source