| 520 |
|
|
|a Basic methods of linear programming, introduction, linear programming in historical perspective, economic desicions and liniar programming, the linrar programming problem, exercioses; the simplex method for linear programming, production planning with one resource limitation, production planning with two resource limitations, production planning usine the simplex method, a general treatment of the simliex method, a geametrical interpretation of the simplex method, exercises; related problems and methods, the composition of minimum-cost cattlefeed, the use of artificial variabes for an initial basic feasible solution, the outsider's point of view or the dual problem, the dual method, exercises; sensitivity analysis and near-optimal analysis, sensitivity analysis of the coeffcients of the objetive, function, sensitivity analsis of the constant terms, alternative optimal solutons, near-optimalty analysis via the reverse simplex method, exercises; anti-cycling and upper-bound methods, degeneracy and the anti-cyling method, the simplex method for problems with upper -bound; parametryc programming, programming with a parametric objective function, programming with parammetric contant terms; applications of liniar programming, liniar programming computations with the MPS-system, date input, control program, computer output, bounds and ranges, parametric programming; structure and formulation of programming problems, economic activities in linear programming, a dynsmimic production, seles, and inventory model; some applications of linier programming, capital budgeting problem, production planning fora dairy; liniar programming models and economic analysis, activity analysis and economic analysis, equilibrium with elastic demand; geme theory, introduction, example and terminology, geme theory and linear programming; transportation and network methods, transportation methods, production and sales allocation problem,the clessical transportation problem; variants of transportation models, the assignment problem, dynamic production planning; transportation networks, network representation of transportation problems, the simplex netwoek method; dicsion tree methods, branch-and-bound methods for a decision tree, the traveling salesman problem; bran-and-bounds for integer programming, the fixed charge problem.
|