✦ LIBER ✦

Elements of a theory in non-convex programming

✍ Scribed by Claude-Alain Burdet

Publisher: John Wiley and Sons
Year: 1977
Tongue: English
Weight: 835 KB
Volume: 24
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.3800240105

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Decomposition in a non-linear programmin

Decomposition in a non-linear programming problem with a non-convex constraint

✍ A.I. Kosolap 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 316 KB

A theorem in convex programming

✍ William Karush 📂 Article 📅 1959 🏛 John Wiley and Sons 🌐 English ⚖ 558 KB

## System Develofiment Corporation S a n t a Monica, California An optimization problem which frequently a r i s e s in applications of mathematical programming is the following: t fn (xn)l , A 5x1' . . . Lx, 5 B where f i a r e convex functions. In this paper, the function F i s studied and show

Polaroids: A new tool in non-convex and

Polaroids: A new tool in non-convex and in integer programming

✍ Claude-Alain Burdet 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 522 KB

A class of convex programming methods

✍ E.A. Nurminskii 📂 Article 📅 1986 🏛 Elsevier Science ⚖ 572 KB

A class of continuous convex programming

A class of continuous convex programming problems

✍ Morgan A Hanson; Bertram Mond 📂 Article 📅 1968 🏛 Elsevier Science 🌐 English ⚖ 408 KB

On a method of unconditional optimizatio

On a method of unconditional optimization in convex programming

✍ Vi.D. Mazurov 📂 Article 📅 1967 🏛 Elsevier Science ⚖ 304 KB