scientific article; zbMATH DE number 219844
From MaRDI portal
Publication:4695784
DOI<103::AID-NAV3220400107>3.0.CO;2-A 10.1002/1520-6750(199302)40:1<103::AID-NAV3220400107>3.0.CO;2-AzbMath0780.90080MaRDI QIDQ4695784
Harold P. Benson, Serpil Sayın
Publication date: 29 June 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Multi-objective and goal programming (90C29) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Optimizing a linear function over an efficient set, Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem, Dual approach to minimization on the set of Pareto-optimal solutions, Minimal representations of a face of a convex polyhedron and some applications, The interactive analysis of the multicriteria shortest path problem by the reference point method., Generating equidistant representations in biobjective programming, Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint, Optimization over the efficient set, A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem, Optimization over the efficient set of a parametric multiple objective linear programming problem, Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
Cites Work
