Vector optimization and generalized Lagrangian duality (Q1339225): Difference between revisions

For a not necessarily convex vector optimization problem in a finite- dimensional setting a Lagrange duality theory is developed using a Lagrangian function for which the multipliers are not constants but functions. The approach is based on an \(\varepsilon\)-constrained scalarization technique.