Linear Programming Relaxation

Linear Programming Relaxation

List price: US$48.00

Currently unavailable

Add to wishlist

AbeBooks may have this title (opens in new window).

Try AbeBooks


Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In mathematics, the linear programming relaxation of a 0-1 integer program is the problem that arises by replacing the constraint that each variable must be 0 or 1 by a weaker constraint, that each variable belong to the interval [0,1]. That is, for each constraint of the form, of the original integer program, one instead uses a pair of linear constraints. The resulting relaxation is a linear program, hence the name. This relaxation technique transforms an NP-hard optimization problem (integer programming) into a related problem that is solvable in polynomial time (linear programming); the solution to the relaxed linear program can be used to gain information about the solution to the original integer program.
show more

Product details

  • Paperback | 84 pages
  • 152 x 229 x 5mm | 136g
  • Ject Press
  • United States
  • English
  • black & white illustrations
  • 6136778491
  • 9786136778495