Keyword: programming: convex

Found 402 papers in total
A model for conjunctive use of ground and surface water with opportunity costs
A model for conjunctive use of ground and surface water with opportunity costs
2002,
In this study, we develop a multi-stage decision model for the conjunctive use of...
Mean utility in the assurance region model
Mean utility in the assurance region model
2002,
This paper addresses the problem of ranking a finite set of alternatives through a...
Identifying non-active restrictions in convex quadratic programming
Identifying non-active restrictions in convex quadratic programming
2001,
Convex quadratic programming (QP) is of reviving interest in the last few years, since...
Convexification, concavification and monotonization in global optimization
Convexification, concavification and monotonization in global optimization
2001,
We show in this paper that via certain convexification, concavification and...
A minimax resource allocation problem with variable resources
A minimax resource allocation problem with variable resources
2002,
The problem of optimally allocating the resources to competing activities where the...
The plant location and flexible technology acquisition problem
The plant location and flexible technology acquisition problem
2002,
In many industries, production–distribution networks have become more complex...
On measuring the inefficiency with the inner-product norm in data envelopment analysis
On measuring the inefficiency with the inner-product norm in data envelopment analysis
2001,
A technique for assessing the sensitivity of efficiency classifications in Data...
Optimal ambushing search for a moving target
Optimal ambushing search for a moving target
2001,
This paper investigates a search problem for a moving target in which a searcher can...
Solving large scale mean-variance models with dense non-factorable covariance matrices
Solving large scale mean-variance models with dense non-factorable covariance matrices
2001,
This paper is concerned with an efficient algorithm for solving a large-scale dense...
The exponential barrier programming, as an analytical approximation of the linear programming
The exponential barrier programming, as an analytical approximation of the linear programming
1999,
We presented a special convex programming problem as an analytical approximation of...
Approximation of linear programs by Bregman's DF projections
Approximation of linear programs by Bregman's DF projections
2000,
The motivation of this paper is twofold: to contribute to the theory of Bregman's D F...
A simple duality proof in convex quadratic programming with a quadratic constraint, and some applications
A simple duality proof in convex quadratic programming with a quadratic constraint, and some applications
2000,
In this paper a simple derivation of duality is presented for convex quadratic...
A minimum mean cycle cancelling method for nonlinear multicommodity flow problems
A minimum mean cycle cancelling method for nonlinear multicommodity flow problems
2000,
We propose a new method based on minimum mean cycle cancelling for multicommodity flow...
Iterative methods for approximation of fixed points and their applications
Iterative methods for approximation of fixed points and their applications
2000,
In this article, we deal with iterative methods for approximation of fixed points and...
A survey of algorithms for convex multicommodity flow problems
A survey of algorithms for convex multicommodity flow problems
2000,
Routing problems appear frequently when dealing with the operation of communication or...
Multicriteria optimal control
Multicriteria optimal control
1999,
An optimal control problem is studied, with several objective functions, which...
The core of games on convex geometries
The core of games on convex geometries
1999,
A game on a convex geometry is a real-valued function defined on the family ℒ of...
A class of Broyden algorithms with revised search directions
A class of Broyden algorithms with revised search directions
1997,
In this paper we discuss the convergence of the Broyden algorithms with revised search...
A subdivisional scheme for linear programs with an additional reverse convex constraint
A subdivisional scheme for linear programs with an additional reverse convex constraint
1998,
In this paper, global optimization of linear programs with an additional reverse...
DC programming: Overview (difference of convex function)
DC programming: Overview (difference of convex function)
1999,
Mathematical programming problems dealing with functions, each of which can be...
Optimal search for a moving target with no time information maximizing the expected reward
Optimal search for a moving target with no time information maximizing the expected reward
1999,
This paper investigates a search problem for a moving target on a network in which any...
Separable partitions
Separable partitions
1999,
An ordered partition of a set of n points in the d -dimensional Euclidean space is...
Fenchel-type duality for matroid valuations
Fenchel-type duality for matroid valuations
1998,
The weighted matroid intersection problem has recently been extended to the valuated...
Optimality and duality of semi-infinite programming
Optimality and duality of semi-infinite programming
1998,
Semi-infinite programming – optimization in finite-dimensional spaces with...
Papers per page: