An Interactive Method as an Aid in Solving Bicriterion Mathematical Programming Problems

DOI10.2307/3009565zbMath0385.90108MaRDI QIDQ4166601

No author found.

Publication date: 1978

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3009565

Mathematics Subject Classification ID

90C31: Sensitivity, stability, parametric optimization

90B99: Operations research and management science

Related Items

An efficient algorithm for the Lagrangean dual of nonlinear knapsack problems with additional nested constraints, Interactive multiple objective optimization: Survey. I: Continuous case, An integration of efficiency projections into the Geoffrion approach for multiobjective linear programming, An interactive method for multiple-objective mathematical programming problems, A graphical bicriteria approach to the resource allocation problem, Interactive multidimensional programming models for locational decisions, A comparative study of interactive tradeoff cutting plane methods for MOMP, Interactive bicriterion solution method and its application to critical path method problems, Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem, Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem, A note on bicriterion programming, An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming