augmented downhill simplex method (adsm) is introduced here, that is a heuristic combination of downhill simplex method (dsm) with random search algorithm. in fact, dsm is an interpretable nonlinear local optimization method. however, it is a local exploitation algorithm; so, it can be trapped in a local minimum. in contrast, random search is a global exploration, but less efficient. here, rand...

The maximum flow problem (MFP) is a fundamental model in operations research. The network simplex algorithm is one of the most efficient solution methods for MFP in practice. The theoretical properties of established pivot algorithms for MFP is less understood. Variants of the primal simplex and dual simplex methods for MFP have been proven strongly polynomial, but no similar result exists for ...

The dual linear programs for the transhipment problem over a directed graph, G N, E }, are shown to have polyhedra with properties that make them well suited to vertex visiting solution techniques, like the simplex method. In particular, nondegenerate cases are shown to have feasible regions with considerably fewer extreme points than the feasible sets for primal problems. The adjacency structu...

Linear programming (LP) is the most widely used optimization technique for solving real-life problems because of its simplicity and efficiency. Although LP models require well-suited information and precise data, managers and decision makers dealing with optimization problems often have a lack of information on the exact values of some parameters used in their models. Fuzzy sets provide a power...

In this paper, we propose a method to obtain fuzzy solutions of duality fully fuzzy linear system (DFFLS) of the form ÃX̃ = B̃X̃ + C̃, where Ã, B̃ are fuzzy matrices and C̃, X̃ are fuzzy number vectors. To this end, we solve the 1-cut of DFFLS (which is a crisp system here) ,then some unknown spreads are allocated to any row of a 1-cut of dual fully fuzzy linear system in 1-cut position. Also, by usin...

In the field of 3D images, relevant information can be difficult to interpret without further computer-aided processing. Generally, and this is particularly true in medical imaging, a segmentation process is run and coupled with a visualization of the delineated structures to help understanding the underlying information. To achieve the extraction of the boundary structures, deformable models a...

We define the notion of infimum a set points with respect to second order cone. This problem can be showed equivalent minimum ball containing balls and maximum intersecting problem, as well others. present dual algorithm which viewed an extension simplex method solve this problem.

The objective of this paper is to analyze entropy based Vendor Selection Problem (VSP) model by using fuzzy mathematical programming and primal-dual geometric programming method. Here we have extended the unconstrained convex programming approach to solve VSP model with inequality constraints without adding artificial variables. By t-norm based fuzzy mathematical programming technique and the d...

This paper deals with ridge estimation of fuzzy nonparametric regression models using triangular fuzzy numbers. This estimation method is obtained by implementing ridge regression learning algorithm in the Lagrangian dual space. The distance measure for fuzzy numbers that suggested by Diamond is used and the local linear smoothing technique with the crossvalidation procedure for selecting the o...

According to fuzzy arithmetic, general dual fuzzy linear system (GDFLS) cannot be replaced by a fuzzy linear system (FLS). In this paper, we use new notation of fuzzy numbers and convert a GDFLS to two linear systems in crisp case, then we discuss complexity of the proposed method. Conditions for the existence of a unique fuzzy solution to n× n GDFLS are derived. AMS Subject Classification: 34K...