Jump to content

CLL782: Difference between revisions

From IITD Wiki
[checked revision][checked revision]
Creating course page via bot
 
Bot: wrap bare course codes in wikilinks
 
Line 4: Line 4:
| credits = 3
| credits = 3
| credit_structure = 3-0-0
| credit_structure = 3-0-0
| pre_requisites = CLL222, CLL352
| pre_requisites = [[CLL222]], [[CLL352]]
| overlaps = MTL103, MTL625, MTL704, APL771, MCL742
| overlaps = [[MTL103]], [[MTL625]], [[MTL704]], [[APL771]], [[MCL742]]
}}
}}


== CLL782 : process Optimization ==
== CLL782 : process Optimization ==
Introduction to optimization and applications; classification (LP, NLP, MILP, MINLP), convexity, unimodal vs multimodal. Single variable and multivariable unconstrained optimization methods. Linear programming, branch and bound method for MILP. Constrained optimization: nonlinear programming. Necessary and sufficient conditions of optimality. Quadratic programming. Case studies from chemical industry.
Introduction to optimization and applications; classification (LP, NLP, MILP, MINLP), convexity, unimodal vs multimodal. Single variable and multivariable unconstrained optimization methods. Linear programming, branch and bound method for MILP. Constrained optimization: nonlinear programming. Necessary and sufficient conditions of optimality. Quadratic programming. Case studies from chemical industry.

Latest revision as of 16:25, 14 April 2026

CLL782
process Optimization
Credits 3
Structure 3-0-0
Pre-requisites CLL222, CLL352
Overlaps MTL103, MTL625, MTL704, APL771, MCL742

CLL782 : process Optimization

Introduction to optimization and applications; classification (LP, NLP, MILP, MINLP), convexity, unimodal vs multimodal. Single variable and multivariable unconstrained optimization methods. Linear programming, branch and bound method for MILP. Constrained optimization: nonlinear programming. Necessary and sufficient conditions of optimality. Quadratic programming. Case studies from chemical industry.