Semi-Infinite programming, that allows for either infinitely many constraints or infinitely many variables but not both, is a natural extension of ordinary mathematical programming. There are many practical as well as theoretical problems in which the constraints depend on time or space and thus can...
D. Papp. Semi-infinite programming using high-degree polynomial interpolants and semidefi- nite programming. SIAM Journal on Optimization, 27(3):1858-1879, January 2017.D. Papp, "Semi-infinite programming using high-degree polynomial interpolants and semidefinite programming", SIAM Journal on ...
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 ...
半无限线性规划问题(Semi-Infinite Linear Programming, SILP)是一类特殊的优化问题,它的一般形式与标准的有限线性规划(Linear Programming, LP)类似,但是约束条件的数量可以是无限的。 尽管约束的数量是无限的,但这些约束往往遵循某种模式或规则,使得它们可以通过有限数量的参数来描述。 SILP的标准形式: 一个SILP问题...
semi-infinite programming_专业资料。We consider an extension of the affine scaling algorithm for linear programming problems with free variables to problems having infinitely many constraints, and explore the relationship between this algorithm and the finite affine scaling method applied to ...
半无穷线性规划(Semi-Infinite Linear Programming, SILP)是一种特殊的线性规划问题,它区别于标准的有限维线性规划问题,因为在约束条件中可能包含无限多个不等式约束。 具体来说,SILP 可以被描述为具有有限个变量但无限多个约束的问题。 这类问题在工程设计、经济模型以及某些物理问题中经常出现。
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 ...
A New Exchange Method for Convex Semi-Infinite Programming In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the propos... L Zhang,SY Wu,MA López - 《Siam Journal on Optimization》...
Duality and saddle-point theory for a class of E_(b,ρ)-convex semi-infinite programming; 一类E_(b,ρ)-凸半无限规划的对偶性及鞍点理论2. Optimality conditions for generalized K-(F,a,p,d)convex semi-infinite programming problem; 一类广义K-(F,a,ρ,d)-凸半无限规划问题的最优性条件3...
1 SEMI-INFINITE PROGRAMMING: The set of feasible points of P D] is denoted by DISCRETIZATION METHODS, SIP F (D) := fx 2 Rn j g(x; y) 0; y 2 Dg and its minimal value by Introduction. In practice, only a nite set of discretized problems P Yi ], i = 0; 1; 2; :::; I;...