Multiobjective duality for convex ratios.
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 4164581 (Why is no real title available?)
- scientific article; zbMATH DE number 3504682 (Why is no real title available?)
- scientific article; zbMATH DE number 3606241 (Why is no real title available?)
- scientific article; zbMATH DE number 4128668 (Why is no real title available?)
- scientific article; zbMATH DE number 1792004 (Why is no real title available?)
- scientific article; zbMATH DE number 4193476 (Why is no real title available?)
- scientific article; zbMATH DE number 3320765 (Why is no real title available?)
- Duality for a sum of convex ratios
- Duality in Fractional Programming: A Unified Approach
- Duality in nonlinear fractional programming
- Multicriteria fractional programming -- an approach by means of conjugate functions
- Multiobjective duality for convex-linear problems. II
- New constraint qualification and conjugate duality for composed convex optimization problems
- Programming Problems with Convex Fractional Functions
- Theory of multiobjective optimization
- Vector-valued lagrangian and multiobjective fractional programming duality
Cited in
(6)- A sixth bibliography of fractional programming
- Multiobjective duality for convex-linear problems. II
- Multiobjective duality for convex semidefinite programming problems
- Duality for optimization problems with entropy-like objective functions
- Fenchel-Lagrange duality versus geometric duality in convex optimization
- Duality for some nondifferentiable static multiobjective programming problems
This page was built for publication: Multiobjective duality for convex ratios.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1856918)