Abstract 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 minimum change current cost coefficient, a given solution can become optimal. Then, an equivalent characterization IvLP obtained. Finally, simplified without coefficient null variable.

Abstract In the real world, we often encounter cases where the information / data items can’t be determined with certainty. Hence the value of the datum in the data is assessed using an interval. Meanwhile multiobjective linear programming model is more adequate to describe the problem in the real world. Thus, the multiobjective linear programming problem will be developed into a multiobjective...

Existing interval constraint logic programming languages, such as BNR Prolog, work under the framework of interval narrowing and are deficient in solving systems of linear constraints over real numbers, which constitute an important class of problems in engineering and other applications. In this paper, we suggest to separate linear equality constraint solving from inequality and non-linear con...

  Among various statistical and data mining discriminant analysis proposed so far for group classification, linear programming discriminant analysis has recently attracted the researchers’ interest. This study evaluates multi-group discriminant linear programming (MDLP) for classification problems against well-known methods such as neural networks and support vector machine. MDLP is less compli...