A METHOD FOR GENERATING ALL THE EFFICIENT SOLUTIONS OF A 0-1 MULTI-OBJECTIVE LINEAR PROGRAMMING PROBLEM

DOI10.1142/S0217595904000096zbMath1104.90045OpenAlexW1970604843MaRDI QIDQ4650622

Gholam Reza Jahanshahloo, Farhad Hosseinzadeh Lotfi, N. Shoja, G. Tohidi

Publication date: 18 February 2005

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595904000096

zbMATH Keywords

efficient solution0-1 Multi-Objective Linear Programming

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Boolean programming (90C09)

Related Items (2)

On efficient solutions of 0-1 multi-objective linear programming problems ⋮ A Method for Generating a Well-Distributed Pareto Set in Multiple Objective Mixed Integer Linear Programs Based on the Decision Maker’s Initial Aspiration Level

Cites Work

• Some Models for Estimating Technical and Scale Inefficiencies in Data Envelopment Analysis
• Using DEA to obtain efficient solutions for multi-objective 0--1 linear programs
• Solving zero-one multiple objective programs through implicit enumeration
• Theory and algorithms for linear multiple objective programs with zero–one variables

This page was built for publication: A METHOD FOR GENERATING ALL THE EFFICIENT SOLUTIONS OF A 0-1 MULTI-OBJECTIVE LINEAR PROGRAMMING PROBLEM