Computational efficiency and interactive MOLP algorithms: An implementation of the SIMOLP procedure

DOI10.1016/0305-0548(90)90026-4zbMath0683.90088OpenAlexW2062941970MaRDI QIDQ1825145

Cengiz Haksever, Jeffrey L. Ringuest

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0305-0548(90)90026-4

zbMATH Keywords

interactive procedurescomputational considerationslarge scale multiobjective linear programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05)

Related Items (3)

A comparative study of interactive tradeoff cutting plane methods for MOMP ⋮ Group decision processes: MOLP procedures facilitating group and individual decision orientations ⋮ Comparative studies in interactive multiple objective mathematical programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simplified interactive multiple objective linear programming procedure
• Implementation of successive linear programming algorithms for non-convex goal programming
• Successive linear programming for ratio goal problems
• Goal programming and multiple objective optimizations. Part I
• An Interactive Multiple Objective Linear Programming Method for a Class of Underlying Nonlinear Utility Functions
• Approximate Traveling Salesman Algorithms
• On generation of test problems for linear programming codes
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• Generalized theorems for permanent basic and nonbasic variables
• Linear programming with multiple objective functions: Step method (stem)
• Interactive Goal Programming

This page was built for publication: Computational efficiency and interactive MOLP algorithms: An implementation of the SIMOLP procedure