Lexicographic quasiconcave multiobjective programming

DOI10.1007/BF01919766MaRDI QIDQ4136967zbMATH OpenFDO

Authors Fred Alois Behringer

Publication date 1977

Published in Zeitschrift für Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01919766

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites work

• scientific article; zbMATH DE number 3425370 (Why is no real title available?)
• scientific article; zbMATH DE number 3156825 (Why is no real title available?)
• scientific article; zbMATH DE number 3492436 (Why is no real title available?)
• scientific article; zbMATH DE number 3511898 (Why is no real title available?)
• scientific article; zbMATH DE number 3557508 (Why is no real title available?)
• scientific article; zbMATH DE number 3240850 (Why is no real title available?)
• scientific article; zbMATH DE number 3308846 (Why is no real title available?)
• scientific article; zbMATH DE number 3312388 (Why is no real title available?)
• scientific article; zbMATH DE number 3323651 (Why is no real title available?)
• scientific article; zbMATH DE number 3397316 (Why is no real title available?)
• Bounds for functionally convex optimal control problems
• KonvexeN-Stufen-Max-Min-Optimierung
• Lexicographical problems of linear programming
• Lexikographische Optimierung und Zweipersonennullsummenspiele unter Ausnutzung von Fehlern des Gegners
• Note on Jordan elimination, linear programming and Tchebyscheff approximation
• Quasi-Concave Programming
• Seven Kinds of Convexity
• Strictly quasi-convex (concave) functions and duality in mathematical programming
• The Direct Power of Adjacent Vertex Programming Methods
• Über reguläre Zerlegungen bei nichtlinearen Abbildungen

Cited in

(15)

• Geometric methods to solve max-ordering location problems
• On efficient sets in vector maximum problems - A brief survey
• On Karamardian's theorem about lower semicontinuous strictly quasiconvex functions
• On optimal decisions under complete ignorance. A new criterion stronger than both Pareto and Maxmin
• Linear multiobjective maxmin optimization and some Pareto and lexmaxmin extensions
• A lexicographic optimization approach for a bi-objective parallel-machine scheduling problem minimizing total quality loss and total tardiness
• A simplex based algorithm for the lexicographically extended linear maxmin problem
• Applications of fuzzy set theory to mathematical programming
• Bibliography in fractional programming
• A local version of Karamardian's theorem on lower semicontinuous strictly quasiconvex functions
• Linear lexicographic optimization
• Lexicographic geometric programming
• Mechanism design in a supply chain with ambiguity in private information
• Fair solutions for locational conflicts
• Reducing the number of linear programs needed for solving the nucleolus problem of n-person game theory

This page was built for publication: Lexicographic quasiconcave multiobjective programming

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