A duality theorem and an algorithm for (mixed-) integer nonlinear programming
- 1 October 1971
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 4 (4) , 341-352
- https://doi.org/10.1016/0024-3795(71)90005-x
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Direct Search Algorithms for Zero-One and Mixed-Integer ProgrammingOperations Research, 1967
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming ProblemOperations Research, 1965
- An Additive Algorithm for Solving Linear Programs with Zero-One VariablesOperations Research, 1965
- Minmax and duality in nonlinear programmingJournal of Mathematical Analysis and Applications, 1965
- Partitioning procedures for solving mixed-variables programming problemsNumerische Mathematik, 1962
- Duality in nonlinear programmingQuarterly of Applied Mathematics, 1962
- A duality theorem for non-linear programmingQuarterly of Applied Mathematics, 1961
- Constraint qualifications in maximization problemsNaval Research Logistics Quarterly, 1961
- The Cutting-Plane Method for Solving Convex ProgramsJournal of the Society for Industrial and Applied Mathematics, 1960
- Outline of an algorithm for integer solutions to linear programsBulletin of the American Mathematical Society, 1958