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

DOI10.2307/3009565zbMath0385.90108OpenAlexW4253094963MaRDI 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

Sensitivity, stability, parametric optimization (90C31) Operations research and management science (90B99)

Related Items (12)

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

This page was built for publication: An Interactive Method as an Aid in Solving Bicriterion Mathematical Programming Problems