Bilevel linear programming  is a decision making problem with a two-level decentralized organization. The textquotedblleft leadertextquotedblright~ is in the upper level and the textquotedblleft followertextquotedblright, in the lower. Making a decision at one level affects that at the other one. In this paper, bilevel linear programming  with inexact parameters has been studied and a method is...

Adding interaction to logic programming is an essential task. Expressive logics such as linear logic provide a theoretical basis for such a mechanism. Unfortunately, none of the existing linear logic languages can model interactions with the user. This is because they uses provability as the sole basis for computation. We propose to use the game semantics instead of provability as the basis for...

‎linear semi-infinite programming problem is an important class of optimization problems which deals with infinite constraints‎. ‎in this paper‎, ‎to solve this problem‎, ‎we combine a discretization method and a neural network method‎. ‎by a simple discretization of the infinite constraints,we convert the linear semi-infinite programming problem into linear programming problem‎. ‎then‎, ‎we use...

This paper is a survey on traditional linear regression techniques using the !I-, ez-, and &,-norm. We derive the characterization of the respective regression estimates (including optimality and uniqueness criteria), as well as discuss some of their statistical properties. @ 2002 Elsevier Science Ltd. All rights reserved. Keywords-el-, e2-, &-regression, Linear programming.

The mixed Chinese postman problem is a version of the well-known Chinese postman problem in which the underlying graph consists of both directed and undirected edges. We give an integer linear programming formulation for this problem and then show that the extreme points of its linear relaxation polyhedron are all half-integral. keywords: Chinese postman problem, half-integrality, graph, flow

jahanshahloo has suggested a method for the solving linear programming problems with zero-one variables‎. ‎in this paper we formulate fully fuzzy linear programming problems with zero-one variables and a method for solving these problems is presented using the ranking function and also the branch and bound method along with an example is presented.