Foreword
pdf |
5
|
E. Balas, Recognizing facet defining inequalities
pdf |
7
|
H. P. Benson, Generating the efficient outcome
set in multiple objective linear programs: The bicriteria case
pdf |
29
|
J. Borwein, M. Fabian and J. Vanderwerff, Characterizations
of Banach spaces via convex and other locally Lipschitz functions
pdf |
53
|
K.-H. Elster and R. Elster, Optimization of
c-orthogonal posynomials
pdf |
71 |
W. Forster, Homotopies for systems of polynomial
equations
pdf |
107 |
V. Gabrel and M. Minoux, LP relaxations better
than convexification for multicommodity network optimization problems with
step increasing cost functions
pdf |
123 |
M. Kojima, M. Shida and S. Shindoh, Reduction
of monotone linear complementarity problems over cones to linear programs
over cones
pdf |
147 |
T. Kuno, A pseudo-polynomial algorithm for
solving rank three concave production - transportation problems
pdf |
159 |
H. van Maaren, Pivoting algorithms based
on Boolean vector labeling
pdf |
183 |
O. L. Mangasarian, Solution of general linear
complementarity problems via nondiffe- rentiable concave minimization
pdf |
199 |
J.-E. Martinez-Legaz, Lexicographical characterization
of the faces of convex sets
pdf |
207 |
W. Oettli, A remark on vector-valued equilibria
and generalized monotonicity
pdf |
213 |
D. Pallaschke and R. Urb¸nski, Quasidifferentiable
functions and pairs of compact convex sets
pdf |
223 |
H. D. Sherali, Convex envelopes of multilinear
functions over a unit hypercube and over special discrete sets
pdf |
245 |
J. Shi and Y. Yamamoto, A global
optimization method for minimum maximal flow problem
pdf |
271 |
P. D. Tao and L. T. Hoai An, Convex analysis approach to D.
C. programming theory, algorithm and applications
pdf |
289 |
T. V. Thieu and T. X. Sinh, A new bounding
technique in branch-and bound algorithms for mixed integer programming
pdf |
357 |
N. V. Tien and L. D. Muu, A relaxation algorithm
for solving mixed integer programming problems
pdf |
367 |