Mohd Vaseem

Best explanation of Engineering

Non linear progarmming proble with equality type of constraints

Linear programming

Linear programming problem formulation

Types of non linear programming

integer Programming Problem

Senstivity analysis cost

Geometric Programming

Sensitivity analysis

Wolf’s modified simplex method

Dual Simplex Method

Assignment example

Illumination in dark room

Dynamic programming

Assignment Problem

Dynamic programming example

Parametric programming

Transportation methods for initial basic feasible solution

Simplex method

Randomly

Goal Programming

Branch and Bound Method

Concave and convex

KT Conditions

Transportaion model introduction