Scribd
Upload
4 views

pa01

The document outlines a programming exercise for students at Technische Universität Berlin, requiring the implementation of the revised simplex algorithm in Java or C/C++. Students must read .lp files, solve linear programs, and document their code properly. The completed program must be submitted via email by January 18, 2012, along with a README file detailing the compilation instructions.

Uploaded by

drbspacemusic
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views

pa01

The document outlines a programming exercise for students at Technische Universität Berlin, requiring the implementation of the revised simplex algorithm in Java or C/C++. Students must read .lp files, solve linear programs, and document their code properly. The completed program must be submitted via email by January 18, 2012, along with a README file detailing the compilation instructions.

Uploaded by

drbspacemusic
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Technische Universität Berlin ADM II – Linear and Integer Programming

Institut für Mathematik Winter Term 2011/2012

Prof. Dr. Rolf H. Möhring Christoph Hansknecht


Dr. Sebastian Stiller

1. Programming exercise
Hand-over: 18.1.2012
Presentation: Please, arrange time and place with Christoph Hansknecht.

Implement the revised simplex algorithm as presented in the lecture using Java or C/C++ as
programming language. Your program should

• read .lp-files.
• solve linear programs and display one optimal solution or the information that the LP is
infeasible/unbounded.
• print the values of the variables and the objective for a solution or write it to a file.

• give informations about the reduced cost and the variables that are leaving or entering the
basis in every step, if requested.
• be fully and proper documented using JavaDoc, Doxygen or another system that is available
in the Unixpool.

We will provide some example LPs on our website. Your program has to solve them correctly.
When you are done with this exercise please create an archive with a README file that contains
a short instruction about the compilation procedure for your code. Send an email with this archive
by the 18.1.2012 to [email protected]. Other uncertainties can be discussed in
the exercise session or will be purged via a comment on our website.
Here are some tips that might help you(you don’t have to follow them):

• Split up the work and define some milestones. The availible time might look like a lot but
there are many things to do. There will be some surprising bugs in the end.
• Take the time to sketch a concept for your code before you start to write the first line of code.
• Use a version control system like svn.

• Start to implement all needed routines for matrix- and vector-operations.


• Implement the phase II of the whole procedure at first an test it with some “hard-coded”
examples.
• Complete it with the phase I and test it in a similar way.

• Integrate a parser for the .lp-files. Due to Dr. Axel Werner we can provide you a parser
written in Java which can be found on the webpage. We don not guarantee its correctness.
• Execute diligent tests of each part of the code as early as possible. The simpler a piece of
code is the easier any bugs are found.

• Integrate the possibility to adjust the level of details for the displayed improvements of your
program. In the end it may be usefull to get rid of a bunch of meaningless output.

Good Luck!

You might also like