As the 750kV substation has the characteristics like timing inconsistency, dual protection configuration and uncertain diagnosis result, a fault diagnosis method of substation with redundant protection configuration based on time sequence fuzzy Petri nets is proposed. In this method, redundant knowledge about fault component is represented by using two sets of protective information. On that ba...

We define quasiconvex programming, a form of generalized linear programming in which one seeks the point minimizing the pointwise maximum of a collection of quasiconvex functions. We survey algorithms for solving quasiconvex programs either numerically or via generalizations of the dual simplex method from linear programming, and describe varied applications of this geometric optimization techn...

This work was supported by the National Science Foundation under grant ECS-9904378. Abstract: In this paper we show the applicability of the Dual Heuristic Programming (DHP) method of Approximate Dynamic Programming to parameter tuning of a fuzzy control system. DHP and related techniques have been developed in the neurocontrol context but can be equally productive when used with fuzzy controll...

Finding a pivot rule for the simplex method that is strongly polynomial is an open question. In fact, the shortest length of simplex pivots from any feasible basis to some optimal basis is not known to be polynomially bounded. An admissible pivot is a common generalization of simplex and dual simplex pivots, and there are various admissible pivot methods that are nite, including the least-index...

Manual tracing of the blood pool from short axis cine MR images is routinely used to compute ejection fraction (EF) in clinical practice. The manual segmentation process is cumbersome, time consuming, and operator dependent. In this paper, we present an algorithm for the automatic computation of the EF that is based on segmenting the left ventricle by combining the fuzzy connectedness and defor...

Recently, a new Dual Network Exterior-Point Simplex Algorithm (DNEPSA) for the Minimum Cost Network Flow Problem (MCNFP) has been developed. In extensive computational studies, DNEPSA performed better than the classical Dual Network Simplex Algorithm (DNSA). In this paper, we present for the first time how to utilize the dynamic trees data structure in the DNEPSA algorithm, in order to achieve ...

Many combinatorial optimization problems have relaxations that are semidefinite programming problems. In principle, the combinatorial optimization problem can then be solved by using a branch-and-cut procedure, where the problems to be solved at the nodes of the tree are semidefinite programs. It is desirable that the solution to one node of the tree should be exploited at the child node in ord...

We consider the minimum cost network flow problem min(cx : Ax=b , x > 0) on a graph G = (V,E). First we give a minor modification of Edmonds-Karp scaling technique, and we show that it solves the minimum cost flow problem in 0((|V|'^ log 1v|)(|e| + |V| log |v|)) steps. We also provide two dual simplex algorithms that solve the minimum cost flow problem in 0(|v| log |v|) pivots and 0(|v| log |v|...

The aim of present paper is to study a constrained programming with generalized $alpha-$univex fuzzy mappings. In this paper we introduce the concepts of $alpha-$univex, $alpha-$preunivex, pseudo $alpha-$univex and $alpha-$unicave fuzzy mappings, and we discover that $alpha-$univex fuzzy mappings are more general than univex fuzzy mappings. Then, we discuss the relationships of generalized $alp...