Algorithms for nonlinear integer bicriterion problems
From MaRDI portal
Two algorithms to solve the nonlinear bicriterion integer mathematical programming (BIMP) problem are presented. One is a noninteractive procedure that generates the entire efficient set, and the second one is an interactive procedure that determines the best compromise solution of the decision maker (DM). A Tchebysheff norm related approach is used for generating the efficient points for the BIMP problem. An application of the interactive procedure for a quality control problem is also presented.
Recommendations
- An algorithm for the bi-criterion integer programming problem
- scientific article; zbMATH DE number 4049388
- An approximate algorithm for nonlinear integer programming
- An approximate algorithm for nonlinear integer programming
- Nonlinear integer programming algorithms: A survey
- Numerical analysis of algorithms for solving bicriteria discrete programming problems
- An algorithm for non-linear multi-level integer programming problems
- Three algorithms for bicriteria integer linear programs
- scientific article; zbMATH DE number 770255
- scientific article; zbMATH DE number 1131476
Cites work
- A multiple criteria method for choosing among discrete alternatives
- An algorithm for the multiple objective integer linear programming problem
- scientific article; zbMATH DE number 3833155 (Why is no real title available?)
- scientific article; zbMATH DE number 3339023 (Why is no real title available?)
- Interactive solution of bi-criteria mathematical programs
- Linear multiple objective programs with zero-one variables
- Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
- Solving Bicriterion Mathematical Programs
- Theory and algorithms for linear multiple objective programs with zero- one variables
Cited in
(21)- An algorithm for the bi-criterion integer programming problem
- Interactive bicriterion solution method and its application to critical path method problems
- Numerical analysis of algorithms for solving bicriteria discrete programming problems
- Three algorithms for bicriteria integer linear programs
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- A multi-objective Monte Carlo tree search for forest harvest scheduling
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
- An improved algorithm for solving biobjective integer programs
- Algorithm robust for the bicriteria discrete optimization problem
- Bicriteria integer quadratic programming problems
- The augmented weighted Tchebychev norm for optimizing a linear function over an integer efficient set of a multicriteria linear program
- An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems
- An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming
- An interactive method for bicriteria integer programming
- scientific article; zbMATH DE number 1234731 (Why is no real title available?)
- scientific article; zbMATH DE number 553773 (Why is no real title available?)
- scientific article; zbMATH DE number 592650 (Why is no real title available?)
- An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs
- Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems
- The weighted \(p\)-norm weight set decomposition for multiobjective discrete optimization problems
- Generating representative sets for multiobjective discrete optimization problems with specified coverage errors
This page was built for publication: Algorithms for nonlinear integer bicriterion problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1114597)