Lagrange Multiplier Characterizations of Solution Sets of Constrained Nonsmooth Pseudolinear Optimization Problems

This paper deals with the minimization of a class of nonsmooth pseudolinear functions over a closed and convex set subject to linear inequality constraints. We establish several Lagrange multiplier characterizations of the solution set of the minimization problem by using the properties of locally Lipschitz pseudolinear functions. We also consider a constrained nonsmooth vector pseudolinear optimization problem and derive certain conditions, under which an efficient solution becomes a properly efficient solution. The results presented in this paper are more general than those existing in the literature.     

Invariant Pseudolinearity with Applications

In this paper, we introduce the notion of invariant pseudolinearity for nondifferentiable and nonconvex functions by means of Dini directional derivatives. We present some characterizations of invariant pseudolinear functions. Some characterizations of the solution set of a nonconvex and nondifferentiable, but invariant, pseudolinear program are obtained. The results of this paper extend various results for pseudolinear functions, pseudoinvex functions, and η-pseudolinear functions, and also for pseudoinvex programs, pseudolinear programs, and η-pseudolinear programs.     

Generalized pseudolinearity

In this paper, we introduce the notion of generalized pseudolinearity for nondifferentiable and nonconvex but locally Lipschitz functions defined on a Banach space. We present some characterizations of generalized pseudolinear functions. The characterizations of the solution set of a nonconvex and nondifferentiable but generalized pseudolinear program are obtained. The results of this paper extend various results for pseudolinear functions, pseudoinvex functions and η-pseudolinear functions, and also for pseudoinvex programs, pseudolinear programs and η-pseudolinear programs.     

Characterizations of solution sets of mathematical programs in terms of Lagrange multipliers

The main aim of this article is to obtain characterizations of the solution set of two non-linear programs in terms of Lagrange multipliers. Both the programs have pseudolinear constraints but the objective function is convex for the first program and pseudolinear for the second program, where all the functions are defined in terms of bifunctions.     

Some results on pseudolinear quadratic fractional functions

In the paper, the affinity of quadratic fractional functions and the gradient of pseudolinear quadratic fractional functions are characterized. This research was supported in part by the Hungarian Scientific Research Fund, Grant No. OTKA-T043276 and OTKA-K60480.     

非光滑伪线性多目标规划对偶

本文利用Ｄｉｎｉ右上、右下导数给出了非光滑伪线性多目标规划的对偶理论，建立了Ｍｏｎｄ－Ｗｅｉｒ型对仍与Ｗｏｌｆ型对偶；并证明了原问题与对偶问题之间的对偶定理．     

Vector Variational Inequality and Vector Pseudolinear Optimization

The study of a vector variational inequality has been advanced because it has many applications in vector optimization problems and vector equilibrium flows. In this paper, we discuss relations between a solution of a vector variational inequality and a Pareto solution or a properly efficient solution of a vector optimization problem. We show that a vector variational inequality is a necessary and sufficient optimality condition for an efficient solution of the vector pseudolinear optimization problem.     

A new look at fractional programming

The parametric approach to fractional programming problems is examined and a new format is proposed for it. The latter reflects the fact that the approach as a whole capitalizes on a first-order necessary and sufficient optimality condition pertaining to differentiable pseudolinear functions.     

悬臂梁大挠度问题的双参数摄动解

利用拟线性分析方法中的一阶导数代换对基本方程进行了简化处理,将基本的微分积分方程转化为非线性代数方程组,并结合双参数摄动研究了悬臂梁的大挠度问题．与已有的研究结果比较表明: 将拟线性方法用于研究悬臂梁的大挠度问题,计算较为简便, 同时又具有良好的精度．     

On sufficiency and duality for a class of interval-valued programming problems

In this paper, we are concerned with an interval-valued programming problem. Sufficient optimality conditions are established under generalized convex functions for a feasible solution to be an efficient solution. Appropriate duality theorems for Mond-Weir and Wolfe type duals are discussed in order to relate the efficient solutions of primal and dual programs.     

Van der Pol方程周期解的分解算法

1 引言 动力系统周期解方程的研究是一个重要而有兴趣的问题,当系统周期解的方程能够写出来时,不但可以确定它的准确或近似位置,而且还可以研究当周期解因微分方程中的参数变动而消失时,它是否跑到二维复空间中去,对于人所熟知的van der Pol方程     

Second-Order Duality in Multiobjective Programming Involving (F, α, ρ, d)-V-Type I Functions

In this paper, a new class of second-order (F, α, ρ, d)-V-type I functions is introduced that generalizes the notion of (F, α, ρ, θ)-V-convex functions introduced by Zalmai (Computers Math. Appl. 2002; 43:1489–1520) and (F, α, ρ, p, d)-type I functions defined by Hachimi and Aghezzaf (Numer. Funct. Anal. Optim. 2004; 25:725–736). Based on these functions, weak, strong, and strict converse duality theorems are derived for Wolfe and Mond–Weir type multiobjective dual programs in order to relate the efficient and weak efficient solutions of primal and dual problems.     

On the Pseudolinear Crossing Number

A drawing of a graph is pseudolinear if there is a pseudoline arrangement such that each pseudoline contains exactly one edge of the drawing. The pseudolinear crossing number of a graph G is the minimum number of pairwise crossings of edges in a pseudolinear drawing of G. We establish several facts on the pseudolinear crossing number, including its computational complexity and its relationship to the usual crossing number and to the rectilinear crossing number. This investigation was motivated by open questions and issues raised by Marcus Schaefer in his comprehensive survey of the many variants of the crossing number of a graph.     

Pseudolinear fuzzy mappings

Two classes of fuzzy mappings, called pseudolinear and η-pseudolinear fuzzy mappings are introduced by relaxing the definitions of pseudo-convex and pseudo-invex fuzzy mappings. First, some characterizations of pseudolinear and η-pseudolinear fuzzy mappings are obtained. Then, characterizations of the solution sets of pseudolinear and η-pseudolinear fuzzy programs are derived.     

局部Lipschitz连续的伪线性函数的性质

本文使用Clarke次微分分析了定义在Banach空间的局部Lipschitz连续的伪线性函数的性质,并且考虑了伪线性规划解集的性质.     

伪线性映射及其变分不等式解的特征

研究拓扑向量空间到其共轭空间的伪线性映射和其变分不等式问题,给出伪线性映射的几个等价形式,并对伪线性映射的变分不等式解集的特征进行了刻画.     

A graphical characterization of the efficient set for?convex multiobjective problems

In this paper, a graphical characterization, in the decision space, of the properly efficient solutions of a convex multiobjective problem is derived. This characterization takes into account the relative position of the gradients of the objective functions and the active constraints at the given feasible solution. The unconstrained case with two objective functions and with any number of functions and the general constrained case are studied separately. In some cases, these results can provide a visualization of the efficient set, for problems with two or three variables. Besides, a proper efficiency test for general convex multiobjective problems is derived, which consists of solving a single linear optimization problem.     

Criteria for efficiency in vector optimization

We consider unconstrained finite dimensional multi-criteria optimization problems, where the objective functions are continuously differentiable. Motivated by previous work of Brosowski and da Silva (1994), we suggest a number of tests (TEST 1–4) to detect, whether a certain point is a locally (weakly) efficient solution for the underlying vector optimization problem or not. Our aim is to show: the points, at which none of the TESTs 1–4 can be applied, form a nowhere dense set in the state space. TESTs 1 and 2 are exactly those proposed by Brosowski and da Silva. TEST 3 deals with a local constant behavior of at least one of the objective functions. TEST 4 includes some conditions on the gradients of objective functions satisfied locally around the point of interest. It is formulated as a Conjecture. It is proven under additional assumptions on the objective functions, such as linear independence of the gradients, convexity or directional monotonicity. This work was partially supported by grant 55681 of the CONACyT.     

On pseudolinear functions

In this paper the structure of a smooth pseudolinear function is investigated and the general form of the gradient is given explicitly.     

Choosing weights from alternative optimal solutions of dual multiplier models in DEA

In this paper we propose a two-step procedure to be used for the selection of the weights that we obtain from the multiplier model in a DEA efficiency analysis. It is well known that optimal solutions of the envelopment formulation for extreme efficient units are often highly degenerate and, consequently, have alternate optima for the weights. Different optimal weights may then be obtained depending, for instance, on the software used. The idea behind the procedure we present is to explore the set of alternate optima in order to help make a choice of optimal weights. The selection of weights for a given extreme efficient point is connected with the dimension of the efficient facets of the frontier. Our approach makes it possible to select the weights associated with the facets of higher dimension that this unit generates and, in particular, it selects those weights associated with a full dimensional efficient facet (FDEF) if any. In this sense the weights provided by our procedure will have the maximum support from the production possibility set. We also look for weights that maximize the relative value of the inputs and outputs included in the efficiency analysis in a sense to be described in this article.