1. Home
  2. Fundamental sciences
  3. Mathematics
  4. Linear Programming. Methods and Applications

  5. Conclusion

Article | REF: AF1254 V1

Linear Programming. Methods and Applications

Author: Jean-François SCHEID

Publication date: October 10, 2015

You do not have access to this resource.
Click here to request your free trial access!

Already subscribed? Log in!

Français

11. Conclusion

The fundamental properties of solutions to linear programming problems have been established. The simplex method was presented for solving a linear program in which an objective function is sought to be maximized. It is an iterative method that involves examining the vertices of the constraint polyhedron to increase the objective function. The simplex method has been implemented in two different ways: firstly, using dictionaries, and secondly, with an array method consisting in updating the inverse of the basic constraint matrix. The latter method is implemented in a MATLAB code provided in the appendix (§ 10.2

You do not have access to this resource.

Exclusive to subscribers. 97% yet to be discovered!

You do not have access to this resource.
Click here to request your free trial access!

Already subscribed? Log in!

The Ultimate Scientific and Technical Reference

A Comprehensive Knowledge Base, with over 1,200 authors and 100 scientific advisors
+ More than 10,000 articles and 1,000 how-to sheets, over 800 new or updated articles every year
From design to prototyping, right through to industrialization, the reference for securing the development of your industrial projects

This article is included in

Mathematics

This offer includes:

Knowledge Base

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources

Practical Path

Operational and didactic, to guarantee the acquisition of transversal skills

Doc & Quiz

Interactive articles with quizzes, for constructive reading

Subscribe now!

Ongoing reading
Conclusion
Outline