The Equality–Inequality Dialectics

The assay argues that the Equality-Inequality dialectics is a very complex issue,which reflects many social dilemmas.On one side are the state official commitments to secure,maintain and protect all kinds of formal equalities.On the other side are the natural and genetic distinctions that differ between human-beings while creating and maintaining inequality.In fact,this is kind of a contradiction exists in many fields of social sciences.The essay’s author reviews some of the relevant historical events,such as social mobility,individualism and education and points out on future solutions.Among the proposed suggestions are:1)Embracing Frankl’s giving“Meaning to Life”as a leverage for increasing pleasure of life;2)Recognizing and promoting Creative Individualism as the legitimized ground for inequality;3)Increasing Social Cohesion,required for social empowerment and attaining security and happiness.

A 2.79 COMPETITIVE ON-LINE ALGORITHM FOR TWO PROCESSOR REAL-TIME SYSTEMS WITH UNIFORM VALUE DENSITY

In this paper, a new superlinearly convergent algorithm is presented for optimization problems with general nonlinear equality and inequality constraints. Comparing with other methods for these problems, the algorithm has two main advantages. First, it doesn’t solve any quadratic programming (QP), and its search directions are determined by the generalized projection technique and the solutions of two systems of linear equations. Second, the sequential points generated by the algorithm satisfy all inequality constraints and its step length is computed by the straight line search. The algorithm is proved to possess global and superlinear convergence.

Parametric Duality Models for Semi-infinite Discrete Minmax Fractional Programming Problems Involving Generalized (η,ρ)-Invex Functions

A semi-infinite programming problem is a mathematical programming problem with a finite number of variables and infinitely many constraints. Duality theories and generalized convexity concepts are important research topics in mathematical programming. In this paper, we discuss a fairly large number of paramet- ric duality results under various generalized （η,ρ）-invexity assumptions for a semi-infinite minmax fractional programming problem.

Global Parametric Sufficient Optimality Conditions for Semi-infinite Discrete Minmax Fractional Programming Problems Involving Generalized (η,ρ)-invex Functions

In this paper, we discuss a large number of sets of global parametric sufficient optimality conditions under various generalized （η,ρ）-invexity assumptions for a semi-infinite minmax fractional programming problem.

Parametric Duality Models for Semiinfinite Multiobjective Fractional Programming Problems Containing Generalized (α, η, ρ)-V-Invex Functions

In this paper, we present several parametric duality results under various generalized （a,v,p）-V- invexity assumptions for a semiinfinite multiobjective fractional programming problem.

Global Parametric Sufficient Efficiency Conditions for Semiinfinite Multiobjective Fractional Programming Problems Containing Generalized (α, η, ρ)-V-Invex Functions

Abstract In this paper, we discuss numerous sets of global parametric sufficient efficiency conditions under various generalized （a,n, p）-V-invexity assumptions for a semiinfinite multiobjective fractional programming problem.