摘要:

We consider the optimization problem (P), α =infh(G),, whereG≠ Ø is a subset of a locally convex spaceFandh:F→R, “embedded” into a family of optimization problemswhereXis a locally convex space and φ:F×X→R.For surrogate dual, respectively. Lagrangian dual problems (Q), β = sup λ(X*), to (P),, defined with the aid of this embedding, we give necessary and sufficient conditions for α = β,involving functionals φ εX*and level sets off, respectively ofᵮ(x,t), =f(x), +t(xεX,tεR),, or involving surrogate ε-subdifferentials (which we introduce here),, respectively ε-subdifferentials off(ε ≧ 0),. We give applications to, optimization problems perturbed by multifunctions and to optimization problems for systems, obtaining conditions for surrogate duality in terms of functionals φ εX*and the level sets ofh.

ISSN:0323-3898    

DOI:10.1080/02331938408842904

出版商:Akademic-Verlag    

年代:1984

数据来源: Taylor

摘要:

On my paper “On sufficient condition of vector optimization” (Methods of Oper. Res. 43 (1981) 151-157) I gave sufficient conditions for local Pareto minima. Those condition among others contain a very restrictive one, namely that the intersection of the kernel of performance operator and the kernel of constraints containing only 0. The present note shows the essentiality of the above-mentioned condition. Moreover in the paper a procedure is proposed how to act in the absence of that condition. The procedure is illustrated by a numerical example.

ISSN:0323-3898    

DOI:10.1080/02331938408842905

出版商:Akademic-Verlag    

年代:1984

数据来源: Taylor

摘要:

With the help of the pole-polar theory every quadratic optimization problem (of theRn)P: mincan be transfornled into an equivalent optimization problemPowhose objective functionfohas the form.

ISSN:0323-3898    

DOI:10.1080/02331938408842906

出版商:Akademic-Verlag    

年代:1984

数据来源: Taylor

摘要:

Tichomirow, V.M.:Grundprinzipien der Theorie der Extremalaufgaben. Teubner-Texte zur Mathematik. Bd. 30. Teubner Verlagsgesellschaft Leipzig 1982, 152 S., Kart. 16,-M.

ISSN:0323-3898    

DOI:10.1080/02331938408842907

出版商:Akademic-Verlag    

年代:1984

数据来源: Taylor

摘要:

Related t o a concept of Gol'stejn/Tretjakov (1974) for convex programming we investigate a class of modified Lagrangians for nonconves problems. We formulate local duality and sensitivity results. Theorem 10 containing the main result of the paper allows to estimate the rate of convergence for a, class of multiplier methods. Some special results shown by BLT-s (1972), Poljak/Tretjakov (1973) and Bertseeas (1975), (1976) follow from t h e generally proved theorems of this paper.

ISSN:0323-3898    

DOI:10.1080/02331938408842908

出版商:Akademic-Verlag    

年代:1984

数据来源: Taylor

摘要:

By means of augmented Lagrangians some dual optimization problem is constructed and the properties of this dual problem are investigated. An approximated Newton's method is applied to solve the senerated auxiliary problems. This paper deals with the investigation of the convergence of the presented algorithm.

ISSN:0323-3898    

DOI:10.1080/02331938408842909

出版商:Akademic-Verlag    

年代:1984

数据来源: Taylor

摘要:

Hwang, C.L.; A.S.M. Masud:Multiple Objective Decision Making-Methods and Applicatioins. A Stade-of the-Art Survey.Springer Verlag Berlin Heidelberg New York 1979, XII, 351 S., figs., 35 tab.m DM 35,50.

ISSN:0323-3898    

DOI:10.1080/02331938408842910

出版商:Akademic-Verlag    

年代:1984

数据来源: Taylor

摘要:

It will be shown that the ”general concept“ of the Hungarian method (in some books this concept alone is called Hungarian method) does not supply an algorithm which in general terminates after a finite number of steps.

ISSN:0323-3898    

DOI:10.1080/02331938408842911

出版商:Akademic-Verlag    

年代:1984

数据来源: Taylor

摘要:

Matsuo, T.:Realization Theory of Continous-Time Dynamical Systems. Lecture Notes in Control and Information Sciences. Vol. 32, Springer Verlag Berlin, Heidelberg, New York 1981, VI, 320 S., DM 36,50.

ISSN:0323-3898    

DOI:10.1080/02331938408842912

出版商:Akademic-Verlag    

年代:1984

数据来源: Taylor

摘要:

A general network model with finitely or infinitely many activities is considered. Each activity may require several storable resources. Fixed resource amounts are delivered at fixed times. Necessary and sufficient conditions are given so that for a system of start times and durations of the activities no lack of resources appears at any time, and a method is presented to determine such a system, Further, the paper deals with the case random resource requirements. For this ease, resource requirements are estimated, and the probability that, at any time, there appears no lack of resources for a system of start times and durations is considered. Finally, it is described how to treat the case where also non-storable resources have to be taken into account.

ISSN:0323-3898    

DOI:10.1080/02331938408842913

出版商:Akademic-Verlag    

年代:1984

数据来源: Taylor