Skip to main content

Results of the Improvements and Extensions

  • Conference paper
Redundancy in Mathematical Programming

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

  • 120 Accesses

Abstract

In the previous chapter we presented potential improvements on some of the existing size-reduction techniques. We then proposed some new methods for reducing problem size as well as reducing problem size while solving the problem. These extensions consisted of the extended sign test method, the hybrid method and the reduce method.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Karwan, M.H., Lotfi, V., Zionts, S., Telgen, J. (1983). Results of the Improvements and Extensions. In: Redundancy in Mathematical Programming. Lecture Notes in Economics and Mathematical Systems, vol 206. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45535-3_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-45535-3_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11552-6

  • Online ISBN: 978-3-642-45535-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics