An adaptive incremental approach for the solution of convex programming models

A proposed approach for the solution of convex programming problems is introduced. It is based on an incremental procedure and the maximum number of increments does not exceed the total number of constraints. The details of the algorithm are given and an illustrative example is presented.

Saved in:
Bibliographic Details
Published inMathematics and computers in simulation Vol. 35; no. 6; pp. 501 - 508
Main Authors Mahmoud, F.F., Al-Saffar, A.K., Hassan, K.A.
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 01.12.1993
Elsevier
Subjects
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
Mathematical programming
Operational research and scientific management
Operational research. Management science
Programming theory
Theoretical computing
Convex programming
Mathematical programming
Online AccessGet full text

Cover

More Information
Summary:A proposed approach for the solution of convex programming problems is introduced. It is based on an incremental procedure and the maximum number of increments does not exceed the total number of constraints. The details of the algorithm are given and an illustrative example is presented.
ISSN:0378-4754
1872-7166
DOI:10.1016/0378-4754(93)90068-6