Pseudo-invexity and duality in nonlinear programming

The purpose of this paper is to study various duality results in nonlinear programming for pseudo-invex functions. Such results were known in the literature for invex functions.     

Duality for Variational Problems with Pseudo-Invexity

In this paper the duality results of Mond, Chandra and Husain for variational problems are extended to generalized invex (pseudo-invex) functions     

Multiobjective symmetric duality with cone constraints

We formulate a pair of multiobjective symmetric dual programs for pseudo-invex functions and arbitrary cones. Our model is unifying the Wolfe vector symmetric dual and the Mond-Weir vector symmetric dual models. We establish the weak, strong, converse and self duality theorems for our pair of dual models. Nanda and Das' results (Optimization 28 (1994) 267; Eur. J. Oper. Res. 88 (1996) 572) are obtained as special cases.     

The Karush–Kuhn–Tucker optimality conditions for fuzzy optimization problems

This paper considers optimization problems with fuzzy-valued objective functions. For this class of fuzzy optimization problems we obtain Karush–Kuhn–Tucker type optimality conditions considering the concept of generalized Hukuhara differentiable and pseudo-invex fuzzy-valued functions.     

Generalized nonsmooth invexity over cones in vector optimization

In this paper K-nonsmooth quasi-invex and (strictly or strongly) K-nonsmooth pseudo-invex functions are defined. By utilizing these new concepts, the Fritz–John type and Kuhn–Tucker type necessary optimality conditions and number of sufficient optimality conditions are established for a nonsmooth vector optimization problem wherein Clarke’s generalized gradient is used. Further a Mond Weir type dual is associated and weak and strong duality results are obtained.     

Criteria for generalized invex monotonicities

In this paper, under appropriate conditions, we establish that (i) if the gradient of a function is (strictly) pseudo-monotone, then the function is (strictly) pseudo-invex; (ii) if the gradient of a function is quasi-monotone, then the function is quasi-invex; and (iii) if the gradient of a function is strong pseudo-monotone, then the function is strong pseudo-invex.     

Converse duality in nonlinear programming with cone constraints

The purpose of this paper is to establish various converse duality results for nonlinear programming with cone constraints and its four dual models introduced by Chandra and Abha [S. Chandra, Abha, A note on pseudo-invex and duality in nonlinear programming, European Journal of Operational Research 122 (2000) 161–165].     

Generalized invexity and duality in multiobjective nonlinear programming

The purpose of this paper is to study the duality theorems in cone constrained multiobjective nonlinear programming for pseudo-invex objectives and quasi-invex constrains and the constraint cones are arbitrary closed convex ones and not necessarily the nonnegative orthants.     

Second order symmetric duality in multiobjective programming

A pair of Mond–Weir type multiobjective second order symmetric dual programs are formulated without non-negativity constraints. Weak duality, strong duality and converse duality theorems are established under η-bonvexity and η-pseudobonvexity assumptions. A second order self-duality theorem is given by assuming the functions involved to be skew-symmetric.     

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.     

Bounds for the product of modified Bessel functions

In this note our aim is to present some monotonicity properties of the product of modified Bessel functions of the first and second kind. Certain bounds for the product of modified Bessel functions of the first and second kind are also obtained. These bounds improve and extend known bounds for the product of modified Bessel functions of the first and second kind of order zero. A new Turán type inequality is also given for the product of modified Bessel functions, and some open problems are stated, which may be of interest for further research.     

Second Order (F, α, ρ, d,E)-convex function and the Duality Problem

A class of second order (F, α, ρ, d, E)-convex functions and their generalization on functions involved, weak, strong, and converse duality theorems are established for a second order Mond-Weir type dual problem.     

一类多目标分式规划的二阶对称对偶问题

研究一类多目标分式规划的二阶对称对偶问题.在二阶F-凸性假设下给出了对偶问题的弱对偶、强对偶和逆对偶定理.并在对称和反对称假设下研究了该问题的自身对偶性.     

An algorithmic decomposition system for second order recurrence relations

A new technique of accurate stable computation of sequences satisfying non-homogeneous three term recurrence relations is presented. A decomposition system consisting of one non-linear and two linear first order recurrence relations is obtained. Forward or backward recursion directions of the linear relations provide additional flexibility in computation. This leads to an integrated system of three algorithms which can accurately compute the desired solution in each region of the solution set to the original second order relations. Applications are well known and numerical examples include Bessel functions of the second kind, Anger-Weber functions, and Lommel functions.     

Second-order mollified derivatives and optimization

The class of strongly semicontinuous functions is considered. For these functions the notion of mollified derivatives, introduced by Ermoliev, Norkin and Wets, is extended to the second order. By means of a generalized Taylor’s formula, second order necessary conditions are proved for both unconstrained and constrained optimization.     

Calculus of variations on time scales: weak local piecewise Crd solutions with variable endpoints

A nonlinear calculus of variations problem on time scales with variable endpoints is considered. The space of functions employed is that of piecewise rd-continuously Δ-differentiable functions (C¹_prd). For this problem, the Euler-Lagrange equation, the transversality condition, and the accessory problem are derived as necessary conditions for weak local optimality. Assuming the coercivity of the second variation, a corresponding second order sufficiency criterion is established.     

Higher order spt-functions

Andrews? spt-function can be written as the difference between the second symmetrized crank and rank moment functions. Using the machinery of Bailey pairs a combinatorial interpretation is given for the difference between higher order symmetrized crank and rank moment functions. This implies an inequality between crank and rank moments that was only known previously for sufficiently large n and fixed order. This combinatorial interpretation is in terms of a weighted sum of partitions. A number of congruences for higher order spt-functions are derived.     

二阶椭圆问题基于泡函数的简化的稳定化二阶混合有限元格式

本文研究二阶椭圆方程基于泡函数的稳定化的二阶混合有限元格式,通过消去泡函数导出一种自由度很少的简化的稳定化的二阶混合有限元格式, 误差分析表明消去泡函数的简化格式与带有泡函数的格式具有相同的精度而可以节省6N_p个自由度(其中N_p三角形剖分中的顶点数目).       

The exact number of solutions for the second order nonlinear boundary value problem

A second order nonlinear differential equation with homogeneous Dirichlet boundary conditions is considered. An explicit expression for the root functions for an autonomous nonlinear boundary value problem is obtained using the results of the paper [SOMORA, P.: The lower bound of the number of solutions for the second order nonlinear boundary value problem via the root functions method, Math. Slovaca 57 (2007), 141–156]. Other assumptions are supposed to prove the monotonicity of root functions and to get the exact number of solutions. The existence of infinitely many solutions of the boundary value problem with strong nonlinearity is obtained by the root function method as well. The paper was supported by the Grant VEGA No. 2/7140/27, Bratislava.     

A second order <Emphasis Type="Italic">η</Emphasis>-approximation method for constrained optimization problems involving second order invex functions

A new approach for obtaining the second order sufficient conditions for non-linear mathematical programming problems which makes use of second order derivative is presented. In the so-called second order η-approximation method, an optimization problem associated with the original nonlinear programming problem is constructed that involves a second order η-approximation of both the objective function and the constraint function constituting the original problem. The equivalence between the nonlinear original mathematical programming problem and its associated second orderη-approximated optimization problem is established under second order invexity assumption imposed on the functions constituting the original optimization problem.