Generalization of domination structures and nondominated solutions in multicriteria decision making

The concepts of domination structures and nondominated solutions are important in tackling multicriteria decision problems. We relax Yu's requirement that the domination structure at each point of the criteria space be a convex cone (Ref. 1) and give results concerning the set of nondominated solutions for the case where the domination structure at each point is a convex set. A practical necessity for such a generalization is discussed. We also present conditions under which a locally nondominated solution is also a globally nondominated solution.     

Quasiconcavity and nondominated solutions in multiobjective programming

In the multiobjective programming literature, the concavity of the objectives is usually assumed to be a sufficient condition in seeking Pareto-optimal solutions. This paper investigates nondominated solutions associated with dominance cones via the assumption of the quasiconcavity of the objectives. Necessary as well as sufficient conditions for such quasiconcave multiobjective programming problems are obtained.The author is indebted to one of the referees for detailed constructive comments and suggestions. Thanks are also due to the late Professor Abraham Charnes, University of Texas at Austin, and Professor Zhimin Huang, Adelphi University.     

Second-order optimality conditions for nondominated solutions of multiobjective programming with C 1,1 data

We examine new second-order necessary conditions and sufficient conditions which characterize nondominated solutions of a generalized constrained multiobjective programming problem. The vector-valued criterion function as well as constraint functions are supposed to be from the class C ^1,1. Second-order optimality conditions for local Pareto solutions are derived as a special case.     

Multiple criteria decision problems with fuzzy domination structures

The concepts of domination structures and nondominated solutions in multiple criteria decision problems, which were introduced by Yu, enable us to tackle general situations in which there exists information concerning the decision maker's preferences.In many of the multiple criteria decision problems the underlying domination structures are not known precisely but only fuzzily determined. Yu primarily works with the case where the domination structure at each point is a convex cone. As a result, there exists a sharp borderline dividing all solutions into nondominated solutions and the others.This paper fuzzifies the concepts of domination structures and nondominated solutions to allow them to be applied to a larger class of the multiple criteria decision problems mentioned above. Introducing the concepts of fuzzy convex cones and fuzzy polar cones, it is shown how some of the main results obtained by Yu are extended.     

Necessary and sufficient conditions for the existence of symmetric positive solutions of singular boundary value problems

Necessary and sufficient conditions are obtained for the existence of symmetric positive solutions to the boundary value problem

     

Necessary and sufficient conditions of optimality for some classical scheduling problems

A scheduling problem is generally to order the jobs such that a certain objective function f(π) is minimized. For some classical scheduling problems, only sufficient conditions of optimal solutions are concerned in the literature. In this paper, we study the necessary and sufficient conditions by means of the concept of critical ordering (critical jobs and their relations). These results are meaningful in recognition and characterization of optimal solutions of scheduling problems.     

任意阶中立型方程正解存在的充要条件

给出了任意阶中立型微分方程（x(t)-p(t)g(x(τ(t)))^(n) ∫α^βt(t,ξ，x(g1(t,ξ）），x(g2(t,ξ）），…，x(gm(t,ξ）））dη（ξ）=0存在正解x(t)满足x(t)-p(t)g(x(τ(t)))/t^k→正常数（→∞)物条件，作为本文结果的特例，部分地解决了文[5]提出的公开问题2。     

Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems

In this paper we consider the standard linear SDP problem, and its low rank nonlinear programming reformulation, based on a Gramian representation of a positive semidefinite matrix. For this nonconvex quadratic problem with quadratic equality constraints, we give necessary and sufficient conditions of global optimality expressed in terms of the Lagrangian function.     

Boundary value problems with global projection conditions

Parametrices of elliptic boundary value problems for differential operators belong to an algebra of pseudodifferential operators with the transmission property at the boundary. However, generically, smooth symbols on a manifold with boundary do not have this property, and several interesting applications require a corresponding more general calculus. We introduce here a new algebra of boundary value problems that contains Shapiro-Lopatinskij elliptic as well as global projection conditions; the latter ones are necessary, if an analogue of the Atiyah-Bott obstruction does not vanish. We show that every elliptic operator admits (up to a stabilisation) elliptic conditions of that kind. Corresponding boundary value problems are then Fredholm in adequate scales of spaces. Moreover, we construct parametrices in the calculus.     

Necessary and sufficient optimality conditions for fractional multi-objective problems

Using a special scalarization, we give necessary optimality conditions for fractional multiobjective optimization problems. Under a generalized invexity, sufficient optimality conditions are also given. All over the article, the data are assumed to be continuous but not necessarily Lipschitz.     

Necessary and sufficient conditions for existence of blow‐up solutions for elliptic problems in Orlicz–Sobolev spaces

This paper is principally devoted to revisit the remarkable works of Keller and Osserman and generalize some previous results related to the those for the class of quasilinear elliptic problem where either with is a smooth bounded domain or . The function ϕ includes special cases appearing in mathematical models in nonlinear elasticity, plasticity, generalized Newtonian fluids, and in quantum physics. The proofs are based on comparison principle, variational methods and topological arguments on the Orlicz–Sobolev spaces.     

A global differentiability result for solutions of nonlinear elliptic problems with controlled growths

Let Ω be a bounded open subset of ℝ ⁿ , n > 2. In Ω we deduce the global differentiability result

Necessary and sufficient conditions for the existence of complementary solutions and characterizations of the matrix classesQ andQ 0

We simplify a result by Mangasarian on the existence of solutions to the linear complementarity problem. The simplified condition gives a new geometric interpretation of the result. When used to characterize the matrix classesQ andQ ₀, our condition suggests a finitely checkable sufficient condition forP andP ₀.This work was supported in part by the Office of Naval Research under Contract No. N00014-86-K-0173, and by general research development funds provided by the Georgia Institute of Technology.     

Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints

In this paper we consider a mathematical program with equilibrium constraints (MPEC) formulated as a mathematical program with complementarity constraints. Various stationary conditions for MPECs exist in literature due to different reformulations. We give a simple proof to the M-stationary condition and show that it is sufficient for global or local optimality under some MPEC generalized convexity assumptions. Moreover, we propose new constraint qualifications for M-stationary conditions to hold. These new constraint qualifications include piecewise MFCQ, piecewise Slater condition, MPEC weak reverse convex constraint qualification, MPEC Arrow-Hurwicz-Uzawa constraint qualification, MPEC Zangwill constraint qualification, MPEC Kuhn-Tucker constraint qualification, and MPEC Abadie constraint qualification.     

线性约束三次规划问题的全局最优性必要条件和最优化算法

讨论了带线性不等式约束三次规划问题的最优性条件和最优化算法. 首先, 讨论了带有线性不等式约束三次规划问题的 全局最优性必要条件. 然后, 利用全局最优性必要条件, 设计了解线性约束三次规划问题的一个新的局部最优化算法(强局部最优化算法). 再利用辅助函数和所给出的新的局部最优化算法, 设计了带有线性不等式约束三 规划问题的全局最优化算法. 最后, 数值算例说明给出的最优化算法是可行的、有效的.