A Dimensional Reduction Approach Based on Essential Constraints in Linear Programming

This paper presents a new dimension reduction strategy for medium and large-scale linear programming problems. The proposed method uses a subset of the original constraints and combines two algorithms: the weighted average and the cosine simplex algorithm. The first approach identifies binding constraints by using the weighted average of each constraint, whereas the second algorithm is based on the cosine similarity between the vector of the objective function and the constraints. These two approaches are complementary, and when used together, they locate the essential subset of initial constraints required for solving medium and large-scale linear programming problems. After reducing the dimension of the linear programming problem using the subset of the essential constraints, the solution method can be chosen from any suitable method for linear programming. The proposed approach was applied to a set of well-known benchmarks as well as more than 2000 random medium and large-scale linear programming problems. The results are promising, indicating that the new approach contributes to the reduction of both the size of the problems and the total number of iterations required. A tree-based classification model also confirmed the need for combining the two approaches. A detailed numerical example, the general numerical results, and the statistical analysis for the decision tree procedure are presented.

Solving Multi-Objective Linear Programming Problem by Statistical Averaging Method with the Help of Fuzzy Programming Method

A multi-objective linear programming problem is made from fuzzy linear programming problem. It is due the fact that it is used fuzzy programming method during the solution. The Multi objective linear programming problem can be converted into the single objective function by various methods as Chandra Sen’s method, weighted sum method, ranking function method, statistical averaging method. In this paper, Chandra Sen’s method and statistical averaging method both are used here for making single objective function from multi-objective function. Two multi-objective programming problems are solved to verify the result. One is numerical example and the other is real life example. Then the problems are solved by ordinary simplex method and fuzzy programming method. It can be seen that fuzzy programming method gives better optimal values than the ordinary simplex method.

Bi-Level Programming for the Optimal Nonlinear Distance-Based Transit Fare Structure Incorporating Principal-Agent Game

The urban transit fare structure and level can largely affect passengers’travel behavior and route choices.The commonly used transit fare policies in the present transit network would lead to the unbalanced transit assignment and improper transit resources distribution.In order to distribute transit passenger flow evenly and efficiently,this paper introduces a new distance-based fare pattern with Euclidean distance.A bi-level programming model is developed for determining the optimal distance-based fare pattern,with the path-based stochastic transit assignment(STA)problem with elastic demand being proposed at the lower level.The upper-level intends to address a principal-agent game between transport authorities and transit enterprises pursing maximization of social welfare and financial interest,respectively.A genetic algorithm(GA)is implemented to solve the bi-level model,which is verified by a numerical example to illustrate that the proposed nonlinear distance-based fare pattern presents a better financial performance and distribution effect than other fare structures.

Linear Programming建模研讨

研究用图解法、simplex method和匈牙利法建立Linear Programming的数学模型并求得了最优解.结果表明:对仅有两个变量的Linear Programming,既可通过图解法求得最优解;也可用单纯形表简便地求得最优解;而对任务和人数不等的assignment problem,则用匈牙利法求最优解.

Solution for integer linear bilevel programming problems using orthogonal genetic algorithm

An integer linear bilevel programming problem is firstly transformed into a binary linear bilevel programming problem, and then converted into a single-level binary implicit programming. An orthogonal genetic algorithm is developed for solving the binary linear implicit programming problem based on the orthogonal design. The orthogonal design with the factor analysis, an experimental design method is applied to the genetic algorithm to make the algorithm more robust, statistical y sound and quickly convergent. A crossover operator formed by the orthogonal array and the factor analysis is presented. First, this crossover operator can generate a smal but representative sample of points as offspring. After al of the better genes of these offspring are selected, a best combination among these offspring is then generated. The simulation results show the effectiveness of the proposed algorithm.

Primal-Dual Interior-Point Algorithms with Dynamic Step-Size Based on Kernel Functions for Linear Programming

In this paper, primal-dual interior-point algorithm with dynamic step size is implemented for linear programming （LP） problems. The algorithms are based on a few kernel functions, including both serf-regular functions and non-serf-regular ones. The dynamic step size is compared with fixed step size for the algorithms in inner iteration of Newton step. Numerical tests show that the algorithms with dynaraic step size are more efficient than those with fixed step size.

An Exact Virtual Network Embedding Algorithm Based on Integer Linear Programming for Virtual Network Request with Location Constraint

Network virtualization is known as a promising technology to tackle the ossification of current Internet and will play an important role in the future network area. Virtual network embedding(VNE) is a key issue in network virtualization. VNE is NP-hard and former VNE algorithms are mostly heuristic in the literature.VNE exact algorithms have been developed in recent years. However, the constraints of exact VNE are only node capacity and link bandwidth.Based on these, this paper presents an exact VNE algorithm, ILP-LC, which is based on Integer Linear Programming(ILP), for embedding virtual network request with location constraints. This novel algorithm is aiming at mapping virtual network request(VNR) successfully as many as possible and consuming less substrate resources.The topology of each VNR is randomly generated by Waxman model. Simulation results show that the proposed ILP-LC algorithm outperforms the typical heuristic algorithms in terms of the VNR acceptance ratio, at least 15%.

Global convergent algorithm for the bilevel linear fractional-linear programming based on modified convex simplex method

A global convergent algorithm is proposed to solve bilevel linear fractional-linear programming, which is a special class of bilevel programming. In our algorithm, replacing the lower level problem by its dual gap equaling to zero, the bilevel linear fractional-linear programming is transformed into a traditional sin- gle level programming problem, which can be transformed into a series of linear fractional programming problem. Thus, the modi- fied convex simplex method is used to solve the infinite linear fractional programming to obtain the global convergent solution of the original bilevel linear fractional-linear programming. Finally, an example demonstrates the feasibility of the proposed algorithm.

Linear goal programming approach to obtaining the weights of intuitionistic fuzzy ordered weighted averaging operator

The multiple attribute decision making problems are studied, in which the information about attribute weights is partly known and the attribute values take the form of intuitionistic fuzzy numbers. The operational laws of intuitionistic fuzzy numbers are introduced, and the score function and accuracy function are presented to compare the intuitionistic fuzzy numbers. The intuitionistic fuzzy ordered weighted averaging （IFOWA） operator which is an extension of the well-known ordered weighted averaging （OWA） operator is investigated to aggregate the intuitionistic fuzzy information. In order to determine the weights of intuitionistic fuzzy ordered weighted averaging operator, a linear goal programming procedure is proposed for learning the weights from data. Finally, an example is illustrated to verify the effectiveness and practicability of the developed method.

Solving Intuitionistic Fuzzy Linear Programming Problem

Intuitionistic Fuzzy Set (IFS) can be used as a general tool for modeling problems of decision making under uncertainty where, the degree of rejection is defined simultaneously with the degree of acceptance of a piece of information in such a way that these degrees are not complement to each other. Accordingly, an attempt is made to solve intuitionistic fuzzy linear programming problems using a technique based on an earlier technique proposed by Zimmermann to solve fuzzy linear programming problem. Our proposed technique does not require the existing ranking of intuitionistic fuzzy numbers. This method is also different from the existing weight assignment method or the Angelov’s method. A comparative study is undertaken and interesting results have been presented.

A New Method for Achieving an Initial Regular Solution of a Linear Programming

A method is provided for finding an initial regular solution of a linear programming in this paper. The key to this method is to solve an auxiliary linear programming instead of to introduce any artificial variable or constraint. Compared with the traditional method of achieving the regular solution by introducing an artificial constraint, it has advantages of saving the memories and little computational efforts.

A RECOGNITION PROBLEM IN CONVERTING LINEAR PROGRAMMING TO NETWORK FLOW MODELS

The main goal of this paper is to study the following combinatorial problem : given a finite set E = (e1, e2, ...,em} and a subset family a - [S1,S2, ... ,Sk} of E , does there exist a tree T with the edge set E such that each induced subgraph T[Si] of Si is precisely a path (1≤i≤k) ?

Support Vector Machines for Regression: A Succinct Review of Large-Scale and Linear Programming Formulations

Support Vector-based learning methods are an important part of Computational Intelligence techniques. Recent efforts have been dealing with the problem of learning from very large datasets. This paper reviews the most commonly used formulations of support vector machines for regression (SVRs) aiming to emphasize its usability on large-scale applications. We review the general concept of support vector machines (SVMs), address the state-of-the-art on training methods SVMs, and explain the fundamental principle of SVRs. The most common learning methods for SVRs are introduced and linear programming-based SVR formulations are explained emphasizing its suitability for large-scale learning. Finally, this paper also discusses some open problems and current trends.

Weak optimal inverse problems of interval linear programming based on KKT conditions

In this paper,weak optimal inverse problems of interval linear programming(IvLP)are studied based on KKT conditions.Firstly,the problem is precisely defined.Specifically,by adjusting the minimum change of the current cost coefficient,a given weak solution can become optimal.Then,an equivalent characterization of weak optimal inverse IvLP problems is obtained.Finally,the problem is simplified without adjusting the cost coefficient of null variable.

Solving Intuitionistic Fuzzy Linear Programming Problem—II

Under non-random uncertainty, a new idea of finding a possibly optimal solution for linear programming problem is examined in this paper. It is an application of the intuitionistic fuzzy set concept within scope of the existing fuzzy optimization. Here, we solve a linear programming problem (LPP) in an intuitionistic fuzzy environment and compare the result with the solution obtained from other existing techniques. In the process, the result of associated fuzzy LPP is also considered for a better understanding.

Efficient Algorithm for K-Barrier Coverage Based on Integer Linear Programming

Barrier coverage of wireless sensor networks is an important issue in the detection of intruders who are attempting to cross a region of interest.However,in certain applications,barrier coverage cannot be satisfied after random deployment.In this paper,we study how mobile sensors can be efficiently relocated to achieve k-barrier coverage.In particular,two problems are studied:relocation of sensors with minimum number of mobile sensors and formation of k-barrier coverage with minimum energy cost.These two problems were formulated as 0–1 integer linear programming(ILP).The formulation is computationally intractable because of integrality and complicated constraints.Therefore,we relax the integrality and complicated constraints of the formulation and construct a special model known as RELAX-RSMN with a totally unimodular constraint coefficient matrix to solve the relaxed 0–1 ILP rapidly through linear programming.Theoretical analysis and simulation were performed to verify the effectiveness of our approach.

Short-Term Scheduling of Combined Cycle Units Using Mixed Integer Linear Programming Solution

Combined cycle plants (CCs) are broadly used all over the world. The inclusion of CCs into the optimal resource scheduling causes difficulties because they can be operated in different operating configuration modes based on the number of combustion and steam turbines. In this paper a model CCs based on a mixed integer linear programming approach to be included into an optimal short term resource optimization problem is presented. The proposed method allows modeling of CCs in different modes of operation taking into account the non convex operating costs for the different combined cycle mode of operation.

Linear Programming for Optimum PID Controller Tuning

This work presents a new methodology based on Linear Programming (LP) to tune Proportional-Integral-Derivative (PID) control parameters. From a specification of a desired output time domain of the plant, a linear optimization system is proposed to adjust the PID controller leading the output signal to stable operation condition with minimum oscillations. The constraint set used in the optimization process is defined by using numerical integration approach. The generated optimization problem is convex and easily solved using an interior point algorithm. Results obtained using familiar plants from literature have shown that the proposed linear programming problem is very effective for tuning PID controllers.

A Primal-Dual Simplex Algorithm for Solving Linear Programming Problems with Symmetric Trapezoidal Fuzzy Numbers

Two existing methods for solving a class of fuzzy linear programming (FLP) problems involving symmetric trapezoidal fuzzy numbers without converting them to crisp linear programming problems are the fuzzy primal simplex method proposed by Ganesan and Veeramani [1] and the fuzzy dual simplex method proposed by Ebrahimnejad and Nasseri [2]. The former method is not applicable when a primal basic feasible solution is not easily at hand and the later method needs to an initial dual basic feasible solution. In this paper, we develop a novel approach namely the primal-dual simplex algorithm to overcome mentioned shortcomings. A numerical example is given to illustrate the proposed approach.

Evaluating the Performance of Iranian Football Teams Utilizing Linear Programming

In this paper, we utilize Data Envelopment Analysis (DEA), which is a linear programming-based technique, for evaluating the performance of the teams which operate in the Iranian primer football league. We use Analytical Hierarchy Process (AHP) technique for aggregating the sub-factors which involve in input-output factors, and then DEA is used for calculating the efficiency measures. Also, AHP is used to construct some weight restrictions for increasing the discrimination power of the used DEA model. For calculating the efficiency measures, input-oriented weight-restricted BCC model is utilized.