✦ LIBER ✦

Convex compactifications and special extensions of optimization problems

✍ Scribed by Tomáš Roubíček

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 865 KB
Volume: 16
Category: Article
ISSN: 0362-546X
DOI: 10.1016/0362-546x(91)90199-b

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Stable extensions of constrained optimiz

Stable extensions of constrained optimization problems

✍ Tomáš Roubíček 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 970 KB

Uniform convergence of convex optimizati

Uniform convergence of convex optimization problems

✍ P Kanniappan; Sundaram M.A Sastry 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 468 KB

Estimation of the error in convex polyno

Estimation of the error in convex polynomial optimization problems

✍ V.N. Nefedov 📂 Article 📅 1990 🏛 Elsevier Science ⚖ 918 KB

Extension of M-Convexity and L-Convexity

Extension of M-Convexity and L-Convexity to Polyhedral Convex Functions

✍ Kazuo Murota; Akiyoshi Shioura 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 454 KB

The concepts of M-convex and L-convex functions were proposed by Murota in 1996 as two mutually conjugate classes of discrete functions over integer lattice points. M/L-convex functions are deeply connected with the well-solvability in nonlinear combinatorial optimization with integer variables. In

A special class of problems of geometric

A special class of problems of geometric optimization

✍ M.F. Kaspshitskaya; I.V. Sergienko; A.I. Stiranka 📂 Article 📅 1985 🏛 Elsevier Science ⚖ 399 KB

Method of feasible directions for solvin

Method of feasible directions for solving problems of convex multicriterion optimization

✍ V.G. Zhadan; V.I. Kushnirchuk 📂 Article 📅 1987 🏛 Elsevier Science ⚖ 520 KB