Back to Search
Start Over
Saddle point and generalized convex duality for multiobjective programming
- Source :
- Journal of Applied Mathematics and Computing. 15:227-235
- Publication Year :
- 2004
- Publisher :
- Springer Science and Business Media LLC, 2004.
-
Abstract
- In this paper we consider the dual problems for multiobjective programming with generalized convex functions. We obtain the weak duality and the strong duality. At last, we give an equivalent relationship between saddle point and efficient solution in multiobjective programming.
- Subjects :
- Convex analysis
Mathematical optimization
Duality gap
Applied Mathematics
Computer Science::Neural and Evolutionary Computation
MathematicsofComputing_NUMERICALANALYSIS
Mathematics::Optimization and Control
Duality (optimization)
Perturbation function
Weak duality
Computational Mathematics
TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY
Saddle point
Strong duality
Convex function
Mathematics
Subjects
Details
- ISSN :
- 18652085 and 15985865
- Volume :
- 15
- Database :
- OpenAIRE
- Journal :
- Journal of Applied Mathematics and Computing
- Accession number :
- edsair.doi...........bce18f12eca0c31b33cc7f64af7b8a8e
- Full Text :
- https://doi.org/10.1007/bf02935757