Second order duality for minimax programming

Authors

  • Liu J.C.

Abstract

We apply the optimality conditions of minimax programming to formulate general second order Mond-Weir dual to the minimax programming involving second order pseudo B-invex and second order quasi B-invex functions, We also establish weak, strong, and strict converse duality theorems.

Published

1999-06-09

How to Cite

Liu J.C. (1999). Second order duality for minimax programming. Utilitas Mathematica, 56. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/129

Issue

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.