Strictly quasi-convex (concave) functions and duality in mathematical programming

DOI10.1016/0022-247X(67)90095-9zbMath0157.49603MaRDI QIDQ2527599

S. Karamardian

Publication date: 1967

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

zbMATH Keywords

operations research

Related Items

Duale Optimierungsaufgaben und Sattelpunktsätze, On global minima of semistrictly quasiconcave functions, Duality for non-linear programming in aBanach space, Uniformly quasiconvexlike functions, Inter-temporal price discrimination and satiety-driven repeat purchases, Locally densely defined equilibrium problems, Equivalent definitions of the quasiconvexity, Three kinds of generalized convexity, On generalised convex nonsmooth functions, On a theorem due to Crouzeix and Ferland, Refinements of existence results for relaxed quasimonotone equilibrium problems, Unnamed Item, Linear programs with an additional reverse convex constraint, Cyclically monotone equilibrium problems and Ekeland's principle, Semistrictly and neatly quasiconvex programming using lower global subdifferentials, Quasiconcave functions over chains^†, Convexity is equivalent to midpoint convexity combined with strict quasiconvextiy, Characterizations of pseudoconvex functions and semistrictly quasiconvex ones, Ordinally Quasiconcave Functions^§, Towards a general setting for the fuzzy mathematics of finance, Nine kinds of quasiconcavity and concavity, Quasi-convexity, strictly quasi-convexity and pseudo-convexity of composite objective functions, A Minty variational principle for set optimization, From Arrow–Debreu condition to star shape preferences, Application of continuous-time programming problems to a class of variational-type inequalities, Local dense solutions for equilibrium problems with applications to noncooperative games, Logarithmic convexity and geometric programming, Generalized convexity in nondifferentiable programming, Lexicographic quasiconcave multiobjective programming, Characterizations and applications of prequasi-invex functions., Strictly quasi-convex (concave) functions and duality in mathematical programming, On the structure of the weakly efficient set for quasiconvex vector minimization, A local version of Karamardian's theorem on lower semicontinuous strictly quasiconvex functions, On Karamardian's theorem about lower semicontinuous strictly quasiconvex functions, Konjugierte Funktionen, Optimality conditions and duality for a class of continuous-time programming problems with nonlinear operator equality and inequality constraints, Local maximum points of explicitly quasiconvex functions, New closedness results for efficient sets in multiple objective mathematical programming, Some properties of explicitly quasiconcave functions, On strongly quasiconvex functions: existence results and proximal point algorithms

Cites Work

• Unnamed Item
• On general minimax theorems
• Minmax and duality in nonlinear programming
• Duality in nonlinear programming and the minimax theorem
• Strictly quasi-convex (concave) functions and duality in mathematical programming
• Über einen Dualitätssatz der nichtlinearen Programmierung
• Bounds for functionally convex optimal control problems
• Quasi-Concave Programming
• A duality theorem for non-linear programming
• The Direct Power of Adjacent Vertex Programming Methods
• Duality in nonlinear programming