Volume 3, Number 1, January 2009
: Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems.
, S. Srisatkunarajah
: Lagrange multiplier necessary conditions for global optimality for non-convex minimization over a quadratic constraint via S-lemma.
: Characterizations of simultaneous farthest point in normed linear spaces with applications.
Volume 3, Number 2, March 2009
O. L. Mangasarian
: Knapsack feasibility as an absolute value equation solvable by successive linear programming.
S. K. Mishra
, J. S. Rautela
: On nonlinear multiple objective fractional programming involving semilocally type-I univex functions.
Katta G. Murty
: A problem in enumerating extreme points, and an efficient algorithm for one class of polytopes.
: A composite model in the context of a production-inventory system.
: New optimality conditions for quadratic optimization problems with binary constraints.
Volume 3, Number 3, July 2009
: On robust maximum flow with polyhedral uncertainty sets.
: New results on the equivalence between zero-one programming and continuous concave programming.
: On global minima of semistrictly quasiconcave functions.
, Sheng-Jie Li
: A new proof approach to lower semicontinuity for parametric vector equilibrium problems.
Luís N. Vicente
: Implicitly and densely discrete black-box optimization problems.
Volume 3, Number 4, September 2009
: Bounds for a constrained optimal stopping problem.
André R. S. Amaral
: A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem.
, Stefano Lucidi
: A nonmonotone truncated Newton-Krylov method exploiting negative curvature directions, for large scale unconstrained optimization.
, Guoyin Li
: Farkas' lemma for separable sublinear inequalities without qualifications.
, A. Baccari
: An application of matrix computations to classical second-order optimality conditions.
Igor V. Konnov
: A splitting type algorithm for multi-valued complementarity problems.
: A (4/3)-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints.
: On unique solvability of the absolute value equation.