Stability of the Dual Cutting-Plane Algorithm for Concave Programming.

by Bennett L. Fox

Purchase

Purchase Print Copy

 FormatList Price Price
Add to Cart Paperback22 pages $20.00 $16.00 20% Web Discount

Demonstration of a computational approach to large-scale optimization of decomposable systems based on a modification of Zangwell's dual cutting-plane algorithm for concave programming. The discussion is concerned with situations in which the subproblems cannot be solved exactly in a finite number of steps, the usual case for nonlinear problems. The problem is reduced to a sequence of Lagrangean maximizations and these separate for a problem with linearly coupled subsystems. It is shown that unless one has a finite algorithm that solves the subproblem to within a given tolerance, the algorithm will not be stable. If the algorithm stops at a given iteration, a near-optimal solution results; if the algorithm does not stop, it converges; and if the convergence is infinite, an optimal solution is approached. A geometrical interpretation is presented. This study is part of RAND's research effort in specialized mathematical programming useful for allocation supply items such as Air Force spares. The dual cutting-plane algorithm is currently being used to solve approximately certain nonconcave programs arising from Air Force logistics problems. (See also RM-5829.) 22 pp. Ref.

This report is part of the RAND Corporation Research memorandum series. The Research Memorandum was a product of the RAND Corporation from 1948 to 1973 that represented working papers meant to report current results of RAND research to appropriate audiences.

Our mission to help improve policy and decisionmaking through research and analysis is enabled through our core values of quality and objectivity and our unwavering commitment to the highest level of integrity and ethical behavior. To help ensure our research and analysis are rigorous, objective, and nonpartisan, we subject our research publications to a robust and exacting quality-assurance process; avoid both the appearance and reality of financial and other conflicts of interest through staff training, project screening, and a policy of mandatory disclosure; and pursue transparency in our research engagements through our commitment to the open publication of our research findings and recommendations, disclosure of the source of funding of published research, and policies to ensure intellectual independence. For more information, visit www.rand.org/about/research-integrity.

The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.