Duality theorems for non-convex mixed integer programming problems
International Journal of Computing and Optimization · 2016
DOI: 10.12988/ijco.2016.5927 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Journal of Computing and Optimization, 2016. Verfasst von B. Sunita Mishra und 2 weiteren Autor:innen.
Abstract (Originalsprache)
In this paper, we consider maximin and minimax nonlinear mixed integer programming problems which are not symmetric in the duality sense. Under generalized conditions which involve increasing and decreasing functions, we compare the supremum infimum of the maximin problem with the infimum supremum of the minimax problem. The weak duality theorem for minimax and symmetric dual nonlinear mixed integer programming problem is derived as a particular case. The earlier results on minimax and symmetric duality in nonlinear mixed integer programming are thus generalized for monotonic functions. The results equally hold for strong pseudo convex and strong pseudo concave functions.
Zitieren
APA
Mishra, B. S., Nayak, J., & Satpathy, P. (2016). Duality theorems for non-convex mixed integer programming problems. International Journal of Computing and Optimization. https://doi.org/10.12988/ijco.2016.5927
Vancouver
Mishra BS, Nayak J, Satpathy P. Duality theorems for non-convex mixed integer programming problems. International Journal of Computing and Optimization. 2016. doi:10.12988/ijco.2016.5927
BibTeX
@article{Mishra2016,
author = {Mishra, B. Sunita and Nayak, J.R. and Satpathy, P.K.},
title = {Duality theorems for non-convex mixed integer programming problems},
journal = {International Journal of Computing and Optimization},
year = {2016},
doi = {10.12988/ijco.2016.5927}
}
EUVIMED