Finding a Feasible Solution for a Simple LP Problem using Agents
1999-05-26
Research Paper
This publication is part of collections
| Related Files |
|---|
View PDF Version
(1999-0374.pdf, 0.1MB) |
In this paper we will describe a Multi-Agent System which is capable of finding a feasible solution of a specially structured linear programming problem. Emphasis is given to correctness issues and termination detection.
Keywords
Automatically Extracted Terms
- agent
- agent i
- transaction
- request
- state
- problem
- solution
- value
- agent j
- algorithm
- section
- not-yet-feasible
- multi-agent system
- action
- constraint
- state not-yet-feasible
- resource
- reply
- j minj
- statei
