Duality for multiobjective \(B\)-vex programming involving \(n\)-set functions

DOI10.1006/jmaa.1996.0343zbMath0857.90109OpenAlexW1567064244MaRDI QIDQ1923906

Yanyan Li

Publication date: 11 March 1997

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jmaa.1996.0343

zbMATH Keywords

properly efficient solutionsmultiobjective \(B\)-vex programming problemsmultiobjective fractional programsaddle point of a Lagrangian

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Fractional programming (90C32)

Related Items (7)

A fifth bibliography of fractional programming^* ⋮ Duality for minmax \(B\)-vex programming involving \(n\)-set functions ⋮ Optimality and duality for a multi-objective programming problem involving generalized \(d\)-type-I and related \(n\)-set functions ⋮ Mond-Weir type duality involving (B, η)-invex functions for a minmax programming problem ⋮ Optimality and duality for multiobjective fractional programming involving \(n\)-set functions ⋮ Minmax programming : optimality and Wolfe type duality for a problem involving bectovex functions ⋮ Efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized \(({\mathcal F},\alpha,\rho,\theta)\)-\(V\)-convex functions

This page was built for publication: Duality for multiobjective \(B\)-vex programming involving \(n\)-set functions