A local version of Karamardian's theorem on lower semicontinuous strictly quasiconvex functions

DOI10.1016/0377-2217(89)90223-3zbMATH Open0715.90083OpenAlexW2039848558MaRDI QIDQ752006FDOQ752006

Authors Fred Alois Behringer

Publication date 1989

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(89)90223-3

zbMATH Keywords

Karamardian's theoremlexminmax orderlocally star shaped domainmultiobjective decisionsemilocal lower semicontinuitysemilocally quasiconvexsemilocally strictly quasiconvex functions

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Convexity of real functions of several variables, generalizations (26B25)

Recommendations

• Remarks on t-quasiconvex functions
• Semicontinuity and quasiconvex functions
• Characterization of nonsmooth semistrictly quasiconvex and strictly quasiconvex functions
• Programming with semilocally quasiconvex functions
• Multiobjective programming with semilocally convex functions

Cites work

• scientific article; zbMATH DE number 4016603 (Why is no real title available?)
• scientific article; zbMATH DE number 3137856 (Why is no real title available?)
• scientific article; zbMATH DE number 3156825 (Why is no real title available?)
• scientific article; zbMATH DE number 3974716 (Why is no real title available?)
• scientific article; zbMATH DE number 3621410 (Why is no real title available?)
• scientific article; zbMATH DE number 3220839 (Why is no real title available?)
• scientific article; zbMATH DE number 3253701 (Why is no real title available?)
• scientific article; zbMATH DE number 3284930 (Why is no real title available?)
• scientific article; zbMATH DE number 3308846 (Why is no real title available?)
• A Review of Quasi-Convex Functions
• A note on the maximum points of the minimum of quasiconvex functions
• A simplex based algorithm for the lexicographically extended linear maxmin problem
• Applications of fuzzy set theory to mathematical programming
• Approximations in $L^p $ and Chebyshev Approximations
• Constraint qualifications in maximization problems
• Discrete and nondlscrete quasi eon vexlike functions and single-peakedness (unimodality)
• Generalizations of convex and related functions
• Generalized convexities of lower semicontinuous functions
• Interactive multiple objective programming subject to flexible constraints
• KonvexeN-Stufen-Max-Min-Optimierung
• Lexicographic quasiconcave multiobjective programming
• Linear multiobjective maxmin optimization and some Pareto and lexmaxmin extensions
• On Karamardian's theorem about lower semicontinuous strictly quasiconvex functions
• On a Theorem of Deák Concerning the Quasiconvexity of Semicontinuous α‐Quasiconvex Functions
• On continuous quasiconvex functions
• On optimal decisions under complete ignorance. A new criterion stronger than both Pareto and Maxmin
• Semilocal pseudolinearity and efficiency
• Strictly quasi-convex (concave) functions and duality in mathematical programming
• The Nucleolus of a Characteristic Function Game
• Uniformly quasiconvexlike functions
• Zur existenz maximaler werte bei quasiordnungswertigen abbildungen

Cited in

(1)

• Convexity is equivalent to midpoint convexity combined with strict quasiconvextiy

This page was built for publication: A local version of Karamardian's theorem on lower semicontinuous strictly quasiconvex functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q752006)