In generalized semi-infinite programming the feasible set is known to be not closed in general. In this paper, under natural and generic assumptions, the closure of the feasible set is described in explicit terms.

We use graph convergence of set valued maps to show the existence of an equilibrium for an abstract economy without assuming the lower semi continuity of the constraint maps.

On-line algorithms have been extensively studied for the onedimensional bin packing problem. Semi-online property relax the online prescription in such a way that it allows some extra operations or the algorithm knows more (e.g. the optimum value) in advance. In this paper we present an improved lower bound for the asymptotic competitive ratio of any on-line bin packing algorithm which knows th...

in this paper, we introduce and study the concept of $r$-fuzzy regular semi open (closed) sets in smooth topological spaces. by using $r$-fuzzy regular semi open (closed) sets, we define a new fuzzy closure operator namely $r$-fuzzy regular semi interior (closure) operator. also, we introduce fuzzy regular semi continuous and fuzzy regular semi irresolute mappings. moreover, we investigate the ...

 We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...

We consider a robust analog of the planted clique problem. In this analog, a set S of vertices is chosen and all edges in S are included; then, edges between S and the rest of the graph are included with probability 12 , while edges not touching S are allowed to vary arbitrarily. For this semi-random model, we show that the information-theoretic threshold for recovery is Θ̃( √ n), in sharp contr...

Multi-robot formation control enables robots to cooperate as a working group in completing complex tasks, which has been widely used in both civilian and military scenarios. Before moving to reach a given formation, each robot should choose a position from the formation so that the whole system cost is minimized. To solve the problem, we formulate an optimization problem in terms of the total m...

We study incremental problems in geometrically nonlinear elastoplasticity. Using the multiplicative decomposition Dφ = FelFpl we consider general energy functionals of the form

On-line algorithms have been extensively studied for the onedimensional bin packing problem. Semi-online property relax the online prescription in such a way that it allows some extra operations or the algorithm knows more (e.g. the optimum value) in advance. In this paper we present an improved lower bound for the asymptotic competitive ratio of any on-line bin packing algorithm which knows th...