A new interactive algorithm for multiobjective linear programming using maximally changeable dominance cone

DOI10.1016/0377-2217(93)90013-DzbMATH Open0778.90061OpenAlexW2035951439MaRDI QIDQ684340FDOQ684340

Authors: Soung Hie Kim, Tomas Gal 

Publication date: 15 September 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(93)90013-d

Recommendations

• An interactive algorithm for solving multiple objective integer linear programming problems
• scientific article; zbMATH DE number 721841
• An interactive interior point algorithm for multiobjective linear programming problems
• An interactive procedure for multiple objective integer linear programming problems
• An exact interactive method for exploring the efficient facets of multiple objective linear programming problems with quasi-concave utility functions
• An Interactive Method To Multiobjective Linear Programming Problems With Interval Coefficients
• scientific article; zbMATH DE number 3978851
• scientific article; zbMATH DE number 3891118
• scientific article; zbMATH DE number 37091
• An interactive multiobjective nonlinear programming procedure

zbMATH Keywords

dominance coneinteractive methodologymulti-objective linear decision problemspairwise tradeoffs

Mathematics Subject Classification ID

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

Cites Work

• Stability of nondominated solutions in multicriteria decision-making
• Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
• Title not available (Why is that?)
• Finding all efficient extreme points for multiple objective linear programs
• The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
• Multiple Objective Linear Programming with Interval Criterion Weights
• A general method for determining the set of all efficient solutions to a linear vectormaximum problem
• Generating all maximal efficient faces for multiple objective linear programs
• An Interactive Multiple Objective Linear Programming Method for a Class of Underlying Nonlinear Utility Functions
• Redundant objective functions in linear vector maximum problems and their determination
• A Tradeoff Cut Approach to Multiple Objective Optimization
• Finding an Initial Efficient Extreme Point for a Linear Multiple Objective Program
• Minimal representation of convex polyhedral sets
• Identifying Efficient Vectors: Some Theory and Computational Results
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• An improved multiple criteria visual interactive method with stepwise focused contouring of efficient criterion vectors
• Eliminating permanently dominated opportunities in multiple-criteria and multiple-constraint level linear programming

This page was built for publication: A new interactive algorithm for multiobjective linear programming using maximally changeable dominance cone

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