On a machine sequencing problem (I)
On a mean reward from a common Markov replacement process
On a method of optimization
On a modification of Rényi's traffic model
On a multi-objective optimization problem arising from production theory
The paper presents a natural application of multi-objective programming to household production and consumption theory. A contribution to multi-objective programming theory is also included.
On a nonlocal metric regularity of nonlinear operators
On a numerical method to approximate the solutions to bicriteria problems using a spline function
On a Numerical Treatment for the Curve-Tracing of the Homotopy Method.
On a Second-Order Step-Size Algorithm
On a Stopping Rule for a Class of Sequential Decision Problems.
On a variational approach to optimization of hybrid mechanical systems.
On adaptive control of Markov processes
On an iterative method for unconstrained optimization
We present a local and a semi-local convergence analysis of an iterative method for approximating zeros of derivatives for solving univariate and unconstrained optimization problems. In the local case, the radius of convergence is obtained, whereas in the semi-local case, sufficient convergence criteria are presented. Numerical examples are also provided.
On approximation in multistage stochastic programs: Markov dependence
A general multistage stochastic programming problem can be introduced as a finite system of parametric (one-stage) optimization problems with an inner type of dependence. Evidently, this type of the problems is rather complicated and, consequently, it can be mostly solved only approximately. The aim of the paper is to suggest some approximation solution schemes. To this end a restriction to the Markov type of dependence is supposed.
On approximation of multifunctions with respect to the Vietoris topology
On Bilevel Variational Inequalities Arising in the Analysis of Improper Optimization Problems
On blockers in bounded posets.
On certain classes of variational inequalities and related iterative algorithms.
On co-bicliques
A co-biclique of a simple undirected graph G = (V,E) is the edge-set of two disjoint complete subgraphs of G. (A co-biclique is the complement of a biclique.) A subset F ⊆ E is an independent of G if there is a co-biclique B such that F ⊆ B, otherwise F is a dependent of G. This paper describes the minimal dependents of G. (A minimal dependent is a dependent C such that any proper subset of C is an independent.) It is showed that a minimum-cost dependent set of G can be determined in polynomial...
On computation of C-stationary points for equilibrium problems with linear complementarity constraints via homotopy method
In the paper we consider EPCCs with convex quadratic objective functions and one set of complementarity constraints. For this class of problems we propose a possible generalization of the homotopy method for finding stationary points of MPCCs. We analyze the difficulties which arise from this generalization. Numerical results illustrate the performance for randomly generated test problems.