Pages that link to "Item:Q1176838"

The following pages link to Lagrange multiplier theorem of multiobjective programming problems with set functions (Q1176838):

Displaying 13 items.

• Optimality conditions for multiple objective fractional subset programming with \((\rho,\sigma,\theta )\)-type-I and related non-convex functions (Q695624) (← links)
• The saddle theorem for multiobjective generalized fractional programming problems with set functions (Q854429) (← links)
• Duality for multiple objective fractional subset programming with generalized \((\Gamma\mkern-15mu-,\rho,\sigma,\theta)\)-V-Type-I functions (Q858577) (← links)
• Duality for a minimax programming problem containing \(n\)-set functions (Q1279952) (← links)
• Lagrange duality in multiobjective fractional programming problems with \(n\)-set functions (Q1304681) (← links)
• Optimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex set functions (Q1378572) (← links)
• Fenchel duality theorem in multiobjective programming problems with set functions (Q1429341) (← links)
• Efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized \(({\mathcal F},\alpha,\rho,\theta)\)-\(V\)-convex functions (Q1609081) (← links)
• On minimax fractional programming of generalized convex set functions (Q1978809) (← links)
• Optimality conditions for multiple objective fractional subset programming with \(({\mathcal F},\alpha,\rho,\theta)\)-V-type-I and related non-convex functions (Q2389822) (← links)
• Optimality and duality for multiobjective programming involving subdifferentiable set functions (Q4351790) (← links)
• Approximate Saddle Point and Duality for Multiobjective <i>n</i>-Set Optimization (Q4435180) (← links)
• APPROXIMATE EFFICIENCY FOR n-SET MULTIOBJECTIVE FRACTIONAL PROGRAMMING (Q5315814) (← links)