A duality theorem and an algorithm for (mixed-) integer nonlinear programming

DOI10.1016/0024-3795(71)90005-XzbMath0225.90032WikidataQ114852131 ScholiaQ114852131MaRDI QIDQ2548914

Egon Balas

Publication date: 1971

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Related Items

Nonlinear 0–1 programming: I. Linearization techniques, An outer-approximation algorithm for a class of mixed-integer nonlinear programs, Enumerative inequalities in integer programming, Integer programming and convex analysis: Intersection cuts from outer polars, Steepest descent method for solving zero-one nonlinear programming problems, Branch-and-cut approach based on generalized Benders decomposition for facility location with limited choice rule, Preface, Symmetric and asymmetric duality

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partitioning procedures for solving mixed-variables programming problems
• Minmax and duality in nonlinear programming
• Outline of an algorithm for integer solutions to linear programs
• The Cutting-Plane Method for Solving Convex Programs
• A duality theorem for non-linear programming
• Constraint qualifications in maximization problems
• A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
• Direct Search Algorithms for Zero-One and Mixed-Integer Programming
• Duality in Discrete Programming: II. The Quadratic Case
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables
• Duality in nonlinear programming
• Dual Programs [Letter to the Editor]