All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 7 of 7

Showing per page

Caracterización algebraica de las aristas infinitas en el conjunto dual factible de un PSI-lineal.

Jesús T. Pastor Ciurana (1987)

Trabajos de Investigación Operativa

Las propiedades geométricas del conjunto factible del dual de un problema semiinfinito lineal son análogas a las correspondientes para el caso finito. En este trabajo mostramos cómo, a partir de la caracterización algebraica de vértices y direcciones extremas, se consigue la correspondiente para aristas infinitas, estableciéndose así las bases para una extensión del método simplex a programas semiinfinitos lineales.

Characterizations of ɛ-duality gap statements for constrained optimization problems

Horaţiu-Vasile Boncea, Sorin-Mihai Grad (2013)

Open Mathematics

In this paper we present different regularity conditions that equivalently characterize various ɛ-duality gap statements (with ɛ ≥ 0) for constrained optimization problems and their Lagrange and Fenchel-Lagrange duals in separated locally convex spaces, respectively. These regularity conditions are formulated by using epigraphs and ɛ-subdifferentials. When ɛ = 0 we rediscover recent results on stable strong and total duality and zero duality gap from the literature.

Comparison between different duals in multiobjective fractional programming

Radu Boţ, Robert Chares, Gert Wanka (2007)

Open Mathematics

The present paper is a continuation of [2] where we deal with the duality for a multiobjective fractional optimization problem. The basic idea in [2] consists in attaching an intermediate multiobjective convex optimization problem to the primal fractional problem, using an approach due to Dinkelbach ([6]), for which we construct then a dual problem expressed in terms of the conjugates of the functions involved. The weak, strong and converse duality statements for the intermediate problems allow...

Computation of the distance to semi-algebraic sets

Christophe Ferrier (2010)

ESAIM: Control, Optimisation and Calculus of Variations

This paper is devoted to the computation of distance to set, called S, defined by polynomial equations. First we consider the case of quadratic systems. Then, application of results stated for quadratic systems to the quadratic equivalent of polynomial systems (see [5]), allows us to compute distance to semi-algebraic sets. Problem of computing distance can be viewed as non convex minimization problem: d ( u , S ) = inf x ∈ S ∥ x - u ∥ 2 , where u is in ℛ n . To have, at least, lower approximation of distance, we consider the dual...

Currently displaying 1 – 7 of 7

Page 1