1. Knapsack feasibility as an absolute value equation solvable by successive linear programming

   • O. L. Mangasarian

   Original Paper 21 October 2008 Pages: 161 - 170

2. On nonlinear multiple objective fractional programming involving semilocally type-I univex functions

   • S. K. Mishra
   • J. S. Rautela

   Original Paper 10 September 2008 Pages: 171 - 185

3. New stopping criteria for detecting infeasibility in conic optimization

   • Imre Pólik
   • Tamás Terlaky

   Original Paper 12 September 2008 Pages: 187 - 198

4. Due date assignment for multistage assembly systems

   • Amir Azaron
   • Farhad Kianfar

   Original Paper 28 September 2008 Pages: 199 - 210

5. A problem in enumerating extreme points, and an efficient algorithm for one class of polytopes

   • Katta G. Murty

   Original Paper 04 November 2008 Pages: 211 - 237

6. A composite model in the context of a production-inventory system

   • Sanjay Sharma

   Original Paper 21 October 2008 Pages: 239 - 251

7. New optimality conditions for quadratic optimization problems with binary constraints

   • Yong Xia

   Original Paper 21 October 2008 Pages: 253 - 263

8. Sufficiency of linear transformations on Euclidean Jordan algebras

   • Linxia Qin
   • Lingchen Kong
   • Jiye Han

   Original Paper 24 October 2008 Pages: 265 - 276

9. Second order duality for minmax fractional programming

   • Z. Husain
   • I. Ahmad
   • Sarita Sharma

   Original Paper 31 October 2008 Pages: 277 - 286

10. A generalization of the Motzkin–Straus theorem to hypergraphs

    • Samuel Rota Bulò
    • Marcello Pelillo

    Original Paper 05 November 2008 Pages: 287 - 295

11. On the upper bounds of the minimum number of rows of disjunct matrices

    • Yongxi Cheng
    • Ding-Zhu Du
    • Guohui Lin

    Original Paper 22 November 2008 Pages: 297 - 302

12. A univariate global search working with a set of Lipschitz constants for the first derivative

    • Dmitri E. Kvasov
    • Yaroslav D. Sergeyev

    Original Paper 22 November 2008 Pages: 303 - 318