Optimal Inscribing of Two Balls into Polyhedral Set

Rentsen Enkhbat () and Bazarragchaa Barsbold ()
Additional contact information
Rentsen Enkhbat: National University of Mongolia
Bazarragchaa Barsbold: National University of Mongolia

A chapter in Optimization, Simulation, and Control, 2013, pp 35-47 from Springer

Abstract: 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.

Keywords: Chebyshev center; Continuity; Differentiability; Bilevel programming problem (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-1-4614-5131-0_3

Ordering information: This item can be ordered from
http://www.springer.com/9781461451310

DOI: 10.1007/978-1-4614-5131-0_3

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().