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)
algorithm; vector optimization; integer programming; computational results; multi-criteria optimization; boolean programming; weak efficient points; interval linear multiple zero-one programming; strong efficient points
65K05: Numerical mathematical programming methods
90C10: Integer programming
90C31: Sensitivity, stability, parametric optimization
90C05: Linear programming
90C09: Boolean programming
Related Items
A METHOD FOR GENERATING ALL THE EFFICIENT SOLUTIONS OF A 0-1 MULTI-OBJECTIVE LINEAR PROGRAMMING PROBLEM, Unnamed Item, Unnamed Item, Multiobjective 0-1 integer programming for the use of sugarcane residual biomass in energy cogeneration, An algorithm for generalized fuzzy binary linear programming problems, A multiobjective approach for maximizing the reach or GRP of different brands in TV advertising, Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case, Identifying preferred solutions to multi-objective binary optimisation problems, with an application to the multi-objective knapsack problem, Decision making under uncertainty: A semi-infinite programming approach, A review of interactive methods for multiobjective integer and mixed-integer programming, Exact algorithm for bi-objective 0-1 knapsack problem, 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, The R \& D project selection problem with fuzzy coefficients, Algorithms for nonlinear integer bicriterion problems, A reference direction approach to multiple objective integer linear programming, Multicriteria dynamic programming with an application to the integer case, An algorithm for the multiple objective integer linear programming problem, Total unimodularity applications in bi-objective discrete optimization, Multiple criteria decision support -- a review, A fuzzy programming approach to multiobjective multidimensional 0-1 knapsack problems, A branch and bound algorithm for mixed zero-one multiple objective linear programming, An interactive procedure for multiple objective integer linear programming problems, An interactive approach to bicriterion loading of a flexible assembly system, Using DEA to obtain efficient solutions for multi-objective 0--1 linear programs, A fast interactive solution method for large capital expenditure selection problems, Solving zero-one multiple objective programs through implicit enumeration, An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems, An improved algorithm for solving biobjective integer programs, A discussion of scalarization techniques for multiple objective integer programming, A survey of recent developments in multiobjective optimization, Core problems in bi-criteria \(\{0,1\}\)-knapsack problems, A method for generating all efficient solutions of 0-1 multi-objective linear programming problem, On some multiobjective optimization problems arising in biology
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
