Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T07:23:35.679Z Has data issue: false hasContentIssue false

Optimality and duality without a constraint qualification for minimax programming

Published online by Cambridge University Press:  17 April 2009

Houchun Zhou
Affiliation:
Department of Mathematics, Nanjing Normal University, Nanjing 210097, Jiangsu, Peoples Republic of China and Department of Mathematics, Linyi Teacher's College, Linyi 276005, Shandong, Peoples Republic of China, e-mail: zhouhouchun@263.net
Wenyu Sun
Affiliation:
Department of Mathematics, Nanjing Normal University, Nanjing 210097, Jiangsu, Peoples Republic of China, e-mail: wysun@pine.njnu.edu.cn
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Without the need of a constraint qualification, we establish the optimality necessary and sufficient conditions for generalised minimax programming. Using these optimality conditions, we construct a parametric dual model and a parameter-free mixed dual model. Several duality theorems are established.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 2003