Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Journal: Mathematical Programming
Found
797 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
On the stability of solutions to quadratic programming problems
2001,
Yen N.D.
We consider the parametric programming problem ( Q p ) of minimizing the quadratic...
A modified Weiszfeld algorithm for the Fermat–Weber location problem
2001,
Vardi Y.
This paper gives a new, simple, monotonically convergent, algorithm for the...
The uncapacitated lot-sizing problem with sales and safety stocks
2001,
Wolsey L.A.
We examine a variant of the uncapacitated lot-sizing model of Wagner–Whitin...
Error bounds for 2-regular mappings with Lipschitzian derivatives and their applications
2001,
Solodov M.V.
We obtain local estimates of the distance to a set defined by equality constraints...
On the generic properties of convex optimization problems in conic form
2001,
Tunel L.
We prove that strict complementarity, primal and dual nondegeneracy of optimal...
On the convexity of the multiplicative potential and penalty functions and related topics
2001,
Marchal P.
It is well known that a function f of the real variable x is convex if and only if (...
A disjunctive cutting plane procedure for general mixed-integer linear programs
2001,
Mehrotra S.
In this paper we develop a cutting plane algorithm for solving mixed-integer linear...
On two homogeneous self-dual approaches to linear programming and its extensions
2001,
Todd M.J.
We investigate the relation between interior-point algorithms applied to two...
Parallel machine scheduling wth high multiplicity
2001,
Posner M.E.
In high-multiplicity scheduling problems, identical jobs are encoded in the efficient...
Global optimization of nonconvex factorable programming problems
2001,
Sherali H.D.
In this paper, we consider a special class of nonconvex programming problems for which...
Hesitant adaptive search: The distribution of the number of iterations to convergence
2001,
Wood G.R.
Hesitant adaptive search is a stochastic optimisation procedure which accommodates...
A stochastic programming model using an endogenously determined worst case risk measure for dynamic asset allocation
2001,
Ziemba W.T.
We present a new approach to asset allocation with transaction costs. A multiperiod...
Introduction to financial optimization: Mathematical Programming special issue
2001,
Mulvey John M.
Optimization models are effective for solving significant problems in finance,...
Portfolio optimization problem under concave transaction costs and minimal transaction unit constraints
2001,
Konno Hiroshi
We will propose a branch and bound algorithm for calculating a globally optimal...
Scenario tree generation for multiperiod financial optimization by optimal discretization
2001,
Pflug G.Ch.
Multiperiod financial optimization is usually based on a stochastic model for the...
Integrated simulation and optimization models for tracking international fixed income indices
2001,
Zenios S.A.
Portfolio managers in the international fixed income markets must address jointly the...
On the p-median polytope
2001,
Sassano A.
The p -Median problem defined on a complete directed graph with n nodes (&Krarr; n (V,...
On consistency of stochastic dominance and mean-semideviation models
2001,
Ogryczak Wodzimierz
We analyze relations between two methods frequently used for modeling the choice among...
On the truncated conjugate gradient method
2000,
Yuan Y.
In this paper, we consider the truncated conjugate gradient method for minimizing a...
Polynomial convergence of primal–dual algorithms for the second-order cone program based on the Monteiro–Zhang family of directions
2000,
Tsuchiya T.
In this paper we study primal–dual path-following algorithms for the...
Optimality conditions for nonconvex semidefinite programming
2000,
Forsgren A.
This paper concerns nonlinear semidefinite programming problems for which no convexity...
Notes on L-/m-convex functions and the separation theorems
2000,
Fujishige Satoru
The concepts of L-convex function and M-convex function have recently been introduced...
On the superlinear convergence of the variable metric proximal point algorithm using Broyden and BFGS matrix secant updating
2000,
Burke J.V.
In previous work, the authors provided a foundation for the theory of variable metric...
A penalized Fischer–Burmeister nonlinear complementarity problem function
2000,
Chen B.
We introduce a new NCP-function in order to reformulate the nonlinear complementarity...
First Page
9
10
11
12
13
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers