logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Minimax and symmetric duality for nonlinear multiobjective mixed integer programming

delete2001-01-01
delete9
PRE
AI
D
Do Sang Kim *
Y
Young Ran Song
DOI：10.1016/S0377-2217(99)00365-3delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
We formulate two pairs of symmetric duality for nonlinear multiobjective mixed integer programs for arbitrary cones. By using the concept of efficiency, we establish the weak, strong, converse and self-duality theorems for our symmetric models. Several known results are obtained as special cases. (C) 2001 Elsevier Science B.V. All rights reserved.
Keywords:
multiobjective mixed integer programs
invex functions
pseudo-invex functions
efficient solutions
symmetric duality
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

European Journal of Operational Research cover
European Journal of Operational Research
IF:
6
Papers:
2.2W
Citations:
6.4W

Organization

No organization information available