✦ LIBER ✦

Reduced-direction methods for the non-linear programming problem

✍ Scribed by V.S. Izhutkin; M.Yu. Kokurin

Publisher: Elsevier Science
Year: 1988
Weight: 776 KB
Volume: 28
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(88)90056-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The method of penalty functions for non-

The method of penalty functions for non-linear programming problems

✍ V.D. Skarin 📂 Article 📅 1973 🏛 Elsevier Science ⚖ 773 KB

The Ψ-transform for solving linear and n

The Ψ-transform for solving linear and non-linear programming problems

✍ V.K. Chichinadze 📂 Article 📅 1969 🏛 Elsevier Science 🌐 English ⚖ 710 KB

The global extremum value, as well as its coordinates, of a non-linear multidimensional objective function may be found approximately, but practically, as the zero value of its transformation, a monotonically decreasing scalar function. Summary--This paper is concerned with the problem of determinin

The steepest descent direction for the n

The steepest descent direction for the nonlinear bilevel programming problem

✍ Gilles Savard; Jacques Gauvin 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 343 KB

An expansion principle and a method of r

An expansion principle and a method of reducing the discrepancies for problems of linear dynamic programming

✍ V.P. Belukhin 📂 Article 📅 1975 🏛 Elsevier Science ⚖ 881 KB

An interactive goal programming method f

An interactive goal programming method for non-linear multiple-criteria decision-making problems

✍ H.R. Weistroffer 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 925 KB

On a problem of non-linear programming f

On a problem of non-linear programming for unsmooth target functions

✍ Yu.V. Aleksandrov 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 95 KB