FEASIBLE DIRECTION METHODS IN THE ABSENCE OF SLATER'S CONDITIONZLOBEC S.1978; MATH. OPER.-FORSCH. STATIST., OPTIMIZ.; DDR; DA. 1978; VOL. 9; NO 2; PP. 185-196; ABS. GER/RUS; BIBL. 21 REF.Article

MARGINAL VALUES FOR REGIONS OF STABILITY IN CONVEX OPTIMIZATIONZLOBEC S.1982; GLAS. MAT.; ISSN 0017-095X; YUG; DA. 1982; VOL. 17; NO 1; PP. 197-207; ABS. CRO; BIBL. 21 REF.Article

ON THE EQUIVALENCE OF CONVEX AND UNCONSTRAINED OPTIMIZATION PROBLEMSZLOBEC S.1978; GLASN. MAT.; YUG; DA. 1978; VOL. 13; NO 2; PP. 397-407; ABS. SLV; BIBL. 16 REF.Article

A CLASS OF OPTIMALITY CONDITIONS FOR MATHEMATICAL PROGRAMMING PROBLEMS IN BANACH SPACESZLOBEC S.1972; GLASN. MAT.; JUGOSL; DA. 1972; VOL. 7; NO 1; PP. 127-137; ABS. SLOVENE; BIBL. 11 REF.Serial Issue

Characterizing optimality in nonconvex optimizationZLOBEC, S.Yugoslav journal of operations research. 1991, Vol 1, Num 1, pp 3-14, issn 0354-0243Article

Characterizing optimality in nonconvex optimization : addendumZLOBEC, S.Yugoslav journal of operations research. 1992, Vol 2, Num 1, pp 69-71, issn 0354-0243Article

Structural optima in nonlinear programmingZLOBEC, S.Mathematical research. 1988, Vol 45, pp 218-226, issn 0138-3019Article

STABILIZATION AND DETERMINATION OF THE SET OF MINIMAL BINDING CONSTRAINTS IN CONVEX PROGRAMMINGZLOBEC S; CRAVEN BD.1981; MATH. OPERATIONSFORSCH. STAT., SER. OPTIM.; ISSN 0323-3898; DDR; DA. 1981; VOL. 12; NO 2; PP. 203-220; ABS. GER/RUS; BIBL. 27 REF.Article

VARIOUS DEFINITIONS OF THE DERIVATIVE IN MATHEMATICAL PROGRAMMING.MASSAM H; ZLOBEC S.1974; MATH. PROGRAMG; NETHERL.; DA. 1974; VOL. 7; NO 2; PP. 144-161; BIBL. 1 P. 1/2Article

Characterizing an optimal input in perturbed convex programming: corrigendumZLOBEC, S.Mathematical programming. 1986, Vol 35, Num 3, pp 368-371, issn 0025-5610Article

Input optimization. I: Optimal realizations of mathematical modelsZLOBEC, S.Mathematical programming. 1985, Vol 31, Num 3, pp 245-268, issn 0025-5610Article

CALCULATING THE BEST APPROXIMATE SOLUTION OF AN OPERATOR EQUATIONWOLKOWICZ H; ZLOBEC S.1978; MATH. OF COMPUT.; USA; DA. 1978; VOL. 32; NO 144; PP. 1183-1213; BIBL. 41 REF.Article

EXPLICIT SOLUTIONS OF INTERVAL LINEAR PROGRAMSZLOBEC S; BEN ISRAEL A.1973; OPER. RES.; U.S.A.; DA. 1973; VOL. 21; NO 1; PP. 390-393; BIBL. 6 REF.Serial Issue

OPTIMALITY IN CONVEX PROGRAMMING: A FEASIBLE DIRECTIONS APPROACH = OPTIMALITE EN PROGRAMMATION CONVEXE: UNE APPROCHE A L'AIDE DES DIRECTIONS REALISABLESBEN ISRAEL A; BEN TAL A; ZLOBEC S et al.1982; MATH. PROGRAM. STUDY; ISSN 0303-3929; NLD; DA. 1982; VOL. 19; PP. 16-38; BIBL. 40 REF.Article

CHARACTERIZATION OF OPTIMALITY IN CONVEX PROGRAMMING WITHOUT A CONSTRAINT QUALIFICATION.BEN TAL A; BEN ISRAEL A; ZLOBEC S et al.1976; J. OPTIMIZ. THEORY APPL.; U.S.A.; DA. 1976; VOL. 20; NO 4; PP. 417-438; BIBL. 1 P.Article

Stability of efficiency evaluations in data envelopment analysisCHARNES, A; ZLOBEC, S.Zeitschrift für Operations Research. 1989, Vol 33, Num 3, pp 167-179, issn 0373-790X, 13 p.Article

On a necessary condition for stability in perturbed linear and convex programmingSEMPLE, J; ZLOBEC, S.Zeitschrift für Operations Research. 1987, Vol 31, Num 5, pp A161-A172, issn 0373-790XArticle

A simple constraint qualification in convex programmingZHOU, X; MOKHTARIAN, F. S; ZLOBEC, S et al.Mathematical programming. 1993, Vol 61, Num 3, pp 385-397, issn 0025-5610Article

On a method of Weierstrass for the simultaneous calculation of the roots of a polynomialHOPKINS, M; MARSHALL, B; SCHMIDT, G et al.Zeitschrift für angewandte Mathematik und Mechanik. 1994, Vol 74, Num 8, pp 295-306, issn 0044-2267Article

A saddle-point characterization of Pareto optimaVAN ROOYEN, M; ZHOU, X; ZLOBEC, S et al.Mathematical programming. 1994, Vol 67, Num 1, pp 77-88, issn 0025-5610Article