✦ LIBER ✦

Finding the extremum of a function on a polyhedron

✍ Scribed by I.A. Bakhtin; M.A. Krasnosel'skii; A.Yu. Levin

Publisher: Elsevier Science
Year: 1963
Weight: 666 KB
Volume: 3
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(63)90039-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorihm for finding the extremum of one

Algorihm for finding the extremum of one function in a polyhedron

✍ E.A. Berzin 📂 Article 📅 1966 🏛 Elsevier Science ⚖ 1008 KB

An algorithm for finding the absolute ex

An algorithm for finding the absolute extremum of a function

✍ S.A. Piyavskii 📂 Article 📅 1972 🏛 Elsevier Science ⚖ 687 KB

Extremum points of a convex function

✍ J.M. Soriano 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 271 KB

Minimization of a multi-extremum functio

Minimization of a multi-extremum function with a discontinuity

✍ I.V. Mayurova; R.G. Strongin 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 523 KB

A modification of Hoang T'ui's method of

A modification of Hoang T'ui's method of minimizing a concave function on a polyhedron

✍ L.A. Istomin 📂 Article 📅 1977 🏛 Elsevier Science ⚖ 561 KB

On the section of a convex polyhedron

✍ Peter Frankl; Hiroshi Maehara; Junichiro Nakashima 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 117 KB

Let P be a convex polyhedron in R s, and E be a plane cutting P. Then the section Pt=Pc~E is a convex polygon. We show a sharp inequality (the perimeter of Pe) <~ L(P), where L(P) denotes the sum of the edge-lengths of P. For a polyhedron (or a polygon) X, L(X) denotes the sum of the edge-lengths o