Using efficient feasible directions in interactive multiple objective linear programming

DOI10.1016/0167-6377(91)90060-3MaRDI QIDQ1178731zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Optimizing a linear function over an efficient set
• Generating interior search directions for multiobjective linear programming
• An exact interactive method for exploring the efficient facets of multiple objective linear programming problems with quasi-concave utility functions
• An integration of efficiency projections into the Geoffrion approach for multiobjective linear programming

Cites work

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

Cited in

(5)

• Hybrid approach for solving multiple-objective linear programs in outcome space
• An exact interactive method for exploring the efficient facets of multiple objective linear programming problems with quasi-concave utility functions
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1178731)