Generalized bilinear programming: Part I. Models, applications and linear programming relaxation

[1]  J. Nash.  NON-COOPERATIVE GAMES , 1951, Classics in Game Theory.

[2]  M. Balinski.  An algorithm for finding all vertices of convex polyhedral sets , 1959 .

[3]  Harlan D. Mills,et al.  Equilibrium Points in Finite Games , 1960 .

[4]  J. B. Rosen.  The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints , 1960 .

[5]  C. E. Lemke,et al.  Equilibrium Points of Bimatrix Games , 1964 .

[6]  David H. Evans.  Modular Design—A Special Case in Nonlinear Programming , 1963 .

[7]  O. Mangasarian,et al.  Two-person nonzero-sum games and quadratic programming , 1964 .

[8]  Abraham Charnes,et al.  Modular Design, Generalized Inverses, and Convex Programming , 1965 .

[9]  C. E. Lemke,et al.  Bimatrix Equilibrium Points and Mathematical Programming , 1965 .

[10]  J. E. Falk,et al.  An Algorithm for Separable Nonconvex Programming Problems , 1969 .

[11]  J. E. Falk.  Lagrange Multipliers and Nonconvex Programs , 1969 .

[12]  David H. Evans.  Letter to the Editor - A Note on "Modular Design - A Special Case in Nonlinear Programming" , 1970, Oper. Res..

[13]  U. Passy.  Modular Design: An Application of Structured Geometric Programming , 1970, Oper. Res..

[14]  Tim Shaftel.  Technical Note - An Integer Approach to Modular Design , 1971, Oper. Res..

[15]  R. Soland.  An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints , 1971 .

[16]  David P. Rutenberg,et al.  Product Design: Subassemblies for Multiple Markets , 1971 .

[17]  Gary J. Silverman,et al.  Primal Decomposition of Mathematical Programs by Resource Allocation: II—Computational Algorithm with an Application to the Modular Design Problem , 1972 .

[18]  David P. Baron.  Quadratic programming with quadratic constraints , 1972 .

[19]  James E. Falk,et al.  A linear max—min problem , 1973, Math. Program..

[20]  Yves Smeers.  A monotonic passy-like algorithm for the modular design problem , 1974, Math. Program..

[21]  Gary R. Reeves.  Global Minimization in Nonconvex All-Quadratic Programming , 1975 .

[22]  J. G. Ecker,et al.  A Dual Method for Quadratic Programs with Quadratic Constraints , 1975 .

[23]  Hiroshi Konno,et al.  A cutting plane algorithm for solving bilinear programs , 1976, Math. Program..

[24]  Giorgio Gallo,et al.  Bilinear programming: An exact algorithm , 1977, Math. Program..

[25]  Gerald L. Thompson,et al.  A Simplex-Like Algorithm for the Continuous Modular Design Problem , 1977, Oper. Res..

[26]  Hanif D. Sherali,et al.  A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts , 1980, Math. Program..

[27]  E. Phan-huy-Hao,et al.  Quadratically constrained quadratic programming: Some applications and a method for solution , 1982, Z. Oper. Research.

[28]  Gerald L. Thompson,et al.  The continuous multiple‐modular design problem , 1983 .

[29]  James E. Falk,et al.  Jointly Constrained Biconvex Programming , 1983, Math. Oper. Res..

[30]  Autour de la biconvexite en optimisation , 1986 .

[31]  G. Raiconi,et al.  On the minimization of quadratic functions with bilinear constraints via augmented Lagrangians , 1987 .

[32]  Tran Vu Theiu.  A note on the solution of bilinear programming problems by reduction to concave minimization , 1988 .

[33]  Aimo A. Törn,et al.  Global Optimization , 1999, Science.

[34]  F. Al-Khayyal.  Jointly constrained bilinear programs and related problems: an overview , 1990 .

[35]  R. Horst,et al.  A note on adapting methods for continuous global optimization to the discrete case , 1991 .

[36]  F. Al-Khayyal,et al.  Global optimization of a quadratic function subject to a bounded mixed integer consraint set , 1991 .

[37]  Panos M. Pardalos,et al.  Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming , 1992, Ann. Oper. Res..

[38]  Hanif D. Sherali,et al.  Mixed-integer bilinear programming problems , 1993, Math. Program..