Skip to Main Content
Multi-Agent Machine Learning
book

Multi-Agent Machine Learning

by H. M. Schwartz
August 2014
Intermediate to advanced content levelIntermediate to advanced
256 pages
6h 48m
English
Wiley
Content preview from Multi-Agent Machine Learning

4.5 The Simplex Algorithm

The simplex algorithm is a well-known algorithm for solving linear programming problems. These are problems of maximizing a utility function or a cost function subject to a number of linear constraints. The linear programming model is as follows: Maximize

4.40 equation

subject to the set of constraints

4.41 equation

The simplex algorithm searches for vertices of a polytope that defines the accessible region of the solution space. One goes from vertex to vertex to find the solution. The algorithm assumes nonnegativity. Inequalities are converted into equalities by adding slack variables. Let us take the following example. This example is taken from Design and Planning of Engineering Systems [13] (Fig. 4-7). Maximize

4.42 equation

subject to the constraints

4.43 equation

and the nonnegativity constraint c04-math-0345 and c04-math-0346. For each one of the constraints, we add a slack variable , , or . We therefore convert ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Graph-Powered Machine Learning

Graph-Powered Machine Learning

Alessandro Negro
Practical Simulations for Machine Learning

Practical Simulations for Machine Learning

Paris Buttfield-Addison, Mars Buttfield-Addison, Tim Nugent, Jon Manning
Ensemble Machine Learning Cookbook

Ensemble Machine Learning Cookbook

Dipayan Sarkar, Vijayalakshmi Natarajan

Publisher Resources

ISBN: 9781118362082Purchase book