An indefinite quadratic optimization over an integer efficient set
From MaRDI portal
Publication:3177625
Recommendations
- Solving multi-objective integer indefinite quadratic fractional programs
- An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program
- A branch-and-cut technique to solve multiobjective integer quadratic programming problems
- Quadratic optimization over a discrete Pareto set of a multi-objective linear fractional program
- Optimizing a linear fractional function over the integer efficient set
Cites work
- scientific article; zbMATH DE number 3167494 (Why is no real title available?)
- scientific article; zbMATH DE number 3231717 (Why is no real title available?)
- scientific article; zbMATH DE number 3356443 (Why is no real title available?)
- An algorithm for optimizing a linear function over an integer efficient set
- An exact method for a discrete multiobjective linear fractional optimization
- Equivalence of balance points and Pareto solutions in multiple-objective programming
- Indefinite quadratic fractional functional programming
- Optimising a nonlinear utility function in multi-objective integer programming
- Optimization of a linear function on the set of efficient solutions of a multicriterion convex quadratic problem
- Optimization over an integer efficient set of a multiple objective linear fractional problem
- Optimization over the efficient set
- Optimization over the efficient set: overview
- Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
Cited in
(6)- Solving multi-objective integer indefinite quadratic fractional programs
- Optimization of a quadratic programming problem over an Integer efficient set
- Quadratic optimization over a discrete Pareto set of a multi-objective linear fractional program
- A branch-and-cut technique to solve multiobjective integer quadratic programming problems
- Solving integer indefinite quadratic bilevel programs with multiple objectives at the upper level
- Branch and cut method for solving integer indefinite quadratic bilevel programs
This page was built for publication: An indefinite quadratic optimization over an integer efficient set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3177625)