Linear multiple objective programs with zero–one variables
From MaRDI portal
Publication:4156137
DOI10.1007/BF01584332zbMath0377.90070MaRDI QIDQ4156137
Publication date: 1977
Published in: Mathematical Programming (Search for Journal in Brave)
Related Items (41)
Interactive relaxation method for a broad class of integer and continuous nonlinear multiple criteria problems ⋮ An algorithm for the bi-criterion integer programming problem ⋮ Zero-one programming with multiple criteria ⋮ Drilling strategies for frontier areas ⋮ Unnamed Item ⋮ An improved algorithm for solving biobjective integer programs ⋮ Algorithm robust for the bicriteria discrete optimization problem ⋮ A discussion of scalarization techniques for multiple objective integer programming ⋮ Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case ⋮ Algorithms for nonlinear integer bicriterion problems ⋮ A review of interactive methods for multiobjective integer and mixed-integer programming ⋮ A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs ⋮ Network Models for Multiobjective Discrete Optimization ⋮ Designing a quality control system in a service organization: A goal programming case study ⋮ 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 ⋮ Multi-criteria integer linear fractional programming problem ⋮ Disjunctive Programming for Multiobjective Discrete Optimisation ⋮ 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 ⋮ Multiple criteria decision support -- a review ⋮ Theory and algorithms for linear multiple objective programs with zero–one variables ⋮ An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems ⋮ Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming ⋮ Optimizing a linear function over an integer efficient set ⋮ Cluster generation and grouping using mathematical programming ⋮ An Algorithm For Solving Multiple Objective Integer Linear Programming Problem ⋮ A fuzzy programming approach to multiobjective multidimensional 0-1 knapsack problems ⋮ A method for finding the set of non-dominated vectors for multiple objective integer linear programs ⋮ A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem ⋮ Solving zero-one multiple objective programs through implicit enumeration ⋮ An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound ⋮ A branch and bound algorithm for mixed zero-one multiple objective linear programming ⋮ A multi-objective constrained resource information system project selection method ⋮ Multicriteria integer programming: A (hybrid) dynamic programming recursive approach ⋮ On efficient sets in vector maximum problems - A brief survey ⋮ A fast interactive solution method for large capital expenditure selection problems
Cites Work
- Unnamed Item
- Unnamed Item
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- Proper efficiency and the theory of vector maximization
- Duality, Indifference and Sensitivity Analysis inr Multiple Objective Linear Programming
- A revised simplex method for linear multiple objective programs
- Algorithms for the vector maximization problem
This page was built for publication: Linear multiple objective programs with zero–one variables
