Reference Entry

vertex method

Christopher Clapham and James Nicholson

in The Concise Oxford Dictionary of Mathematics

Fifth edition

Published in print January 2014 | ISBN: 9780199679591
Published online September 2014 | e-ISBN: 9780191759024
vertex method

Show Summary Details

Preview

For a *linear programming problem where the decision variables are not required to take integer values, the optimal solutions will occur at one or more of the extreme points, i.e. vertices of the feasible region. The method of solution is to calculate the value of the objective function at each vertex, and the maximum or minimum (as required) of these values identifies any optimal solutions. Where more than one such vertex is found, all points on the boundary of the feasible region between them will also be an optimal solution....

Reference Entry.  93 words. 

Subjects: Pure Mathematics

Full text: subscription required

How to subscribe Recommend to my Librarian

Buy this work at Oxford University Press »

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content. subscribe or login to access all content.