Penalty for zero-one integer equivalent problem

Bahman Kalantari, J. B. Rosen

Research output: Contribution to journalArticle

22 Citations (Scopus)

Abstract

The equivalence of zero-one integer programming and a concave quadratic penalty function problem has been shown by Raghavachari, for a sufficiently large value of the penalty. A lower bound for this penalty is obtained here, which in specific cases cannot be reduced.

Original languageEnglish (US)
Pages (from-to)229-232
Number of pages4
JournalMathematical Programming
Volume24
Issue number1
DOIs
StatePublished - Dec 1 1982

Fingerprint

Integer programming
Penalty
Integer
Zero
Penalty Function
Integer Programming
Quadratic Function
Equivalence
Lower bound
Penalty function
Lower bounds

All Science Journal Classification (ASJC) codes

  • Software
  • Mathematics(all)

Keywords

  • Concave Quadratic Programming
  • Global Minimum
  • Integer Programming

Cite this

Kalantari, Bahman ; Rosen, J. B. / Penalty for zero-one integer equivalent problem. In: Mathematical Programming. 1982 ; Vol. 24, No. 1. pp. 229-232.
@article{51e6f1513cdc40fabfeca80c224e76c0,
title = "Penalty for zero-one integer equivalent problem",
abstract = "The equivalence of zero-one integer programming and a concave quadratic penalty function problem has been shown by Raghavachari, for a sufficiently large value of the penalty. A lower bound for this penalty is obtained here, which in specific cases cannot be reduced.",
keywords = "Concave Quadratic Programming, Global Minimum, Integer Programming",
author = "Bahman Kalantari and Rosen, {J. B.}",
year = "1982",
month = "12",
day = "1",
doi = "10.1007/BF01585106",
language = "English (US)",
volume = "24",
pages = "229--232",
journal = "Mathematical Programming",
issn = "0025-5610",
publisher = "Springer-Verlag GmbH and Co. KG",
number = "1",

}

Penalty for zero-one integer equivalent problem. / Kalantari, Bahman; Rosen, J. B.

In: Mathematical Programming, Vol. 24, No. 1, 01.12.1982, p. 229-232.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Penalty for zero-one integer equivalent problem

AU - Kalantari, Bahman

AU - Rosen, J. B.

PY - 1982/12/1

Y1 - 1982/12/1

N2 - The equivalence of zero-one integer programming and a concave quadratic penalty function problem has been shown by Raghavachari, for a sufficiently large value of the penalty. A lower bound for this penalty is obtained here, which in specific cases cannot be reduced.

AB - The equivalence of zero-one integer programming and a concave quadratic penalty function problem has been shown by Raghavachari, for a sufficiently large value of the penalty. A lower bound for this penalty is obtained here, which in specific cases cannot be reduced.

KW - Concave Quadratic Programming

KW - Global Minimum

KW - Integer Programming

UR - http://www.scopus.com/inward/record.url?scp=34250225322&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34250225322&partnerID=8YFLogxK

U2 - 10.1007/BF01585106

DO - 10.1007/BF01585106

M3 - Article

VL - 24

SP - 229

EP - 232

JO - Mathematical Programming

JF - Mathematical Programming

SN - 0025-5610

IS - 1

ER -