✦ LIBER ✦

A duality theorem and an algorithm for (mixed-) integer nonlinear programming

✍ Scribed by Egon Balas

Publisher: Elsevier Science
Year: 1971
Tongue: English
Weight: 667 KB
Volume: 4
Category: Article
ISSN: 0024-3795
DOI: 10.1016/0024-3795(71)90005-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Symmetric duality for minimax nonlinear

Symmetric duality for minimax nonlinear mixed integer programming

✍ V. Kumar; I. Husain; S. Chandra 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 281 KB

An approximate algorithm for nonlinear i

An approximate algorithm for nonlinear integer programming

✍ Vassil Vassilev; Krassimira Genova 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 557 KB

An intelligent algorithm for mixed-integ

An intelligent algorithm for mixed-integer programming models

✍ Youling Lin; Larry M. Austin; James R. Burns 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 843 KB

An implicit branch-and-bound algorithm f

An implicit branch-and-bound algorithm for mixed-integer-linear programming

✍ Youling Lin; Larry M. Austin; James R. Burns 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 596 KB

An approximate method for local optima f

An approximate method for local optima for nonlinear mixed integer programming problems

✍ Li Han-Lin 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 759 KB

An approximation algorithm for quadratic

An approximation algorithm for quadratic cost 0–1 mixed integer programming problems

✍ Kumiko Mukai; Keiji Tatsumi; Masao Fukushima 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 586 KB

In this paper, we focus on the quadratic cost 01 mixed integer programming problem. First, we formulate the problem as a two-level programming problem that consists of a lower-level continuous quadratic programming problem with 01 variables fixed and an upper-level nonlinear 01 programming problem.