Jointly constrained bilinear programs and related problems: An overview

Computers and Mathematics with Applications

Volumn 19, Issue 11, 1990, Pages 53-62

  Al Khayyal, F A ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002800563     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/0898-1221(90)90148-D     Document Type: Article

References (50)

1. Jointly constrained biconvex programming
2. Equilibrium points in finite games
3. Equilibrium points of bimatrix games
4. The gradient projection method for nonlinear programming, I: linear constraints
5. Two-person nonzero-sum games and quadratic programming
6. An algorithm for finding all vertices of convex polyhedral sets
7. Bilinear programming
8. Solving certain nonconvex quadratic minimization problems by ranking the extreme points
9. Solving the fixed-charge problem by ranking the extreme points
10. A method for solving maximum problems with a nonconcave quadratic objective function
11. A cutting plane algorithm for solving bilinear programs
12. A linear max-min problem
13. Bilinear programming: an exact algorithm
14. Concave programming under linear constraints
15. Nonconvex programming with applications to production and location problems
16. Nonlinear programming counterexamples to two global optimization algorithms
17. The bilinear programming problem
18. A cutting plane algorithm for the bilinear programming problem
19. A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
20. A bilinear programming formulation of the 3-dimensional assignment problem
21. Complementary programming
22. Maximization of a convex quadratic function under linear constraints
23. Bilinear programming: part II. Applications of bilinear programming
24. The rectilinear distance location-allocation problem
25. Minimization of a non-separable objective function subject to disjoint constraints
26. Biconvex programming and deterministic and stochastic location-allocation problems
27. Maximizing a convex quadratic function subject to linear constraints
28. Lagrange multipliers and nonconvex programs
29. Plastic-elastic torsion, optimal stopping and free boundaries
30. Complementary pivot theory of mathematical programming
31. Bimatrix equilibrium points and mathematical programming
32. A variable dimension algorithm for the linear complementarity problem
33. Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
34. An implicit enumeration procedure for the general linear complementarity problem
35. Global optimization approach to the linear complementarity problem
36. A method for solving the indefinite quadratic programming problem
37. The indefinite quadratic programming problem
38. An algorithm for global minimization of linearly constrained concave quadratic functions
39. Global minimization of indefinite quadratic problems
40. Global optimization algorithms for indefinite quadratic problems
41. Global minimization of large-scale constrained concave quadratic problems by separable programming
42. The modular design problem with linear separable side constraints: heuristics and applications
43. On the minimization of quadratic functions with bilinear constraints via augmented Lagrangians
44. Global optimization of concave functions subject to separable quadratic constraints and of all-quadratic separable problems