论文信息 - The bilinear programming problem

The bilinear programming problem

The paper deals with bilinear programming problems and develops a finite algorithm using the “piecewise strategy” for large‐scale systems. It consists of systematically generating a sequence of expanding polytopes with the global optimum within each polytope being known. The procedure then stops when the final polytope contains the feasible region.

C. M. Shetty | Harish Vaish | H. Vaish

[1] L. Cooper. Location-Allocation Problems , 1963 .

[2] Richard H. Shachtman. Generation of the Admissible Boundary of a Convex Polytope , 1974, Oper. Res..

[3] Egon Balas,et al. Intersection Cuts - A New Type of Cutting Planes for Integer Programming , 1971, Oper. Res..

[4] Philip B. Zwart. Global Maximization of a Convex Function with Linear Inequality Constraints , 1974, Oper. Res..

[5] Philip B. Zwart,et al. Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms , 1973, Oper. Res..