Using efficient feasible directions in interactive multiple objective linear programming

DOI10.1016/0167-6377(91)90060-3zbMath0746.90061OpenAlexW2035098850MaRDI QIDQ1178731

Yasemin Aksoy, Harold P. Benson

Publication date: 26 June 1992

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(91)90060-3

zbMATH Keywords

multiple objective linear programmingefficient feasible directionsinteractive line search algorithms

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Linear programming (90C05) Management decision making, including multiple objectives (90B50) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (4)

Using efficient feasible directions in interactive multiple objective linear programming ⋮ An interactive multi-objective gradient search ⋮ Further analysis of an outcome set-based algorithm for multiple-objective linear programming ⋮ Hybrid approach for solving multiple-objective linear programs in outcome space

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An integration of efficiency projections into the Geoffrion approach for multiobjective linear programming
• An interactive method for multiple-objective mathematical programming problems
• A visual interactive method for solving the multiple criteria problem
• The interface with decision makers and some experimental results in interactive multiple objective programming methods
• Interactive algorithms for multiple criteria nonlinear programming problems
• Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
• Interactive algorithm for multiobjective optimization
• Using efficient feasible directions in interactive multiple objective linear programming
• An interactive multi-objective gradient search
• An Overview of Techniques for Solving Multiobjective Mathematical Programs
• An Interactive Multiple Objective Linear Programming Method for a Class of Underlying Nonlinear Utility Functions
• An Interactive Branch-and-Bound Algorithm for Multiple Criteria Optimization
• A Tradeoff Cut Approach to Multiple Objective Optimization
• A Proxy Approach to Multi-Attribute Decision Making
• An interactive weighted Tchebycheff procedure for multiple objective programming
• Convergence Conditions for Nonlinear Programming Algorithms
• Linear programming with multiple objective functions: Step method (stem)
• An Interactive Approach for Multi-Criterion Optimization, with an Application to the Operation of an Academic Department
• A Time-Sharing Computer Program for the Solution of the Multiple Criteria Problem
• Optimization over the efficient set

This page was built for publication: Using efficient feasible directions in interactive multiple objective linear programming