𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computing an interior point for inequalities using linear optimization

✍ Scribed by Richard J Hanson

Publisher
Elsevier Science
Year
1979
Tongue
English
Weight
90 KB
Volume
5
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

✦ Synopsis

The problem of finding the middle of a feasible region defined by solutions to a set of linear inequalities is considered. The solution of this problem is formulated as a primal-dual pair of linear optimization problems whose solutions can be obtained using linear programming computations.

(*) This work was supported by the U.S. Department of Energy (DOE) under contract no.

AT (29-1)-789.

πŸ“œ SIMILAR VOLUMES

Interior-point method for non-linear non
Interior-point method for non-linear non-convex optimization
✍ Ladislav LukΕ‘an; Ctirad Matonoha; Jan Vlček πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 182 KB

## Abstract In this paper, we propose an algorithm for solving non‐linear non‐convex programming problems, which is based on the interior point approach. Main theoretical results concern direction determination and step‐length selection. We split inequality constraints into active and inactive to o