๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An active-set algorithm for nonlinear programming using parametric linear programming

โœ Scribed by Byrd, Richard H.; Waltz, Richard A.

Book ID
127278061
Publisher
Taylor and Francis Group
Year
2011
Tongue
English
Weight
301 KB
Volume
26
Category
Article
ISSN
1055-6788

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Active Set Identification in Nonlinear P
Active Set Identification in Nonlinear Programming
โœ Oberlin, Christina; Wright, Stephen J. ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 303 KB
Using Lexicographic Parametric Programmi
Using Lexicographic Parametric Programming for Searching a Non-dominated Set in Multiple-Objective Linear Programming
โœ Pekka Korhonen; Merja Halme ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 650 KB

In this paper we propose an approach which makes it possible to search non-dominated and only non-dominated solutions in multiple-objective linear programming. The approach is based on the use of a reference direction and lexicographic parametric programming. The requisite theory is developed in the

A steepest edge active set algorithm for
A steepest edge active set algorithm for solving sparse linear programming problems
โœ S. W. Sloan ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 863 KB

A steepest edge active set algorithm is described which is suitable for solving linear programming problems where the constraint matrix is sparse and has more rows than columns. The algorithm uses a steepest edge criterion for selecting the search direction at each iteration and recurrence relations