Journal: Optimization

Found 266 papers in total
Monotone stopping rules for stochastic processes in a semimartingale representation with applications
Monotone stopping rules for stochastic processes in a semimartingale representation with applications
1989,
A monotone stopping problem is considered for stochastic processes in a semimartingale...
On local controllability of nondifferentiable discrete-time system with nonconvex constraints on controls
On local controllability of nondifferentiable discrete-time system with nonconvex constraints on controls
1989,
In this paper a sufficient condition for local controllability of discrete-time...
Silent mixed duels
Silent mixed duels
1989,
The paper considers a class of a zero-sum two-person games of timing on [0,1], in...
A necessary and sufficient condition for the total unimodularity of a matrix in terms of graph theory
A necessary and sufficient condition for the total unimodularity of a matrix in terms of graph theory
1989,
The authors present a necessary and sufficient condition for an arbitrary matrix A to...
Linear programming in vector criterion Markov and semi-Markov decision processes
Linear programming in vector criterion Markov and semi-Markov decision processes
1989,
Optimality problems in infinite horizon, discrete time, vector criterion Markov and...
Forecast horizon in nonstationary Markov decision problems
Forecast horizon in nonstationary Markov decision problems
1989,
The paper extends the concept of decision and forecast horizons from classes of...
Polyak’s subgradient method with simplified projection for nondifferentiable optimization with linear constraints
Polyak’s subgradient method with simplified projection for nondifferentiable optimization with linear constraints
1989,
The projection operation required in the Polyak’s subgradient method for...
The circumpolygon with maximal area
The circumpolygon with maximal area
1989,
The convex circumpolygon with maximal area to a given convex polygon can be determined...
Differentiability of the constraint functions in probabilistic constrained programs
Differentiability of the constraint functions in probabilistic constrained programs
1989,
This paper is devoted to study of differentiability of the constraint functions in...
Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions
Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions
1989,
Necessary conditions and sufficient conditions of optimality and several duality...
On Martos’ and Charnes-Cooper’s approach vis-a-vis ‘singular points’
On Martos’ and Charnes-Cooper’s approach vis-a-vis ‘singular points’
1989,
In this paper a linear fractional programming problem is studied in presence of...
Efficiency in linear fractional vector maximization problem with nonlinear constraint
Efficiency in linear fractional vector maximization problem with nonlinear constraint
1989,
A vector maximum problem (VMP) with linear fractional objectives and nonlinear...
Duality in geometric vector optimization
Duality in geometric vector optimization
1989,
The purpose of the present paper is to handle a special class of vector optimization...
Semi-Markov decision processes with a reachable state-subset
Semi-Markov decision processes with a reachable state-subset
1989,
The paper considers the problem of minimizing the long-run average expected cost per...
Support prices of activities in linear programming
Support prices of activities in linear programming
1989,
Consider the primal linear program (P) max{ c T x • Ax = b , x ≥0} with...
On characterizing linear complementarity problems
On characterizing linear complementarity problems
1989,
Using a new bilinear programming formulation of the linear complementarity problem,...
The capacity problem
The capacity problem
1989,
The authors consider a type of infinite-dimensional linear program posed over a...
Techniques of linear programming based on the theory of convex cones
Techniques of linear programming based on the theory of convex cones
1989,
The convex cones approach to linear programming is illustrated. Two methods are...
Solving multiobjective programming problems by discrete representation
Solving multiobjective programming problems by discrete representation
1989,
In the paper two theorems are given concerning the relationship between the conflict...
Between Pareto efficiency and Pareto ℝà-efficiency
Between Pareto efficiency and Pareto ℝà-efficiency
1989,
By using an efficiency notion placed between Pareto efficiency and Pareto •-...
Some results on regularity in vector optimization
Some results on regularity in vector optimization
1989,
This paper suggests an approach to regularity in vector optimization which extends a...
Convexity of the optimal multifunctions and its consequences in vector optimization
Convexity of the optimal multifunctions and its consequences in vector optimization
1989,
Studies on cone-convexity of optimal multifunctions in vector optimization are given....
Approximating families of cones and proper efficiency in vector optimization
Approximating families of cones and proper efficiency in vector optimization
1989,
The paper proves that a closed cone C in a normed space Y admits an approximating...
The quasidifferential of an optimal value function in nonsmooth programming
The quasidifferential of an optimal value function in nonsmooth programming
1989,
Quasidifferential representations for the optimal value function associated with a...
Papers per page: