Generalized fractional programming problems containing locally subdifferentiable and ρ-Univex functions

Parametric and nonparametric sufficient optimality conditions are established for a class of nonsmooth generalized fractional programming problems containing ρ-univex functions. Subsequently, these optimality criteria are utilized as a basis for construction of two parametric and four parameter–free duality models and proving appropriate duality theorems     

Optimality conditions and duality for a class of nondifferentiable multiobjective generalized fractional programming problems

This paper studies a class of multiobjective generalized fractional programming problems, where the numerators of objective functions are the sum of differentiable function and convex function, while the denominators are the difference of differentiable function and convex function. Under the assumption of Calmness Constraint Qualification the Kuhn-Tucker type necessary conditions for efficient solution are given, and the Kuhn-Tucker type sufficient conditions for efficient solution are presented under the assumptions of （F, α, ρ, d）-V-convexity. Subsequently, the optimality conditions for two kinds of duality models are formulated and duality theorems are proved.     

Optimality conditions and Mond–Weir duality for a class of differentiable semi-infinite multiobjective programming problems with vanishing constraints

4OR - In this paper, the class of differentiable semi-infinite multiobjective programming problems with vanishing constraints is considered. Both Karush–Kuhn–Tucker necessary optimality...     

Semi-infinite programming,duality, discretization and optimality conditions†

The aim of this article is to give a survey of some basic theory of semi-infinite programming. In particular, we discuss various approaches to derivations of duality, discretization, and first- and second-order optimality conditions. Some of the surveyed results are well known while others seem to be less noticed in that area of research.     

Second order duality for nondifferentiable multiobjective programming problem involving (F, α, ρ, d)-V-type I functions

In this paper, new classes of second order (F, α, ρ, d)-V-type I functions for a nondifferentiable multiobjective programming problem are introduced. Furthermore, second order Mangasarian type and general Mond-Weir type duals problems are formulated for a nondifferentiable multiobjective programming problem. Weak strong and strict converse duality theorems are studied in both cases assuming the involved functions to be second order (F, α, ρ, d)-V-type I.     

ε-optimality criteria for convex programming problems via exact penalty functions

In this paper, we present-optimality criteria for convex programming problems associated with exact penalty functions. Several authors have given various criteria under the assumption that such convex problems and the associated dual problems can be solved. We assume the solvability of neither the convex problem nor the dual problem. To derive our criteria, we estimate the size of the penalty parameter in terms of an-solution for the dual problem.     

Nonlinear generalized functions and jump conditions for a standard one pressure liquid–gas model

The mixture of a liquid and a gas is classically represented by one pressure models. These models are a system of PDEs in nonconservative form and shock wave solutions do not make sense within the theory of distributions: they give rise to products of distributions that are not defined within distribution theory. But they make sense by applying a theory of nonlinear generalized functions to these equations. In contrast to the familiar case of conservative systems the jump conditions cannot be calculated a priori. Jump conditions for these nonconservative systems can be obtained using the theory of nonlinear generalized functions by inserting some adequate physical information into the equations. The physical information that we propose to insert for the one pressure models of a mixture of a liquid and a gas is a natural mathematical expression in the theory of nonlinear generalized functions of the fact that liquids are practically incompressible while gases are very compressible, and so they do not satisfy equally well their respective state laws on the shock waves. This modelization gives well defined explicit jump conditions. The great numerical difficulty for solving numerically nonconservative systems is due to the fact that slightly different numerical schemes can give significantly different results. The jump conditions obtained above permit to select the numerical schemes and validate those that give numerical solutions that satisfy these jump conditions, which can be an important piece of information in the absence of other explicit discontinuous solutions and of precise observational results. We expose with care the mathematical originality of the theory of nonlinear generalized functions (an original abstract analysis issued by the Leopoldo Nachbin team on infinite dimensional holomorphy) that permits to state mathematically physical facts that cannot be formulated within distribution theory, and are the key for the removal of “ambiguities” that classically appear when one tries to calculate on “multiplications of distributions” that occur in the differential equations of physics.     

The Karush–Kuhn–Tucker optimality conditions in multiobjective programming problems with interval-valued objective functions

The KKT conditions in multiobjective programming problems with interval-valued objective functions are derived in this paper. Many concepts of Pareto optimal solutions are proposed by considering two orderings on the class of all closed intervals. In order to consider the differentiation of an interval-valued function, we invoke the Hausdorff metric to define the distance between two closed intervals and the Hukuhara difference to define the difference of two closed intervals. Under these settings, we are able to consider the continuity and differentiability of an interval-valued function. The KKT optimality conditions can then be naturally elicited.     

A generalized Dantzig—Wolfe decomposition principle for a class of nonconvex programming problems

Since Dantzig—Wolfe's pioneering contribution, the decomposition approach using a pricing mechanism has been developed for a wide class of mathematical programs. For convex programs a linear space of Lagrangean multipliers is enough to define price functions. For general mathematical programs the price functions could be defined by using a subclass of nondecreasing functions. However the space of nondecreasing functions is no longer finite dimensional. In this paper we consider a specific nonconvex optimization problem min {f(x):h _j (x)g(x),j=1, ,m, xX}, wheref(·),h _j (·) andg(·) are finite convex functions andX is a closed convex set. We generalize optimal price functions for this problem in such a way that the parameters of generalized price functions are defined in a finite dimensional space. Combining convex duality and a nonconvex duality we can develop a decomposition method to find a globally optimal solution.This paper is dedicated to Phil Wolfe on the occasion of his 65th birthday.     

Hölder continuity results for nonconvex parametric generalized vector quasiequilibrium problems via nonlinear scalarizing functions

In this paper, new results for Hölder continuity of the unique solution to a parametric generalized vector quasiequilibrium problem are established via nonlinear scalarization, with and without using the free-disposal condition. Especially, a new kind of monotonicity hypothesis is proposed. The globally Lipschitz property together with other useful properties of the well-known Gerstewitz nonlinear scalarization function are fully exploited for proving. Moreover, our approach does not impose any convexity condition on the considered model. The oriented distance function is also employed for studying Hölder continuity.     

Tensor Green’s functions for axisymmetrical models of magnetotelluric marine sounding of locally nonhomogeneous layered media

A method for computing the electromagnetic fields of point (dipole) sources is proposed for magnetotelluric sounding (MTS) problems in axisymmetrical conducting layered media. The method expands the tensor Green’s functions of the layered medium in Fourier series in the azimuthal coordinate. For an arbitrary system of point sources we construct algorithms to compute the electromagnetic fields propagating across the plane interface of two conducting half-spaces with different constant conductivities. Translated from Prikladnaya Matematika i Informatika, No. 30, pp. 5–17, 2008.     

Heuristics and reduction methods for multiple constraints 0–1 linear programming problems

This work extends the efficient results relative to the 0–1 knapsack problem to the multiple inequality constraints 0–1 linear programming problems. The two crucial phases for the solving of this type of problems are presented: (i) Two linear expected time complexity greedy algorithms are proposed for the determination of a lower bound on the optimal value by using a cascade of surrogate relaxations of the original problem whose sizes are decreasing step by step. A comparative study with the best known heuristic methods is reported; it concerned the accuracy of the approximate solutions and the practical computational times. (ii) This greedy algorithm is inserted in an efficient reduction framework. Variables and constraints are eliminated by the conjunction of tests applied to Lagrangean and surrogate relaxations of the original problem. A lot of computational results are summarized by considering test problems of the literature.     

Large deviations for generalized compound Poisson risk models and its bankruptcy moments

We extend the classical compound Poisson risk model to the case where the premium income process, based on a Poisson process, is no longer a linear function. For this more realistic risk model, Lundberg type limiting results on the finite time ruin probabilities are derived. Asymptotic behaviour of the tail probabilities of the claim surplus process is also investigated.     

Positivity conditions and bounds for Green’s functions for higher order two-point BVP

We consider a linear nonautonomous higher order ordinary differential equation and establish the positivity conditions and two-sided bounds for Green’s function for the two-point boundary value problem. Applications of the obtained results to nonlinear equations are also discussed.     

Congruences for Ramanujan’s f and ω functions via generalized Borcherds products

Bruinier and Ono recently developed the theory of generalized Borcherds products, which uses coefficients of certain Maass forms as exponents in infinite product expansions of meromorphic modular forms. Using this, one can use classical results on congruences of modular forms to obtain congruences for Maass forms. In this note we work out the example of Ramanujan’s mock theta functions f and ω in detail.     

High-order generalized Gauss–Radau and Gauss–Lobatto formulae for Jacobi and Laguerre weight functions

The generation of generalized Gauss–Radau and Gauss–Lobatto quadrature formulae by methods developed by us earlier breaks down in the case of Jacobi and Laguerre measures when the order of the quadrature rules becomes very large. The reason for this is underflow resp. overflow of the respective monic orthogonal polynomials. By rescaling of the polynomials, and other corrective measures, the problem can be circumvented, and formulae can be generated of orders as high as 1,000. In memoriam Gene H. Golub.