We introduce and study a new class of generalized nonlinear mixed variational-like inequalities in reflexive Banach spaces. By applying Ding’s technique we prove several existence and uniqueness theorems of solutions for the generalized nonlinear mixed variational-like inequality, extend the auxiliary problem technique to suggest and analyze an iterative method to compute the approximate soluti...

this paper presents a model for constrained multiobjective optimization of mixed-cropping planning. the decision challenges that are normally faced by farmers include what to plant, when to plant, where to plant and how much to plant in order to yield maximum output. consequently, the central objective of this work is to concurrently maximize net profit, maximize crop production and minimize pl...

Copyright q 2010 Filomena Cianciaruso et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. We propose a modified hybrid projection algorithm to approximate a common fixed point of a k-strict pseudocontraction and of two sequence...

Microcanonical equilibrium macrostates are characterized as the solutions of a constrained minimization problem, while canonical equilibrium macrostates are characterized as the solutions of a related, unconstrained minimization problem. In the paper [19] by Ellis, Haven, and Turkington, the problem of ensemble equivalence was completely solved at two separate, but related levels: the level of ...

We introduce a new hybrid iterative algorithm for finding a common element of the set of fixed points of an infinite family of nonexpansive mappings, the set of solutions of the variational inequality of a monotone mapping, and the set of solutions of a mixed equilibrium problem. This study, proves a strong convergence theorem by the proposed hybrid iterative algorithm which solves fixed-point ...

among numerous np-hard problems, the traveling salesman problem (tsp) has been one of the most explored, yet unknown one. even a minor modification changes the problem’s status, calling for a different solution. the generalized traveling salesman problem (gtsp)expands the tsp to a much more complicated form, replacing single nodes with a group or cluster of nodes, where the objective is to fi...