On the Existence of Solutions to Vector Quasivariational Inequalities and Quasicomplementarity Problems with Applications Break to Traffic Network Equilibria

For vector quasivariational inequalities involving multifunctions in topological vector spaces, an existence result is obtained without a monotonicity assumption and with a convergence assumption weaker than semicontinuity. A new type of quasivariational inequality is proposed. Applications to quasicomplementarity problems and traffic network equilibria are considered. In particular, definitions of weak and strong Wardrop equilibria are introduced for the case of multivalued cost functions.     

Ekeland’s principle for vector equilibrium problems

In this paper, the authors deal with bifunctions defined on complete metric spaces and with values in locally convex spaces ordered by closed convex cones. The aim is to provide a vector version of Ekeland’s theorem related to equilibrium problems. To prove this principle, a weak notion of continuity of a vector-valued function is considered, and some of its properties are presented. Via the vector Ekeland’s principle, existence results for vector equilibria are proved in both compact and noncompact domains.     

Analysis of atomic arrangement in magnetic Fe–Pt nanoparticles

The order parameter S of Fe–Pt nanoparticles is estimated from X-ray diffraction (XRD) patterns. The total intensity of a diffraction peak is obtained by Rietveld analysis as well as simply integrating the intensity. The Rietveld analysis is found to provide a plausible value of S even for a sample showing an XRD pattern with broad and overlapped peaks. Another order parameter Q, which is obtained from Mössbauer spectra, is introduced, and it is confirmed that Q is equivalent to the probability of Fe atoms being in the L1₀-type atomic arrangement. The coercivity of Fe–Pt nanoparticles is directly proportional to Q, while it vanishes at S=0.4, indicating that the magnetic property of Fe–Pt nanoparticles has a closer relationship to Q than S.     

Strong Vector Equilibrium Problems

In this paper, the existence of the solution for strong vector equilibrium problems is studied by using the separation theorem for convex sets. The arc-wise connectedness and the closedness of the strong solution set for vector equilibrium problems are discussed; and a necessary and sufficient condition for the strong solution is obtained.     

BRILL－NOETHER MATRIX FOR RANK TWO VECTOR BUNDLES

Lei X be an arbitrary smooth irreducible complex projective curve, E (?) X a rank two vector bundle generated by its sections. The author first represents E as a triple {D1,D2,f}, where D1 , D2 are two effective divisors with d = deg(D1) + deg(D2), and f ∈ H0(X, [D1] |D2) is a collection of polynomials. E is the extension of [D2] by [D1] which is determined by f. By using f and the Brill-Noether matrix of D1 + D2, the author constructs a 2g X d matrix WE whose zero space gives Im{H0(X,[D1]) (?) H0(X, [D1] |D1)}(?)Im{H0(X, E) (?) H0(X,[D2]) (?) H0(X,[D2] |D2)}. From this and H0(X,E) = H0(X, [D1]) (?) Im{H0(X, E) (?) H0(X, [D2])}, it is got in particular that dimH0(X, E) = deg(E) - rank(WE) + 2.     

动态规划在教学管理中的应用

本将动态规划理论应用于高校教学管理当中，得出了教学管理中重要的环一排课的最优策略。     

Proper Efficiency in Vector Optimization on Real Linear Spaces

In this paper, we use an algebraic type of closure, which is called vector closure, and through it we introduce some adaptations to the proper efficiency in the sense of Hurwicz, Benson, and Borwein in real linear spaces without any particular topology. Scalarization, multiplier rules, and saddle-point theorems are obtained in order to characterize the proper efficiency in vector optimization with and without constraints. The usual convexlikeness concepts used in such theorems are weakened through the vector closure.     

Preparation of Papers

We motivate the study of a vector variational inequality by a practical flow equilibrium problem on a network, namely a generalization of the well-known Wardrop equilibrium principle. Both weak and strong forms of the vector variational inequality are discussed and their relationships to a vector optimization problem are established under various convexity assumptions.     

Scalarization for pointwise well-posed vectorial problems

The aim of this paper is to develop a method of study of Tykhonov well-posedness notions for vector valued problems using a class of scalar problems. Having a vectorial problem, the scalarization technique we use allows us to construct a class of scalar problems whose well-posedness properties are equivalent with the most known well-posedness properties of the original problem. Then a well-posedness property of a quasiconvex level-closed problem is derived.