作者: Ivan I. Eremin
DOI: 10.1007/978-1-4757-3403-4_2
关键词: Feasible region 、 Dual (category theory) 、 Disjunctive programming 、 Reduction (recursion theory) 、 Lagrangian 、 Argument (linguistics) 、 Computer science 、 Algebra 、 Unconstrained optimization 、 Saddle point
摘要: In this paper we investigate the problems of disjunctive programming with an infinite array components forming a feasible set (as their union). The investigation continues theme author’s article [7] and describes original conceptual approach to a) analysis saddle point problem for Lagrangian functions, b) dual relations problems, c) technique equivalent (with respect argument) reduction such unconstrained optimization.