scientific article; zbMATH DE number 3999655

zbMath0616.90045MaRDI QIDQ4726043

Jacques jun. Teghem, Pierre L. Kunsch

Publication date: 1986

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

efficient solutionsinteger linear programmingmulti-objective linear programming

Mathematics Subject Classification ID

Integer programming (90C10) Sensitivity, stability, parametric optimization (90C31) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (29)

Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic ⋮ An interactive algorithm for solving multiple objective integer linear programming problems ⋮ Towards a multi-objective performance assessment and optimization model of a two-echelon supply chain using SCOR metrics ⋮ An algorithm for optimizing a linear function over an integer efficient set ⋮ Parametric methods in integer linear programming ⋮ Fuzzy boolean programming problems with fuzzy costs: A general study ⋮ 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 ⋮ A reference direction approach to multiple objective integer linear programming ⋮ A bi-objective modeling approach applied to an urban semi-desirable facility location problem ⋮ Grey integer programming: an application to waste management planning under uncertainty ⋮ Optimization of a linear function over an integer efficient set ⋮ Optimization Over Stochastic Integer Efficient Set ⋮ Optimization of a quadratic programming problem over an Integer efficient set ⋮ A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems ⋮ Efficiency status of a feasible solution in the multi-objective integer linear programming problems: a DEA methodology ⋮ 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 ⋮ Optimization of a linear function over the set of stochastic efficient solutions ⋮ Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems ⋮ Solving the Multiple Objective Integer Linear Programming Problem ⋮ 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 ⋮ An Algorithm For Solving Multiple Objective Integer Linear Programming Problem ⋮ A method for finding the set of non-dominated vectors for multiple objective integer linear programs ⋮ A linear fractional optimization over an integer efficient set ⋮ Cutting plane method for multiple objective stochastic integer linear programming ⋮ An interactive procedure for multiple objective integer linear programming problems ⋮ The multiobjective multidimensional knapsack problem: a survey and a new approach

This page was built for publication: