Finding a weights-restricted efficient (extreme) point and using it for solving MOLP problems.

DOI10.1016/S0096-3003(03)00210-8zbMath1045.90057MaRDI QIDQ1428193

Ali Asghar Foroughi, Gholam Reza Jahanshahloo

Publication date: 14 March 2004

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

zbMATH Keywords

Linear programmingEfficiencyWeights restrictionsMulti-objective

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Linear programming (90C05)

Related Items

Maximal flow in possibilistic networks, On some multiobjective optimization problems arising in biology, Optimal and strongly optimal solutions for linear programming models with variable parameters

Cites Work

• Unnamed Item
• Unnamed Item
• Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
• An Overview of Techniques for Solving Multiobjective Mathematical Programs
• An Interactive Multiple Objective Linear Programming Method for a Class of Underlying Nonlinear Utility Functions
• Multiple Objective Linear Programming with Interval Criterion Weights
• Finding an Initial Efficient Extreme Point for a Linear Multiple Objective Program
• An Interactive Programming Method for Solving the Multiple Criteria Problem
• On Computing an Initial Efficient Extreme Point
• Finding all efficient extreme points for multiple objective linear programs