semi-infinite programminginvex setinvex functiondualityThe present paper is framed to study weak, strong and strict converse duality relations for a semi-infinite programming problem and its Wolfe and Mond-Weir-type dual programs under generalized -invexity. MSC: 90C32, 49K35, 49N15....
Semi-infinite programming (SIP) problems can be efficiently solved by reduction-type methods. Here, we present a new reduction method for SIP, where the multi-local optimization is carried out with a stretched simulated annealing algorithm, the reduced (finite) problem is approximately solved by a...
In this paper, we consider a class of linear-quadratic semi-infinite programming problems. Using the duality theory, the dual problem is obtained, where the decision variables are measures. A new parameterization scheme is developed for approximating these measures. On this bases, an efficient ...
E. Polak. An implementable algorithm for the optimal design centering, tolerancing and tuning problem, Journal of Optimization Theory and Appli cations, 37:45–67, 1982. Article MathSciNet MATH Google Scholar R. Reemtsen and J.-J. Rückmann (editors). Semi-Infinite Programming, Kluwer, 1998...
A new interface between MATLAB and SIPAMPL was created, allowing the MATLAB semi-infinite programming (SIP) solver to use the SIPAMPL [11] environment to obtain the problem data to be solved. In this paper we present the new developed interface, briefly describe the fseminf MATLAB solver, pro...
A semi-infinite programming problem is an optimization problem in which finitely many variables appear in infinitely many constraints. This model naturally arises in an abundant number of applications in different fields of mathematics, economics and engineering. The paper, which intends to make a comp...
generalized semi-infinite programmingThis article presents a short introduction to semi-infinite programming (SIP), which over the last two decades has become a vivid research area in mathematical programming with a wide range of applications. An SIP problem is characterized by infinitely many ...
A semi-infinite programming problem is an optimization problem in which finitely many variables appear in infinitely many constraints. This model natu- rally arises in an abundant number of applications in different fields of mathe- matics, economics and engineering. The present paper which intends ...
This paper obtains sufficient optimality conditions for a nonlinear nondifferentiable multiobjective semi-infinite programming problem involving generalized (C, α, ρ, d)-convex functions. The authors formulate Mond-Weir-type dual model for the nonlinear nondifferentiable multiobjective semi-infinite progra...
Keywords: Semi-in?nite programming; Applications; Linear semi-in?nite programs; Optimality conditions; Numerical methods 1. Introduction 1.1. Problem formulation A semi-in?nite program (SIP) is an optimization problem in ?nitely many variables x ? ?x1 ; . . . ; xn ? 2 Rn on a feasible ...