Akademik Dersler - İçerik

develop linear programming (LP) models for real-life decision making problems.
explains the fundamentals, assumptions and components of LP.
formulate the decision making problems with DP linearization techniques.
formulates the decision making problems using LP methods.
will be able to explain mathematical essentials of LP.
solves the LP problems with two variables using graphical method.
determines the existence of feasibility in the permit space.
finds solution by using the Fourier-Motzkin method.
proves whether a given set is convex or concave.
proves whether a given function is convex, concave, or neither.
expresses the polyhedral sets as a combination of extreme points and extreme directions.
use simplex algorithm and variations, and evaluates the results.
explains the approach and theory of the simplex algorithm.
arranges the initial simplex tableau and solves the LP model.
solves the LP problem using revised simplex algorithm
evaluates the obtained results from the simplex tableau.
evaluates the obtained results from the simplex tableau.
interpret the duality in linear programming and make the sensitivity analysis.
formulates the dual of the primal model.
interprets the dual variables (shadow prices).
solves the LP problem using the dual simplex method.
investigates the effects on the changes in the optimal solution with sensitivity analysis.
uses computer softwares for solving LP models and evaluates the output reports making technical and financial analysis.
will be able to discuss optimality conditions.
uses the Farkas Theorem.
shows the Karush-Kuhn-Tucker optimality conditions
solve multicriteria LP problems with goal programming approach.
formulates a multicriteria LP problem with the aid of goal programming.
applies weighted and preemptive goal programming models.
solves linear goal programming problem using computer softwares and interprets the obtained results.
compare the efficiencies of decision making units using data envelopment analysis (DEA).
develops the LP models for decision making units.
determines the efficient and inefficient units solving the LP models.
makes recommendations for changes in resource inputs or outputs for inefficient units using the appropriate reference set of efficient units.
prepare a term project that may be on a theoretical subject, an application, an algorithm or a software implementation within the context of the LP.
finds and arranges information from different sources related to the chosen project.
writes a report by using report writing guideline.
makes an oral presentation of the project in class.