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

A Lagrangean dual-based solution method for a special linear programming problem

โœ Scribed by Mark H. Karwan; Balasubramanian Ram

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
516 KB
Volume
14
Category
Article
ISSN
0305-0548

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A dual parameterization algorithm for li
A dual parameterization algorithm for linear quadratic semi-infinite programming problems
โœ Y. Liu; K.L. Teo ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 461 KB

In this paper, we consider a class of \(\mathrm{LQ}\) semi-infinite programming (SIP) problems where the objective function is positive quadratic and the linear infinite constraint functions continuously depend on its index variable on a compact set. By using the dual parameterization technique, thi

A nonisolated optimal solution for speci
A nonisolated optimal solution for special reverse convex programming problems
โœ Pei-Ping Shen; Yong-Qiang Chen; Yuan Ma ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 696 KB

In this paper, an efficient algorithm is proposed for globally solving special reverse convex programming problems with more than one reverse convex constraints. The proposed algorithm provides a nonisolated global optimal solution which is also stable under small perturbations of the constraints, a