A cutting plane approach for multi-objective integer indefinite quadratic programming problem

DOI10.1007/s12597-014-0179-0zbMath1332.90169OpenAlexW2077589210MaRDI QIDQ260685

Ritu Arora, Sant R. Arora

Publication date: 22 March 2016

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-014-0179-0

zbMATH Keywords

integer programmingmulti-objective programmingbounded variablesindefinite quadratic programming problemnon-dominated solution

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Multi-objective and goal programming (90C29) Quadratic programming (90C20)

Uses Software

• MOIP_AIRA

Cites Work

• Interactive approach to bi-level integer multi-objective fractional programming problem
• An approach to find redundant objective function(s) and redundant constraint(s) in multi-objective nonlinear stochastic fractional programming problems
• The maximization of a function over the efficient set via a penalty function approach
• Multiobjective integer nonlinear fractional programming problem: a cutting plane approach
• Indefinite quadratic integer bilevel programming problem with bounded variables
• Multi-objective integer programming: an improved recursive algorithm
• A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems
• Integer Programming with Bounded Variables via Canonical Separation
• Finding all efficient extreme points for multiple objective linear programs
• A revised simplex method for linear multiple objective programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A cutting plane approach for multi-objective integer indefinite quadratic programming problem