Lexicographic quasiconcave multiobjective programming
From MaRDI portal
Publication:4136967
DOI10.1007/BF01919766zbMATH Open0362.90101MaRDI QIDQ4136967FDOQ4136967
Publication date: 1977
Published in: Zeitschrift für Operations Research (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Quasi-Concave Programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Strictly quasi-convex (concave) functions and duality in mathematical programming
- Note on Jordan elimination, linear programming and Tchebyscheff approximation
- Bounds for functionally convex optimal control problems
- The Direct Power of Adjacent Vertex Programming Methods
- Seven Kinds of Convexity
- KonvexeN-Stufen-Max-Min-Optimierung
- Title not available (Why is that?)
- Lexicographical problems of linear programming
- Title not available (Why is that?)
- Über reguläre Zerlegungen bei nichtlinearen Abbildungen
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lexikographische Optimierung und Zweipersonennullsummenspiele unter Ausnutzung von Fehlern des Gegners
- Title not available (Why is that?)
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
- A lexicographic optimization approach for a bi-objective parallel-machine scheduling problem minimizing total quality loss and total tardiness
- 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 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)
