Mixed-integer quadratic programming is in NP

Mixed-integer quadratic programming is the problem of optimizing a quadratic function over points in a polyhedral set where some of the components are restricted to be integral. In this paper, we prove that the decision version of mixed-integer quadratic programming is in NP, thereby showing that it...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical programming Vol. 162; no. 1-2; pp. 225 - 240
Main Authors:	Pia, Alberto Del, Dey, Santanu S., Molinaro, Marco
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2017 Springer Nature B.V
Subjects:	Calculus of Variations and Optimal Control; Optimization Combinatorics Complexity theory Economics Feasibility Full Length Paper Inequality Integer programming Lectures Linear programming Mathematical and Computational Physics Mathematical Methods in Physics Mathematical models Mathematics Mathematics and Statistics Mathematics of Computing Numerical Analysis Optimization Polynomials Quadratic programming Studies Theoretical Integer programming 90C20 Quadratic programming 90C60 90C11 Complexity
ISSN:	0025-5610, 1436-4646
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!