This paper gives a proof of convergence of an iterative method for maximizing a concave function subject to inequality constraints involving convex functions. The linear programming problem is an important special case. The primary feature is that each iteration is very simple computationally, involving only one of the constraints. Although the paper is theoretical in nature, some numerical results are included.
机构:
UNIV CALIF LOS ANGELES, SCH ENGN & APPL SCI, DEPT SYST SCI, LOS ANGELES, CA 90024 USAUNIV CALIF LOS ANGELES, SCH ENGN & APPL SCI, DEPT SYST SCI, LOS ANGELES, CA 90024 USA
HILLESTAD, RJ
JACOBSEN, SE
论文数: 0引用数: 0
h-index: 0
机构:
UNIV CALIF LOS ANGELES, SCH ENGN & APPL SCI, DEPT SYST SCI, LOS ANGELES, CA 90024 USAUNIV CALIF LOS ANGELES, SCH ENGN & APPL SCI, DEPT SYST SCI, LOS ANGELES, CA 90024 USA