Skip to main content

Optimal Inscribing of Two Balls into Polyhedral Set

  • Chapter
  • First Online:
Optimization, Simulation, and Control

Part of the book series: Springer Optimization and Its Applications ((SOIA,volume 76))

Abstract

In this chapter, we consider the problem for optimal inscribing of two balls into bounded polyhedral set, so that sum of their radiuses is maximized. We formulate this problem as a bilevel programming problem and investigated its some properties. The gradient-based method for solving it has been proposed. We illustrate our approach on some test problems.

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
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Notes

  1. 1.

    This means that primary and dual problems (5) and (11) are nondegenerated.

References

  1. Amir Beck and Yonina C. Eldar, Regularization in Regression with Bounded Noise: A Chebyshev Center Approach SIAM. J. Matrix Anal. and Appl. Volume 29, Issue 2, pp. 606–625 (2007) Published May 1, 2007

    Google Scholar 

  2. Er-Wei Bai, Yinyu Ye, and Roberto Tempo Bounded Error Parameter Estimation: A Sequential Analytic Center Approach IEEE Transactions on Automatic Control, Vol. 44, No. 6, pp. 1107–1117 June 1999

    Google Scholar 

  3. Halteman, Edward J. The Chebyshev center: A multidimensional estimate of location. J. Stat. Plann. Inference 13, 389–394 (1986).

    Google Scholar 

  4. Tyrrell R. Rockafellar. Convex analysis. Number 28 in Princeton Mathematical Series. Princeton University Press, Princeton, N.J., 1970.

    Google Scholar 

  5. J. F. Traub, G. Wasikowski, and H. Wozniakowski, Information-Based Complexity. New York: Academic, 1988.

    Google Scholar 

  6. Yudin DB, Gol’shtein EG, Linear programming, Israel Program of Scientific Translations, Jerusalem, 1965

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bazarragchaa Barsbold .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media New York

About this chapter

Cite this chapter

Enkhbat, R., Barsbold, B. (2013). Optimal Inscribing of Two Balls into Polyhedral Set. In: Chinchuluun, A., Pardalos, P., Enkhbat, R., Pistikopoulos, E. (eds) Optimization, Simulation, and Control. Springer Optimization and Its Applications, vol 76. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-5131-0_3

Download citation

Publish with us

Policies and ethics