An indefinite quadratic optimization over an integer efficient set
DOI10.1080/02331934.2018.1456539zbMATH Open1402.90110OpenAlexW2795445152WikidataQ130028644 ScholiaQ130028644MaRDI QIDQ3177625FDOQ3177625
Mustapha Moulai, Wassila Drici
Publication date: 1 August 2018
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2018.1456539
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
Quadratic programming (90C20) Multi-objective and goal programming (90C29) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10)
Cites Work
- Optimization over the efficient set
- Optimization over the efficient set: overview
- Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
- An algorithm for optimizing a linear function over an integer efficient set
- Title not available (Why is that?)
- Title not available (Why is that?)
- Equivalence of balance points and Pareto solutions in multiple-objective programming
- Title not available (Why is that?)
- An exact method for a discrete multiobjective linear fractional optimization
- Optimization of a linear function on the set of efficient solutions of a multicriterion convex quadratic problem
- Optimising a nonlinear utility function in multi-objective integer programming
- Optimization over an integer efficient set of a multiple objective linear fractional problem
- Indefinite quadratic fractional functional programming
Cited In (4)
- Optimization of a quadratic programming problem over an Integer efficient set
- Solving integer indefinite quadratic bilevel programs with multiple objectives at the upper level
- Branch and cut method for solving integer indefinite quadratic bilevel programs
- Quadratic optimization over a discrete pareto set of a multi-objective linear fractional program
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)
