{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:36:32Z","timestamp":1759667792700},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1977,6,1]],"date-time":"1977-06-01T00:00:00Z","timestamp":233971200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Zeitschrift f\u00fcr Operations Research"],"published-print":{"date-parts":[[1977,6]]},"DOI":"10.1007\/bf01919766","type":"journal-article","created":{"date-parts":[[2005,7,29]],"date-time":"2005-07-29T20:28:31Z","timestamp":1122668911000},"page":"103-116","source":"Crossref","is-referenced-by-count":17,"title":["Lexicographic quasiconcave multiobjective programming"],"prefix":"10.1007","volume":"21","author":[{"given":"F. A.","family":"Behringer","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF01919766_CR1","doi-asserted-by":"crossref","first-page":"779","DOI":"10.2307\/1911819","volume":"29","author":"K.J. Arrow","year":"1961","unstructured":"Arrow, K.J., andA.C. Enthoven: Quasi-concave Programming, Econometrica29, 1961, 779\u2013800.","journal-title":"Econometrica"},{"key":"BF01919766_CR2","unstructured":"Behringer, F.A.: \u00dcber die optimale Skalierung gewisser Differentialgleichungssysteme mit Anwendung auf den Analogrechner und den Digital Differential Analyzer. Doctoral Dissertation, Technische Universit\u00e4t M\u00fcnchen, 1969."},{"key":"BF01919766_CR3","first-page":"276","volume":"14","author":"F.A. Behringer","year":"1970","unstructured":"\u2014: KonvexeN-Stufen-Max-Min-Optimierung, Unternehmensforschung14, 1970, 276\u2013296.","journal-title":"Unternehmensforschung"},{"key":"BF01919766_CR4","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1002\/zamm.19720520404","volume":"52","author":"F.A. Behringer","year":"1972","unstructured":"\u2014: Eine Eindeutigkeitsaussage \u00fcber ein vektorielles Tschebyscheffausgleichsproblem, ZAMM52, 1972, 233\u2013236.","journal-title":"ZAMM"},{"key":"BF01919766_CR5","unstructured":"-: Quasikonkav-quasikonvexe Spiele unter Ausnutzung gegnerischer Schw\u00e4chen und lexikographische Optimierung, to appear in Zeitschrift f\u00fcr Mathematische Operationsforschung und Statistik (a)."},{"key":"BF01919766_CR6","unstructured":"-: Tschebyscheff-Ausgleich \u00fcberbestimmter Systeme linearer Gleichungen \u2014 Eindeutigkeit ohne Haarsche Bedingung durch lexikographischen Ausgleich, GAMM Meeting Graz 1976, to appear in ZAMM (b)."},{"key":"BF01919766_CR7","unstructured":"-: Lexikographische Optimierung und Zweipersonennullsummenspiele unter Ausnutzung von Fehlern des Gegners, to appear in ZAMM (c)."},{"key":"BF01919766_CR8","unstructured":"-: Optimale Entscheidungen bei Unsicherheit und Spiele unter Ausnutzung von Fehlern des Gegners, doctor habilitatus thesis, Technische Universit\u00e4t M\u00fcnchen 1975."},{"key":"BF01919766_CR9","first-page":"189","volume":"16","author":"P. Brucker","year":"1972","unstructured":"Brucker, P.: Diskrete parametrische Optimierungsprobleme und wesentlich effiziente Punkte, Zeitschrift f\u00fcr Operations Research16, 1972, 189\u2013197).","journal-title":"Zeitschrift f\u00fcr Operations Research"},{"key":"BF01919766_CR10","first-page":"1","volume":"50","author":"W. Dinkelbach","year":"1971","unstructured":"Dinkelbach, W.: \u00dcber einen L\u00f6sungsansatz zum Vektormaximumproblem, in: Lecture Notes in Operations Research and Mathematical Systems50, 1971, 1\u201313).","journal-title":"Lecture Notes in Operations Research and Mathematical Systems"},{"key":"BF01919766_CR11","unstructured":"Dresher, M.: Games of Strategy, 1961."},{"key":"BF01919766_CR12","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/0022-247X(64)90086-1","volume":"8","author":"M.A. Hanson","year":"1964","unstructured":"Hanson, M.A.: Bounds for Functionally Convex Optimal Control Problems, J. Math. Anal. App.8, 1964, 84\u201389.","journal-title":"J. Math. Anal. App."},{"key":"BF01919766_CR13","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/978-3-642-99748-8_14","volume":"5","author":"J. Hartung","year":"1976","unstructured":"Hartung, J.: \u00dcber lexikographische Spiele, Proceedings in Operations Research5, 1976, 77\u201383.","journal-title":"Proceedings in Operations Research"},{"key":"BF01919766_CR14","unstructured":"Heindl, G., undE. Reinhart: Ausgleichung im Sinne minimaler Maximalfehler, Deutsche Geod\u00e4tische Kommission bei der Bayerischen Akademie der Wissenschaften, Reihe A: Theoretische Geod\u00e4sie, Heft 84, M\u00fcnchen 1976."},{"key":"BF01919766_CR15","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1007\/978-3-642-99747-1_6","volume":"3","author":"H. Isermann","year":"1974","unstructured":"Isermann, H.: L\u00f6sungsans\u00e4tze zum Entscheidungsproblem des Satisfizierers bei mehrfacher Zielsetzung, Proc. Oper. Res.3, 1974, 64\u201374).","journal-title":"Proc. Oper. Res."},{"key":"BF01919766_CR16","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1016\/0022-247X(67)90095-9","volume":"20","author":"S. Karamardian","year":"1967","unstructured":"Karamardian, S.: Strictly Quasiconvex (Concave) Functions and Duality in Mathematical Programming, J. Math. Anal. Appl.20, 1967, 344\u2013358.","journal-title":"J. Math. Anal. Appl."},{"key":"BF01919766_CR17","first-page":"87","volume":"12","author":"G.J. Kelleher","year":"1970","unstructured":"Kelleher, G.J.: A Serialized Linear Programming Model for Obtaining Successive Minimax Strategies, J. Oper. Res. Soc. Japan12, 1970, 87\u201393.","journal-title":"J. Oper. Res. Soc. Japan"},{"key":"BF01919766_CR18","doi-asserted-by":"crossref","unstructured":"K\u00f6the, G.: Topologische lineare R\u00e4ume, Berlin 1960.","DOI":"10.1007\/978-3-662-22555-4"},{"key":"BF01919766_CR19","unstructured":"Mangasarian, O.L.: Nonlinear Programming, New York 1969."},{"key":"BF01919766_CR20","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1287\/mnsc.12.3.241","volume":"12","author":"B. Martos","year":"1965","unstructured":"Martos, B.: The Direct Power of Adjacent Vertex Programming Methods, Management Science12, 1965, 241\u2013252.","journal-title":"Management Science"},{"key":"BF01919766_CR21","unstructured":"-: Nonlinear Programming Theory and Methods, New York 1975."},{"key":"BF01919766_CR22","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/BF02922844","volume":"7","author":"G. Menges","year":"1966","unstructured":"Menges, G., undH. Diehl: \u00dcber die operationelle Eignung von Entscheidungsmodellen, Statistische Hefte7, 1966, 30\u201341.","journal-title":"Statistische Hefte"},{"key":"BF01919766_CR23","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0041-5553(72)90153-X","volume":"12","author":"V.V. Podinovskii","year":"1972","unstructured":"Podinovskii, V.V.: Lexicographical Problems of Linear Programming, USSR Computational Math. and Math. Physics12, 1972, 249\u2013253.","journal-title":"USSR Computational Math. and Math. Physics"},{"key":"BF01919766_CR24","unstructured":"-: Lexicographical Games, Advances in Game Theory, Proc. Sec. USSR Game Theory Conf., Vilnius 1973."},{"key":"BF01919766_CR25","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1137\/1009007","volume":"9","author":"J. Ponstein","year":"1967","unstructured":"Ponstein, J.: Seven Kinds of Convexity, SIAM Review9, 1967, 115\u2013119.","journal-title":"SIAM Review"},{"key":"BF01919766_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01386203","volume":"2","author":"E. Stiefel","year":"1960","unstructured":"Stiefel, E.: Note on Jordan Elimination, Linear Programming and Tschebyscheff Approximation, Num. Math.2, 1960, 1\u201317.","journal-title":"Num. Math."},{"key":"BF01919766_CR27","doi-asserted-by":"crossref","unstructured":"Stoer, J., andC. Witzgall: Convexity and Optimization in Finite Dimensions I, Berlin 1970.","DOI":"10.1007\/978-3-642-46216-0"},{"key":"BF01919766_CR28","unstructured":"Suchowitzki, S.I., andL.I. Awdejewa: Lineare und konvexe Programmierung, M\u00fcnchen 1969 (translated from the Russian by G. Tesch)."},{"key":"BF01919766_CR29","first-page":"213","volume":"12","author":"H. Tuy","year":"1964","unstructured":"Tuy, H.: Sur une classe des programmes non lin\u00e9aires, Bull. l'Academie Polonaise Sci. s\u00e9r. math., astr., phys.12, 1964, 213\u2013215.","journal-title":"Bull. l'Academie Polonaise Sci. s\u00e9r. math., astr., phys."}],"container-title":["Zeitschrift f\u00fcr Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01919766.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01919766\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01919766","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T12:25:19Z","timestamp":1586348719000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01919766"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977,6]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1977,6]]}},"alternative-id":["BF01919766"],"URL":"https:\/\/doi.org\/10.1007\/bf01919766","relation":{},"ISSN":["0340-9422","1432-5217"],"issn-type":[{"value":"0340-9422","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[1977,6]]}}}