On Efficient Solutions to Multiple Objective Mathematical Programs
From MaRDI portal
Publication:3216460
DOI10.1287/mnsc.30.11.1346zbMath0553.90095OpenAlexW2108747258MaRDI QIDQ3216460
Jacques-François Thisse, Richard E. Wendell, James E. Ward, Timothy J. Lowe
Publication date: 1984
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.30.11.1346
Related Items
Sets of efficient points in a normed space, Biobjective robust optimization over the efficient set for Pareto set reduction, A decomposition approach to vector equilibrium problems, Approximating the Pareto optimal set using a reduced set of objective functions, On the hierarchical structure of Pareto critical sets, A new algorithm for solving planar multiobjective location problems involving the Manhattan norm, Determination of efficient solutions for point-objective locational decision problems, Decomposition of generalized vector variational inequalities, Involving the Helly number in Pareto reducibility, Explicitly quasiconvex set-valued optimization, An interactive multiobjective nonlinear programming procedure, Vector duality for convex vector optimization problems by means of the quasi-interior of the ordering cone, Arcwise cone-quasiconvex multicriteria optimization, A graphical characterization of the efficient set for convex multiobjective problems, Pareto reducible multicriteria optimization problems, Multicriteria analysis using a large-scale energy supply LP model, Free disposal hull condition to verify when efficiency coincides with weak efficiency, Scalarization and decomposition of vector variational inequalities governed by bifunctions, A characterization of efficient points in constrained location problems with regional demand, Geometrical characterization of weakly efficient points, A special class of extended multicriteria location problems, Geometrical properties of the Fermat-Weber problem, Analysis of multicriteria decision aid in Europe, Arcwise connected cone-quasiconvex set-valued mappings and Pareto reducibility in vector optimization
