Works matching IS 0364765X AND DT 1997 AND VI 22 AND IP 2
Results: 13
STATIONARY STRATEGIES FOR RECURSIVE GAMES.
- Published in:
- Mathematics of Operations Research, 1997, v. 22, n. 2, p. 494, doi. 10.1287/moor.22.2.494
- By:
- Publication type:
- Article
SURVIVAL AND GROWTH WITH A LIABILITY: OPTIMAL PORTFOLIO STRATEGIES IN CONTINUOUS TIME.
- Published in:
- Mathematics of Operations Research, 1997, v. 22, n. 2, p. 468, doi. 10.1287/moor.22.2.468
- By:
- Publication type:
- Article
THE COMPACTNESS OF A POLICY SPACE IN DYNAMIC PROGRAMMING VIA AN EXTENSION THEORUM FOR CARATHEODORY FUNCTIONS.
- Published in:
- Mathematics of Operations Research, 1997, v. 22, n. 2, p. 459, doi. 10.1287/moor.22.2.458
- By:
- Publication type:
- Article
A CLOSED FORM SOLUTION FOR THE ASYMMETRIC RANDOM POLLING SYSTEM WITH CORRELATED LEVY INPUT PROCESS.
- Published in:
- Mathematics of Operations Research, 1997, v. 22, n. 2, p. 432, doi. 10.1287/moor.22.2.432
- By:
- Publication type:
- Article
ON A WIDE REGION OF CENTERS AND PRIMAL-DUAL INTERIOR POINT ALGORITHMS FOR LINEAR PROGRAMMING.
- Published in:
- Mathematics of Operations Research, 1997, v. 22, n. 2, p. 408, doi. 10.1287/moor.22.2.408
- By:
- Publication type:
- Article
ON THE CONVERGENCE OF THE ITERATION SEQUENCE OF INFEASIBLE PATH FOLLOWING ALGORITHMS FOR LINEAR COMPLEMENTARITY PROBLEMS.
- Published in:
- Mathematics of Operations Research, 1997, v. 22, n. 2, p. 378, doi. 10.1287/moor.22.2.378
- By:
- Publication type:
- Article
HYPERBOLIC POLYNOMIALS AND INTERIOR POINT METHODS FOR CONVEX PROGRAMMING.
- Published in:
- Mathematics of Operations Research, 1997, v. 22, n. 2, p. 350, doi. 10.1287/moor.22.2.350
- By:
- Publication type:
- Article
FREE-STEERING RELAXATION METHODS FOR PROBLEMS WITH STRICTLY CONVEX COSTS AND LINEAR CONSTRAINTS.
- Published in:
- Mathematics of Operations Research, 1997, v. 22, n. 2, p. 326, doi. 10.1287/moor.22.2.326
- By:
- Publication type:
- Article
SEMISMOOTH KARUSH-KUHN-TUCKER EQUATIONS AND CONVERGENCE ANALYSIS OF NEWTON AND QUASI-NEWTON METHODS FOR SOLVING THESE EQUATIONS.
- Published in:
- Mathematics of Operations Research, 1997, v. 22, n. 2, p. 301, doi. 10.1287/moor.22.2.301
- By:
- Publication type:
- Article
SIMPSON POINTS IN PLANAR PROBLEMS WITH LOCATIONAL CONSTRAINTS. THE POLYHEDRAL-GAUGE CASE.
- Published in:
- Mathematics of Operations Research, 1997, v. 22, n. 2, p. 291, doi. 10.1287/moor.22.2.291
- By:
- Publication type:
- Article
SIMPSON POINTS IN PLANAR PROBLEMS WITH LOCATIONAL CONSTRAINTS. THE ROUND-NORM CASE.
- Published in:
- Mathematics of Operations Research, 1997, v. 22, n. 2, p. 276, doi. 10.1287/moor.22.2.276
- By:
- Publication type:
- Article
CLASSIFICATION OF ACCEPTANCE CRITERIA FOR THE SIMULATED ANNEALING ALGORITHM.
- Published in:
- Mathematics of Operations Research, 1997, v. 22, n. 2, p. 266, doi. 10.1287/moor.22.2.266
- By:
- Publication type:
- Article
SEPARATING CLIQUE TREES AND BIPARTITION INEQUALITIES HAVING A FIXED NUMBER OF HANDLES AND TEETH IN POLYNOMIAL TIME.
- Published in:
- Mathematics of Operations Research, 1997, v. 22, n. 2, p. 257, doi. 10.1287/moor.22.2.257
- By:
- Publication type:
- Article