<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> <html xmlns="http://www.w3.org/1999/xhtml"> <head> <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> <title>Frepple / TestLPSolver1</title> <link rel='stylesheet' href='../styles.css' type='text/css' /> <!--PageHeaderFmt--> </head> <body> <div id="container"> <div id="menubar"> <div id="logo" align="center"> <br/><img src='../frepple.bmp' alt="frepple" /><br/> <a href='http://www.frepple.com/'> <strong>a Free<br/>Production Planning<br/>Library</strong> </a></div> <div id="menu"> <br/> <h3><a href='../Main/HomePage.html'>Main</a></h3> <h3><a href='../UI/Main.html'>User Manual</a></h3> <h3><a href='../Tutorial/Main.html'>Tutorial</a></h3> <h3><a href='Main.html'>Reference Manual</a></h3> <h3><a href='../Main/FAQ.html'>FAQ</a></h3> <h3><a href='../reference/index.html'>C++ API</a></h3> <br/><div> </div> </div> </div> <div id="content"> <br/> <!--PageText--> <div id='wikitext'> <p><a class='wikilink' href='../Main/HomePage.html'>Main</a> > <span class='wikitrail'><a class='wikilink' href='Main.html'>Reference Manual</a> > <a class='wikilink' href='Test.html'>Unit tests</a> > <a class='selflink' href='TestLPSolver1.html'>TestLPSolver1</a></span> </p> <p class='vspace'>This test shows how the linear programming solver is used to solve a capacity allocation problem in an optimal way. </p> <p class='vspace'>The problem input consists of: </p><ul><li>A set of time buckets. </li><li>A set of demands, each with a due bucket, a quantity and a priority. </li><li>A set of resources, each with an available capacity per time bucket. </li><li>A set of loads, i.e. demands requiring some time on one or more resources. </li></ul><p class='vspace'>The problem is subject to the following constraints: </p><ul><li>For each time bucket and each resource:<br /> sum of capacity used by each demand <= capacity available in the resource bucket </li><li>For each demand:<br /> sum of planned quantities in different buckets <= requested demand quantity </li></ul><p class='vspace'>The LP problem solves for a hierarchy of goals. </p><ul><li>Minimize the shortness of demand of priorities 1, 2 and 3 </li><li>Minimize the lateness of demand of priorities 1, 2 and 3 </li><li>Minimize the early use of capacity (ie use capacity before the due date) </li></ul> </div> <!--PageFooterFmt--> <!--HTMLFooter--> </div></div> </body> </html>
