To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
The existence of a negative solution, of a positive solution, and of a sign-changing solution to a Dirichlet eigenvalue problem with p-Laplacian and multi-valued nonlinearity is investigated via sub- and supersolution methods as well as variational techniques for nonsmooth functions.
In this paper, we introduce and consider a new class of complementarity problems, which are called the generalized mixed quasi-complementarity problems in a topological vector space. We show that the generalized mixed quasi-complementarity problems are equivalent to the generalized mixed quasi variational inequalities. Using a new type of KKM mapping theorem, we study the existence of a solution of the generalized mixed quasi-variational inequalities and generalized mixed quasi-complementarity problems. Several special cases are also discussed. The results obtained in this paper can be viewed as extension and generalization of the previously known results.
In this paper, a new approach to a characterization of solvability of a nonlinear nonsmooth multiobjective programming problem with inequality constraints is introduced. A family of η-approximated vector optimization problems is constructed by a modification of the objective and the constraint functions in the original nonsmooth multiobjective programming problem. The connection between (weak) efficient points in the original nonsmooth multiobjective programming problem and its equivalent η-approximated vector optimization problems is established under V-invexity. It turns out that, in most cases, solvability of a nonlinear nonsmooth multiobjective programming problem can be characterized by solvability of differentiable vector optimization problems.
The problem of optimal dividends paid until absorbtion at zero is considered for a rather general diffusion model. With each dividend payment there is a proportional cost and a fixed cost. It is shown that there can be essentially three different solutions depending on the model parameters and the costs. (i) Whenever assets reach a barrier y*, they are reduced to y* - δ* through a dividend payment, and the process continues. (ii) Whenever assets reach a barrier y*, everything is paid out as dividends and the process terminates. (iii) There is no optimal policy, but the value function is approximated by policies of one of the two above forms for increasing barriers. A method to numerically find the optimal policy (if it exists) is presented and numerical examples are given.