Please use this identifier to cite or link to this item:
http://hdl.handle.net/11718/3537
Title: | On connections between zero-one integer programming and concave programming under linear constraints |
Authors: | Raghavachari, M. |
Issue Date: | 31-May-1970 |
Citation: | Operations Research, XVII,4, (July-Aug 1969), 680-684. Supplement Operations Research, XVIII,3, (May-June 1970), 564-565 |
Abstract: | Consider the zero-one integer programming problem Pi:minimize Z=c'x subject to Axrb, O<xj<1, xi=O or 1, j=l, 2, **., n, where A is an mXn matrix, c'= (ci, * * *, ca), x'= (xi, *-* *, x), and b is an mXl vector with b'= (bi, **, bin). Assume the elements of A, b, c are all rational. This paper characterizes the feasible solutions of P1, shows that P1 is equivalent to a problem of minimizing a concave quadratic objective function over a convex set, and applies a method developed by TuT to solve such a problem to yield a procedure for the zero-one integer programming problem. |
URI: | http://hdl.handle.net/11718/3537 |
Appears in Collections: | Journal Articles |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
onconnectionsbetweenzeroone.pdf Restricted Access | 302.87 kB | Adobe PDF | View/Open Request a copy |
Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.