We derive necessary and sufficient conditions for optimality of a problem with a pseudoconvex objective function, provided that a finite number of solutions are known. In particular, we obtain that the gradient of the objective function at every minimizer is a product of some positive function and the gradient of the objective function at another fixed minimizer. We apply this condition to prov...

We consider a class of doubly nonlinear degenerate hyperbolicparabolic equations with homogeneous Dirichlet boundary conditions, for which we first establish the existence and uniqueness of entropy solutions. We then turn to the construction and analysis of discrete duality finite volume schemes (in the spirit of Domelevo and Omnès [41]) for these problems in two and three spatial dimensions. W...

in this paper by using the idea of mean convergence, weintroduce an iterative scheme for finding a common element of theset of solutions of an equilibrium problem and the fixed points setof a nonspreading-type mappings in hilbert space. a strongconvergence theorem of the proposed iterative scheme is establishedunder some control conditions. the main result of this paper extendthe results obtain...

Kitahara and Mizuno [3] get upper bounds for the maximum number of different basic feasible solutions generated by Dantzig’s simplex method. In this paper, we obtain lower bounds of the maximum number. Part of the results in this paper are shown in Kitahara and Mizuno [4] as a quick report without proof. They present a simple variant of Klee-Minty’s LP and get a lower bound. In this paper, we e...

We consider a class of doubly nonlinear degenerate hyperbolicparabolic equations with homogeneous Dirichlet boundary conditions, for which we first establish the existence and uniqueness of entropy solutions. We then turn to the construction and analysis of discrete duality finite volume schemes (in the spirit of Domelevo and Omnès [41]) for these problems in two and three spatial dimensions. W...

The examples published by Klee and Minty in 1972 do not preclude the existence of a pivot rule which will make the simplex method, at worst, polynomial. In fact, the continuing success of Dantzig's method suggests that such a rule does exist. A study of known examples shows that (a) those which use selective pivot rules require exponentially large coe cients, and (b) none of the examples' pivot...

This paper discusses a problem in which  decentralized supply chains enter the market simultaneously with no existing rival chains, shape the supply chains’ networks, and set wholesale and retail prices in a noncooperative manner. All the chains produce either identical or highly substitutable products. Customer demand is elastic and price-dependent. A three-step algorithm is proposed to solve ...

We consider a family of linear optimization problems over the n-dimensional Klee—Minty cube and show that the central path may visit all of its vertices in the same order as simplex methods do. This is achieved by carefully adding an exponential number of redundant constraints that forces the central path to take at least 2 − 2 sharp turns. This fact suggests that any feasible path-following in...

We prove a strong convergence result for a sequence generated by Halpern's type iteration for approximating a common fixed point of a countable family of quasi-Lipschitzian mappings in a real Hilbert space. Consequently, we apply our results to the problem of finding a common fixed point of asymptotically nonexpansive mappings, an equilibrium problem, and a variational inequality problem for co...