A simplified MOLP algorithm: The MOLP-S procedure

DOI10.1016/0305-0548(91)90008-FMaRDI QIDQ1184461zbMATH OpenOpenAlexFDO

Authors Leo W. G. Strijbosch, Arno G. M. van Doorne, Willem J. Selen

Publication date 28 June 1992

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0305-0548(91)90008-f

zbMATH Keywords

non-dominated solutionsmultiple objective linear programming

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Recommendations

• Computational efficiency and interactive MOLP algorithms: An implementation of the SIMOLP procedure
• A simplified interactive multiple objective linear programming procedure
• MOLP with an interactive assessment of a piecewise linear utility function
• A modified method for constructing efficient solutions structure of MOLP
• scientific article; zbMATH DE number 3889259

Cites work

• scientific article; zbMATH DE number 3945836 (Why is no real title available?)
• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• A general method for determining the set of all efficient solutions to a linear vectormaximum problem
• Computational experience concerning payoff tables and minimum criterion values over the efficient set
• Finding all efficient extreme points for multiple objective linear programs
• Linear multiobjective programming
• Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
• Selecting tolerances in chance-constrained programming: A multiple objective linear programming approach
• Shadow Prices in Multiple Objective Linear Programming
• The enumeration of all efficient solutions for a linear multiple-objective transportation problem
• The range of the efficient frontier in multiple objective linear programming
• Vector maximization at a degenerate vertex

Cited in

(12)

• scientific article; zbMATH DE number 3889259 (Why is no real title available?)
• A regression study of the number of efficient extreme points in multiple objective linear programming
• Alienor method to solve multi-objective linear programming (MOLP)
• Random problem genertion and the computation of efficient extreme points in multiple objective linear programming
• Computational efficiency and interactive MOLP algorithms: An implementation of the SIMOLP procedure
• Hybrid approach for solving multiple-objective linear programs in outcome space
• Characterizing coherence, correcting incoherence
• scientific article; zbMATH DE number 721852 (Why is no real title available?)
• An approach for finding efficient points in multiobjective linear programming
• A modified method for constructing efficient solutions structure of MOLP
• Further analysis of an outcome set-based algorithm for multiple-objective linear programming
• A bookkeeping strategy for multiple objective linear programs

This page was built for publication: A simplified MOLP algorithm: The MOLP-S procedure

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