Application of mathematical programming in the design of optimal control systems
D Tabak, BC Kuo - International Journal of Control, 1969 - Taylor & Francis
The problem of applying the various computational methods of mathematical programming
in the design of an optimal control system is discussed. A general case of non-linear, non …
in the design of an optimal control system is discussed. A general case of non-linear, non …
The problem of convex programming with linear constraints
AB Piunovskii - Computational mathematics and mathematical physics, 1994 - elibrary.ru
The problem of convex programming with linear constraints КОРЗИНА ПОИСК
НАВИГАТОР СЕССИЯ КОНТАКТЫ ИНФОРМАЦИЯ О ПУБЛИКАЦИИ eLIBRARY ID …
НАВИГАТОР СЕССИЯ КОНТАКТЫ ИНФОРМАЦИЯ О ПУБЛИКАЦИИ eLIBRARY ID …
Methods of searching for guaranteeing and optimistic solutions to integer optimization problems under uncertainty
NV Semenova - Cybernetics and Systems Analysis, 2007 - Springer
The paper studies complex integer optimization problems with inexact coefficients of the
linear objective function and convex quadratic constraint functions. Exact and approximate …
linear objective function and convex quadratic constraint functions. Exact and approximate …
Linear programming
The purpose of linear programming is to optimize a linear function J (x)= fTx of a set of
variables grouped in vector x∈ Rn in the presence of linear constraints. A procedure, which …
variables grouped in vector x∈ Rn in the presence of linear constraints. A procedure, which …
Penalty-, Barrier-, Multiplier-, Interior Point-Methods
HT Jongen, K Meer, E Triesch - Optimization Theory, 2004 - Springer
The so-called Active Set Strategy is used in order to solve optimization problems with
inequality constraints via a sequence of problems with equality constraints only. During the …
inequality constraints via a sequence of problems with equality constraints only. During the …
Minimax problems of discrete optimization invariant under majority operators
EV Vodolazskii, B Flach, MI Schlesinger - Computational Mathematics and …, 2014 - Springer
A special class of discrete optimization problems that are stated as a minimax modification of
the constraint satisfaction problem is studied. The minimax formulation of the problem …
the constraint satisfaction problem is studied. The minimax formulation of the problem …
Polynomial optimization problems
VN Nefedov - USSR Computational Mathematics and Mathematical …, 1987 - Elsevier
POLYNOMIAL OPTIMIZATION PROBLEMS* Page 1 USSR Comput.Maths.Math.Phys.,Vol.27,No.3,pp.l3-21,1987
0041~5553/87 $lO.OQ+O.OO Printed in Great Britain 01988 Pergamon Press plc …
0041~5553/87 $lO.OQ+O.OO Printed in Great Britain 01988 Pergamon Press plc …
Optimization of linear systems by the methods of functional analysis
R Gabasov, FM Kirillova - Journal of Optimization Theory and Applications, 1971 - Springer
This paper presents a survey of recent work dealing with the optimization of linear systems
by the methods of functional analysis. The areas covered are: application of the separability …
by the methods of functional analysis. The areas covered are: application of the separability …
[图书][B] Optimization Techniques IFIP Technical Conference: Novosibirsk, July 1–7, 1974
J Stoer - 2013 - books.google.com
The Proceedings are based on the papers presented at the IFIP Technical Conference on
Optimization Techniques held in Novosibirsk, July 1-7, 1974. The Conference was …
Optimization Techniques held in Novosibirsk, July 1-7, 1974. The Conference was …
Choosing the penalty coefficient in linear programming problems
NO Vil'chevskii - Automation and Remote Control, 1970 - mathnet.ru
The solution of the problem of linear programming is solved by means of the method of
functions of fine. It is shown that the coefficient of fine is expedient to choose as the solution …
functions of fine. It is shown that the coefficient of fine is expedient to choose as the solution …