O Eatonově-Zadehově metodě
O jednom důkazu principu duality v lineárním programování
Object library of algorithms for dynamic optimization problems: benchmarking SQP and nonlinear interior point methods
The main purpose of this paper is to describe the design, implementation and possibilities of our object-oriented library of algorithms for dynamic optimization problems. We briefly present library classes for the formulation and manipulation of dynamic optimization problems, and give a general survey of solver classes for unconstrained and constrained optimization. We also demonstrate methods of derivative evaluation that we used, in particular automatic differentiation. Further, we briefly formulate...
Objective function design for robust optimality of linear control under state-constraints and uncertainty
We consider a model for the control of a linear network flow system with unknown but bounded demand and polytopic bounds on controlled flows. We are interested in the problem of finding a suitable objective function that makes robust optimal the policy represented by the so-called linear saturated feedback control. We regard the problem as a suitable differential game with switching cost and study it in the framework of the viscosity solutions theory for Bellman and Isaacs equations.
Objective function design for robust optimality of linear control under state-constraints and uncertainty
We consider a model for the control of a linear network flow system with unknown but bounded demand and polytopic bounds on controlled flows. We are interested in the problem of finding a suitable objective function that makes robust optimal the policy represented by the so-called linear saturated feedback control. We regard the problem as a suitable differential game with switching cost and study it in the framework of the viscosity solutions theory for Bellman and Isaacs equations.
Odd cycles and a class of facets of the axial 3-index assignment polytope
On a bicriteria optimal production plan
On a category of linear mathematical programming problems with interval coefficients.
On a Class of Nonconvex Problems Where all Local Minima are Global
On a class of polynomially solvable travelling salesman problems
On a Construction of Digital Convex -gons of Minimum Diameter
On a convolution operation obtained by adding level sets : classical and new results
On a dual network exterior point simplex type algorithm and its computational behavior
The minimum cost network flow problem, (MCNFP) constitutes a wide category of network flow problems. Recently a new dual network exterior point simplex algorithm (DNEPSA) for the MCNFP has been developed. This algorithm belongs to a special “exterior point simplex type” category. Similar to the classical dual network simplex algorithm (DNSA), this algorithm starts with a dual feasible tree-solution and after a number of iterations, it produces a solution that is both primal and dual feasible, i.e....
On a dual network exterior point simplex type algorithm and its computational behavior∗
The minimum cost network flow problem, (MCNFP) constitutes a wide category of network flow problems. Recently a new dual network exterior point simplex algorithm (DNEPSA) for the MCNFP has been developed. This algorithm belongs to a special “exterior point simplex type” category. Similar to the classical dual network simplex algorithm (DNSA), this algorithm starts with a dual feasible tree-solution and after a number of iterations, it produces a...
On a facet of the balanced subgraph polytope
On a functional equation
On a functional equation of Bellman in the theory of dynamic programming.
On a general convergence for Broyden like update method.
On a general dynamic programming problem
On a hybrid experimental design