Complex minimax programming

Authors

  • Liu J.C.

Abstract

We establish the Kuhn-Tucker type necessary and sufficient optimality conditions for complex minimax programming with generalized convex functions. Subsequently, we apply these optimality criteria to formulate two dual problems. We also establish weak, strong, and strict converse duality theorems.

Published

1999-05-09

How to Cite

Liu J.C. (1999). Complex minimax programming. Utilitas Mathematica, 55. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/154

Issue

Vol. 55 (1999): Volume 55,1999

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.