✦ LIBER ✦

Bound on integrals: Elimination of the dual and reduction of the number of equality constraints

✍ Scribed by F. De Vylder

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 644 KB
Volume: 2
Category: Article
ISSN: 0167-6687
DOI: 10.1016/0167-6687(83)90008-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generalized programming by linear approx

Generalized programming by linear approximation of the dual gradient: Equality constraints

✍ J. Franklin Sharp; Michael H. Wagner 📂 Article 📅 1975 🏛 John Wiley and Sons 🌐 English ⚖ 392 KB

On the differentiability of optimal valu

On the differentiability of optimal values for bounded nonlinear programs with equality constraints

✍ Okitsugu Fujiwara 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 452 KB

Bounds on the number of constraints for

Bounds on the number of constraints for balanced arrays of strength t

✍ G.M. Saha; Rahul Mukerjee; Sanpei Kageyama 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 686 KB

Application of the problem of moments to

Application of the problem of moments to derive bounds on integrals with integral constraints

✍ M.J. Goovaerts; R. Kaas 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 1012 KB

On the number of cyclically distinct bin

On the number of cyclically distinct binary sequences having no internal periodicity and satisfying certain equality constraints

✍ J Christensen; P.R Bryant 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 687 KB

On the equality of the grundy and ochrom

On the equality of the grundy and ochromatic numbers of a graph

✍ P. Erdös; W. R. Hare; S. T. Hedetniemi; R. Laskar 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 162 KB 👁 1 views

It is proved in this note that the Grundy number, r(G), and the ochromatic number, xo(G), are the same for any graph G. An n-coloring of a graph G = ( V , E ) is a f u n c t i o n f f r o m V onto N = { I , 2 , . . . , n } such that, whenever vertices id and u are adjacent, then f ( u ) f f(u). An