Displaying similar documents to “Efficiency in terms of Lagrangian.”

On dual vector optimization and shadow prices

Letizia Pellegrini (2010)

RAIRO - Operations Research

Similarity:

In this paper we present the image space analysis, based on a general separation scheme, with the aim of studying Lagrangian duality and shadow prices in Vector Optimization. Two particular kinds of separation are considered; in the linear case, each of them is applied to the study of sensitivity analysis, and it is proved that the derivatives of the perturbation function can be expressed in terms of vector Lagrange multipliers or shadow prices.

Penalties, Lagrange multipliers and Nitsche mortaring

Christian Grossmann (2010)

Discussiones Mathematicae, Differential Inclusions, Control and Optimization

Similarity:

Penalty methods, augmented Lagrangian methods and Nitsche mortaring are well known numerical methods among the specialists in the related areas optimization and finite elements, respectively, but common aspects are rarely available. The aim of the present paper is to describe these methods from a unifying optimization perspective and to highlight some common features of them.

Integer programming approaches for minimum stabbing problems

Breno Piva, Cid C. de Souza, Yuri Frota, Luidi Simonetti (2014)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

The problem of finding structures with minimum stabbing number has received considerable attention from researchers. Particularly, [10] study the minimum stabbing number of perfect matchings (mspm), spanning trees (msst) and triangulations (mstr) associated to set of points in the plane. The complexity of the mstr remains open whilst the other two are known to be 𝓝𝓟-hard. This paper presents integer programming (ip) formulations for these three problems, that...

Solving non-holonomic Lagrangian dynamics in terms of almost product structures.

Manuel de León, David Martín de Diego (1996)

Extracta Mathematicae

Similarity:

Given a Lagrangian system with non-holonomic constraints we construct an almost product structure on the tangent bundle of the configuration manifold such that the projection of the Euler-Lagrange vector field gives the dynamics of the system. In a degenerate case, we develop a constraint algorithm which determines a final constraint submanifold where a completely consistent dynamics of the initial system exists.

On constraint qualifications in directionally differentiable multiobjective optimization problems

Giorgio Giorgi, Bienvenido Jiménez, Vincente Novo (2010)

RAIRO - Operations Research

Similarity:

We consider a multiobjective optimization problem with a feasible set defined by inequality and equality constraints such that all functions are, at least, Dini differentiable (in some cases, Hadamard differentiable and sometimes, quasiconvex). Several constraint qualifications are given in such a way that generalize both the qualifications introduced by Maeda and the classical ones, when the functions are differentiable. The relationships between them are analyzed. Finally, we give...