Duality for a class of minmax and inexact programming problem

DOI10.1006/jmaa.1994.1330zbMath0827.90116OpenAlexW2093461843MaRDI QIDQ1340521

C. R. Bector, Suresh Chandra, Viveka Kumar

Publication date: 14 December 1994

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jmaa.1994.1330

zbMATH Keywords

necessary and sufficient optimality conditionsduality theoremsinexact programmingminmax of a quasiconvex- quasiconcave function

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Fractional programming (90C32)

Related Items

A fifth bibliography of fractional programming^* ⋮ Nondifferentiable minimax programming problems with applications ⋮ SEQUENTIAL LAGRANGE MULTIPLIER CONDITIONS FOR MINIMAX PROGRAMMING PROBLEMS ⋮ Unnamed Item ⋮ Optimality conditions for minimax optimization problems with an infinite number of constraints and related applications ⋮ On Minimax Fractional Semi-Infinite Programming Problems with Applications ⋮ Minimax programming as a tool for studying robust multi-objective optimization problems