A New Algorith and Quadratic Terminability for Linearly Constrained Optimization

Yang Zhonghua; Qu Xinghua

Yang Zhonghua, Qu Xinghua. A New Algorith and Quadratic Terminability for Linearly Constrained Optimization[J]. Journal of Beijing University of Technology, 1992, 18(3): 61-66.

Citation:

Yang Zhonghua, Qu Xinghua. A New Algorith and Quadratic Terminability for Linearly Constrained Optimization[J]. Journal of Beijing University of Technology, 1992, 18(3): 61-66.

Citation:

Yang Zhonghua, Qu Xinghua. A New Algorith and Quadratic Terminability for Linearly Constrained Optimization[J]. Journal of Beijing University of Technology, 1992, 18(3): 61-66.

A New Algorith and Quadratic Terminability for Linearly Constrained Optimization

Graphical Abstract

Graphical Abstract

Abstract

Abstract

A new algorithm for solving nonliear progromming with linear constrains is proposed,it also has proved that the algorithm solved a finite number steps in quadratic programming.

FullText(HTML)

References (0)

Cited By

Turn off MathJax

Article Contents

A New Algorith and Quadratic Terminability for Linearly Constrained Optimization

Graphical Abstract

Abstract

Catalog

Export File

Citation

Format

Content