Minimization of a Non-Separable Objective Function Subject to Disjoint Constraints

We consider an important class of mathematical programs, in which the vector variable can be partitioned into two subvectors corresponding to independent constraint sets. Necessary and sufficient conditions for optimal solutions are developed, and two approaches for obtaining solutions are reviewed. We present an enumeration approach, reducing the problem to a finite number of subproblems, and show that duality makes the solution of many of the subproblems unnecessary. Next, we develop an alternating approach, wherein the problem is solved for one of the subvectors while the other is held constant, and then the subvector roles are reversed. This procedure is observed to converge to partial optimum solutions. A widely applicable subclass of problems includes a linear program in one of the subvectors. For this subclass a sufficient condition for local optimality is determined. The condition is easily testable and fails to hold, in many cases, only if a better solution is obtained. Also, this condition shows that partial optimum solutions are almost always local optima.

[1]  Leon Cooper,et al.  SOLUTIONS OF GENERALIZED LOCATIONAL EQUILIBRIUM MODELS , 1967 .

[2]  Richard E. Wendell,et al.  LOCATION AND PRODUCTION—A SPECIAL CASE , 1972 .

[3]  R. L. Francis,et al.  Properties of a multifacility location problem involving euclidian distances , 1972 .

[4]  Richard E. Wendell,et al.  Location Theory, Dominance, and Convexity , 1973, Oper. Res..

[5]  Richard Edward Wendell.  Some aspects in the theory of location , 1971 .

[6]  G. O. Wesolowsky,et al.  Technical Note - The Optimal Location of New Facilities Using Rectangular Distances , 1971, Oper. Res..

[7]  Leon Cooper,et al.  The Transportation-Location Problem , 1972, Oper. Res..

[8]  D. Kohler.  PROJECTIONS OF CONVEX POLYHEDRAL SETS , 1967 .

[9]  O. Mangasarian.  Equilibrium Points of Bimatrix Games , 1964 .

[10]  R. Wets,et al.  ALGORITHMS FOR FRAMES AND LINEALITY SPACES OF CONES. , 1967 .

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

[12]  D. H. Marks,et al.  An Analysis of Private and Public Sector Location Models , 1970 .

[13]  G. Thompson,et al.  An operator theory of parametric programming for the transportation problem‐II , 1972 .

[14]  Leon Cooper,et al.  Heuristic Methods for Location-Allocation Problems , 1964 .

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

[16]  Maurice Hanan,et al.  A review of the placement and quadratic assignment problems , 1972 .

[17]  H. Raiffa,et al.  3. The Double Description Method , 1953 .

[18]  Hiroshi Konno.  Bilinear Programming: Part I. Algorithm for Solving Bilinear Programs. , 1971 .