The deeation-innation convex optimization method is introduced. One result is a simple and practical approximation algorithm for the max cut problem based on the semideenite programming relaxation and analysis of Goemans and Williamson. Another consequence is a closed-form expression for the maximum-determinant completion of a positive deenite band matrix. Local and global convergence results a...

mathematical modeling of supply chain operations has proven to be one of the most complex tasks in the field of operations management and operations research. despite the abundance of several modeling proposals in the literature; for vast majority of them, no effective universal application is conceived. this issue renders the proposed mathematical models inapplicable due largely to the fact th...

Fuzzy Linear Programming models and methods has been one ofthe most and well studied topics inside the broad area of Soft Computing. Itsapplications as well as practical realizations can be found in all the real worldareas. In this paper a basic introduction to the main models and methods infuzzy mathematical programming, with special emphasis on those developedby the authors, is presented. As ...

In this paper, we review some fuzzy linear programming methods and techniques from a practical point of view. In the rst part, the general history and the approach of fuzzy mathematical programming are introduced. Using a numerical example, some models of fuzzy linear programming are described. In the second part of the paper, fuzzy mathematical programming approaches are compared to stochastic...

This article examines a new approach which solves Linear Programming (LP) problems with stochastic parameters as a generalized model of the fuzzy mathematical model analyzed by Verdegay. An expectation model is provided for solving the problem. A multi-parametric programming is applied to access to a solution with different desired degrees as well as problem constraints. Additionally, we presen...

The pupose of this paper is modeling of Partial Digest Problem (PDP) as a mathematical programming problem. In this paper we present a new viewpoint of PDP. We formulate the PDP as a continuous optimization problem and develope a method to solve this problem. Finally we constract a linear programming model for the problem with an additional constraint. This later model can be solved by the simp...

Nowadays, interval comparison matrices (ICM) take an important role in decision making under uncertainty. So it seems that a brief review on solution methods used in ICM should be useful. In this paper, the common methods are divided into four categories that are Goal Programming Method (GPM), Linear Programming Method (LPM), Non-Linear Programming Method (NLPM) and Statistic Analysis (SA). GPM...

The paper introduces a general methodological approach for the estimation of constrained optimisation models in agricultural supply analysis. It is based on optimality conditions of the desired programming model and shows a conceptual advantage compared to Positive Mathematical Programming in the context of well posed estimation problems. Moreover, it closes the empirical and methodological gap...