Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/wiley/a-cutting-plane-algorithm-for-the-bilinear-programming-problem-Pvh7u3gGxr
References (18)
-
F. Glover (1974)
Polyhedral convexity cuts and negative edge extensionsZeitschrift für Operations Research, 18
-
F. Glover (1973)
Convexity Cuts and Cut SearchOper. Res., 21
-
R. Mueller (1970)
A Method for Solving the Indefinite Quadratic Programming ProblemManagement Science, 16
-
Z. Kmietowicz, F. Hillier, G. Lieberman (1968)
Introduction to Operations Research., 139
-
E. Balas (1972)
Integer programming and convex analysis: Intersection cuts from outer polarsMathematical Programming, 2
-
A. Cabot, R. Francis (1970)
Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme PointsOper. Res., 18
-
G. Owen (1973)
Cutting planes for programs with disjunctive constraintsJournal of Optimization Theory and Applications, 11
-
A. Geoffrion (1970)
Elements of Large-Scale Mathematical Programming Part I: ConceptsManagement Science, 16
-
F. Glover (1973)
Convexity cuts for multiple choice problemsDiscret. Math., 6
-
R. Young (1971)
Hypercylindrically Deduced Cuts in Zero-One Integer ProgramsOper. Res., 19
-
E. Balas, C. Burdet (1973)
Maximizing a Convex Quadratic Function Subject to Linear Constraints. -
R. Cottle, W. Mylander (1969)
RITTER'S CUTTING PLANE METHOD FOR NONCONVEX QUADRATIC PROGRAMMING -
F. Glover, D. Klingman (1973)
Concave Programming Applied to a Special Class of 0-1 Integer ProgramsOper. Res., 21
-
K. Ritter (1966)
A method for solving maximum-problems with a nonconcave quadratic objective functionZeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete, 4
-
W. Candler, R. Townsley (1964)
THE MAXIMIZATION OF A QUADRATIC FUNCTION OF VARIABLES SUBJECT TO LINEAR INEQUALITIES*t -
C. Burdet (1973)
Polaroids: A new tool in non‐convex and in integer programmingNaval Research Logistics Quarterly, 20
-
E. Balas (1971)
Intersection Cuts - A New Type of Cutting Planes for Integer ProgrammingOper. Res., 19
-
F. Glover (1975)
Polyhedral annexation in mixed integer and combinatorial programmingMathematical Programming, 9
- Publisher
- Wiley
- Copyright
- Copyright © 1977 Wiley Subscription Services, Inc., A Wiley Company
- ISSN
- 0894-069X
- eISSN
- 1520-6750
- DOI
- 10.1002/nav.3800240107
- Publisher site
- See Article on Publisher Site
Abstract
In this paper we discuss the properties of a Bilinear Programming problem, and develop a convergent cutting plane algorithm. The cuts involve only a subset of the variables and preserve the special structure of the constraints involving the remaining variables. The cuts are deeper than other similar cuts.
Journal
Naval Research Logistics: An International Journal – Wiley
Published: Mar 1, 1977