Skip to main content
Book cover

Optimization with Disjunctive Constraints

  • Book
  • © 1980

Overview

Part of the book series: Lecture Notes in Economics and Mathematical Systems (LNE, volume 181)

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (8 chapters)

Keywords

About this book

The disjunctive cut principle of Balas and Jeroslow, and the related polyhedral annexation principle of Glover, provide new insights into cutting plane theory. This has resulted in its ability to not only subsume many known valid cuts but also improve upon them. Originally a set of notes were written for the purpose of putting together in a common terminology and framework significant results of Glover and others using a geometric approach, referred to in the literature as convexity cuts, and the algebraic approach of Balas and Jeroslow known as Disjunctive cuts. As it turned out subsequently the polyhedral annexation approach of Glover is also closely connected with the basic disjunctive principle of Balas and Jeroslow. In this monograph we have included these results and have also added several published results which seem to be of strong interest to researchers in the area of developing strong cuts for disjunctive programs. In particular, several results due to Balas [4,5,6,7], Glover [18,19] and Jeroslow [23,25,26] have been used in this monograph. The appropriate theorems are given without proof. The notes also include several results yet to be published [32,34,35] obtained under a research contract with the National Science Foundation to investigate solution methods for disjunctive programs. The monograph is self-contained and complete in the sense that it attempts to pool together existing results which the authors viewed as important to future research on optimization using the disjunctive cut approach.

Authors and Affiliations

  • School of Industrial Engineering and Operations Research, Virginia Polytechnic Institute and State University, Blacksburg, USA

    Hanif D. Sherali

  • School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, USA

    C. M. Shetty

Bibliographic Information

  • Book Title: Optimization with Disjunctive Constraints

  • Authors: Hanif D. Sherali, C. M. Shetty

  • Series Title: Lecture Notes in Economics and Mathematical Systems

  • DOI: https://doi.org/10.1007/978-3-642-48794-1

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1980

  • Softcover ISBN: 978-3-540-10228-1Published: 01 August 1980

  • eBook ISBN: 978-3-642-48794-1Published: 06 December 2012

  • Series ISSN: 0075-8442

  • Series E-ISSN: 2196-9957

  • Edition Number: 1

  • Number of Pages: VIII, 162

  • Topics: Operations Research/Decision Theory

Publish with us