An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes
暂无分享,去创建一个
[1] James E. Falk,et al. Concave Minimization Via Collapsing Polytopes , 1986, Oper. Res..
[2] F. Al-Khayyal. Jointly constrained bilinear programs and related problems: an overview , 1990 .
[3] F. Al-Khayyal. An implicit enumeration procedure for the general linear complementarity problem , 1987 .
[4] Garth P. McCormick,et al. Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems , 1976, Math. Program..
[5] K. R. Gehner,et al. Necessary and Sufficient Optimality Conditions for the Fritz John Problem with Linear Equality Constraints , 1974 .
[6] Panos M. Pardalos,et al. Constrained Global Optimization: Algorithms and Applications , 1987, Lecture Notes in Computer Science.
[7] J. E. Falk. Lagrange Multipliers and Nonconvex Programs , 1969 .
[8] Stephen J. Grotzinger,et al. Supports and convex envelopes , 1985, Math. Program..
[9] K. Grasse,et al. A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization , 1986 .
[10] James E. Falk,et al. Jointly Constrained Biconvex Programming , 1983, Math. Oper. Res..