Mixed-integer quadratic programming

DOI10.1007/BF01581047zbMath0475.90065MaRDI QIDQ3931023

Rafael Lazimy

Publication date: 1982

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

linear constraintsgeneralized inversesdual formulationgeneralized Benders' decompositionequivalent formulationmixed-integer quadratic programsquadratic duality theory

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Quadratic programming (90C20)

Related Items

Spatial interaction models with individual-level data for explaining labor flows and developing local labor markets, Introduction to QUBO, Improved algorithm for mixed-integer quadratic programs and a computational study, An algorithm for indefinite integer quadratic programming, A new local and global optimization method for mixed integer quadratic programming problems, A hybrid approach to resolving a differentiable integer program., Two-stage quadratic integer programs with stochastic right-hand sides, A note on Benders' decomposition in mixed-integer quadratic programming, A portfolio theory approach to crop planning under environmental constraints, A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm¹, Models and methods of solution of quadratic integer programming problems, Lagrangean decomposition for integer nonlinear programming with linear constraints, Computing equilibria of Cournot oligopoly models with mixed-integer quantities, Mixed-integer bilinear programming problems, Solving a nonlinear integer program for allocating resources, Decomposition in general mathematical programming, Dorn's duality for quadratic programs revisited: The nonconvex case, A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming, Integer quadratic optimization, Global hybrid modeling and control of a buck converter: A novel concept

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partitioning procedures for solving mixed-variables programming problems
• Generalized Benders decomposition
• A Method of Solution for Quadratic Programs
• Duality in quadratic programming
• The Simplex Method for Quadratic Programming
• Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
• An Implicit Enumeration Algorithm for Quadratic Integer Programming
• Multicommodity Distribution System Design by Benders Decomposition
• Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
• Simultaneous Investment and Allocation Decisions Applied to Water Planning
• Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
• Symmetric dual quadratic programs
• A pseudo primal-dual integer programming algorithm
• Duality in Discrete Programming: II. The Quadratic Case
• Elements of Large-Scale Mathematical Programming Part I: Concepts
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey
• Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems