Several authors have proposed different methods to find the solution of fully fuzzy linear programming (FFLP) problems. But all the existing methods are based on the assumption that all the fuzzy coefficients and the fuzzy variables are non-negative fuzzy numbers. in this paper a new method is proposed to solve an FFLP problems with arbitrary fuzzy coefficients and arbitrary fuzzy variables, th...

In this paper, a linear optimization problem is investigated whose constraints are defined with fuzzy relational inequality. These constraints are formed as the intersection of two inequality fuzzy systems and Schweizer-Sklar family of t-norms. Schweizer-Sklar family of t-norms is a parametric family of continuous t-norms, which covers the whole spectrum of t-norms when the parameter is changed...

1 Basics 2 Linear Equations 3 Linear Maps 4 Rank One Matrices 5 Algebra of Matrices 6 Eigenvalues and Eigenvectors 7 Inner Products and Quadratic Forms 8 Norms and Metrics 9 Projections and Reflections 10 Similar Matrices 11 Symmetric and Self-adjoint Maps 12 Orthogonal and Unitary Maps 13 Normal Matrices 14 Symplectic Maps 15 Differential Equations 16 Least Squares 17 Markov Chains 18 The Expo...

We study linear complementarity problems depending on parameters in the right-hand side and (or) in the matrix. For the case that all elements of the right-hand side are independent parameters we give a new proof for the equivalence of three diierent important local properties of the corresponding solution set map in a neighbourhood of an element of its graph. For one-and multiparametric proble...

In this paper, we first present a brief review about the feasible interior-point algorithm for P∗(κ)-horizontal linear complementarity problems (HLCPs) based on new directions. Then we present a new infeasible interior-point algorithm for these problems. The algorithm uses two types of full-Newton steps which are called feasibility steps and centering steps. The algorithm starts from strictly f...

We establish the polynomial-time solvability of a class of vector partition problems with linear objectives subject to restrictions on the number of elements in each part. c © 2000 Published by Elsevier Science B.V. All rights reserved. 1. Shaped partition problems The shaped partition problem concerns the partitioning of n vectors A; : : : ; A in d-space into p parts so as to maximize an objec...