Fuzzy Linear Programming models are quite frequent in practice. The dynamic nature of the real problems often requires reoptimize from the optimal solutions found, what may mean a significant consumption of time and funds. In this paper, in order to efficiently solve this problem, first the optimality conditions and the duality results for fully fuzzy linear programming problems (all parameters...

Integer Linear Programming (ILP) formulations of Markov random fields (MRFs) models with global connectivity priors were investigated previously in computer vision, e.g., [16, 17]. In these works, only Linear Programing (LP) relaxations [16, 17] or simplified versions [21] of the problem were solved. This paper investigates the ILP of multi-label MRF with exact connectivity priors via a branch-...

We de®ne the base polytope B…P ; g† of a partially ordered set P and a supermodular function g on the ideals of P as the convex hull of the incidence vectors of all linear extensions of P . This new class of polytopes contains, among others, the base polytopes of supermodular systems and permutahedra as special cases. After introducing the notion of compatibility for g, we give a complete linea...

We describe a cutting plane algorithm for solving linear ordering problems. The algorithm uses a primal-dual interior point method to solve the rst few relaxations and then switches to a simplex method to solve the last few relaxations. The simplex method uses CPLEX 4.0. We compare the algorithm with one that uses only an interior point method and with one that uses only a simplex method. We so...

We consider the separated continuous linear programming problem with linear data. We characterize the form of its optimal solution, and present an algorithm which solves it in a finite number of steps, using an analog of the simplex method, in the space of bounded measurable functions.

This paper shows the relationship between degeneracy degrees and multiplicities in linear programming models. The usual definition of degeneracy is restricted to vertices of a polyhedron. We introduce degeneracy for nonempty subsets of polyhedra and show that for linear programming models for which the feasible region contains at least one vertex holds that the dimension of the optimal face is ...

Farm tractor skidding is one of the common methods of timber extraction in Turkey. However, the absence of an optimal skidding plan covering the entire production area can result in time loss and negative environmental impacts. In this study, the timber extraction by farm tractors was analyzed, and a new skid trail pattern design was developed using Linear Programming (LP) and Geographical Info...

This paper deals with the roundingerror analysis of the simplex method for solving linear-programming problems. We prove that in general any simplex-type algorithm is not well behaved, which means that the computed solution cannot be considered as an exact solution to a slightly perturbed problem. We also point out that simplex algorithms with well-behaved updating techniques (such as the Barte...

The paper presents an approach for avoiding and minimizing the complementary pivots in a simplex based solution method for a quadratic programming problem. The linearization of the problem is slightly changed so that the simplex or interior point methods can solve with full speed. This is a big advantage as a complementary pivot algorithm will take roughly eight times as longer time to solve a ...

In case of a special problem class, the simplex method can be implemented as a cutting-plane method that approximates a polyhedral convex objective function. In this paper we consider a regularized version of this cutting-plane method, and interpret the resulting procedure as a regularized simplex method. (Regularization is performed in the dual space and only affects the process through the pr...