Theory and algorithms for linear multiple objective programs with zero–one variables
From MaRDI portal
Publication:3853460
DOI10.1007/BF01588256zbMath0419.90076MaRDI QIDQ3853460
Publication date: 1979
Published in: Mathematical Programming (Search for Journal in Brave)
algorithmvector optimizationinteger programmingcomputational resultsmulti-criteria optimizationboolean programmingweak efficient pointsinterval linear multiple zero-one programmingstrong efficient points
Numerical mathematical programming methods (65K05) Integer programming (90C10) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Boolean programming (90C09)
Related Items (36)
An algorithm for the bi-criterion integer programming problem ⋮ Zero-one programming with multiple criteria ⋮ Optimal attribute sets for identifications and diagnoses ⋮ Drilling strategies for frontier areas ⋮ Unnamed Item ⋮ An improved algorithm for solving biobjective integer programs ⋮ A discussion of scalarization techniques for multiple objective integer programming ⋮ The R \& D project selection problem with fuzzy coefficients ⋮ Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case ⋮ Unnamed Item ⋮ An interactive approach to bicriterion loading of a flexible assembly system ⋮ Algorithms for nonlinear integer bicriterion problems ⋮ A review of interactive methods for multiobjective integer and mixed-integer programming ⋮ A reference direction approach to multiple objective integer linear programming ⋮ A multiobjective approach for maximizing the reach or GRP of different brands in TV advertising ⋮ Identifying preferred solutions to multi-objective binary optimisation problems, with an application to the multi-objective knapsack problem ⋮ Multicriteria dynamic programming with an application to the integer case ⋮ An algorithm for the multiple objective integer linear programming problem ⋮ On some multiobjective optimization problems arising in biology ⋮ A survey of recent developments in multiobjective optimization ⋮ Core problems in bi-criteria \(\{0,1\}\)-knapsack problems ⋮ Multiobjective 0-1 integer programming for the use of sugarcane residual biomass in energy cogeneration ⋮ A METHOD FOR GENERATING ALL THE EFFICIENT SOLUTIONS OF A 0-1 MULTI-OBJECTIVE LINEAR PROGRAMMING PROBLEM ⋮ Total unimodularity applications in bi-objective discrete optimization ⋮ Multiple criteria decision support -- a review ⋮ An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems ⋮ An algorithm for generalized fuzzy binary linear programming problems ⋮ Exact algorithm for bi-objective 0-1 knapsack problem ⋮ Decision making under uncertainty: A semi-infinite programming approach ⋮ A fuzzy programming approach to multiobjective multidimensional 0-1 knapsack problems ⋮ Solving zero-one multiple objective programs through implicit enumeration ⋮ A branch and bound algorithm for mixed zero-one multiple objective linear programming ⋮ Using DEA to obtain efficient solutions for multi-objective 0--1 linear programs ⋮ A method for generating all efficient solutions of 0-1 multi-objective linear programming problem ⋮ An interactive procedure for multiple objective integer linear programming problems ⋮ A fast interactive solution method for large capital expenditure selection problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- Identifying Efficient Vectors: Some Theory and Computational Results
- Linear multiple objective programs with zero–one variables
- Finding all efficient extreme points for multiple objective linear programs
- A revised simplex method for linear multiple objective programs
- Algorithms for the vector maximization problem
- Convex Analysis
This page was built for publication: Theory and algorithms for linear multiple objective programs with zero–one variables
