Generalized Lagrange multiplier rule for non-convex vector optimization problems
From MaRDI portal
Publication:5741033
DOI10.1017/S0308210515000463zbMath1352.90075MaRDI QIDQ5741033
Publication date: 20 July 2016
Published in: Proceedings of the Royal Society of Edinburgh: Section A Mathematics (Search for Journal in Brave)
Nonconvex programming, global optimization (90C26) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)
Cites Work
- Duality theory and applications to unilateral problems
- Lagrangean variables in infinite dimensional spaces for a dynamic economic equilibrium problem
- Walrasian equilibrium problem with memory term
- The infinite dimensional Lagrange multiplier rule for convex optimization problems
- Lagrangian conditions for vector optimization in Banach spaces
- Bounded sets of Lagrange multipliers for vector optimization problems in infinite dimension
- A new necessary and sufficient condition for the strong duality and the infinite dimensional Lagrange multiplier rule
- An extension of the basic constraint qualification to nonconvex vector optimization problems
- A measure-type Lagrange multiplier for the elastic-plastic torsion
- General infinite dimensional duality and applications to evolutionary network equilibrium problems
- Variational approach for a general financial equilibrium problem: the deficit formula, the balance law and the liability formula. A path to the economy recovery
- Duality theory for the dynamic oligopolistic market equilibrium problem
This page was built for publication: Generalized Lagrange multiplier rule for non-convex vector optimization problems