1 / 63

1. Problem Formulation

1. Problem Formulation. General Structure. Objective Function : The objective function is usually formulated on the basis of economic criterion , e.g. profit, cost, energy and yield, etc., as a function of key variables of the system under study.

jonniec
Télécharger la présentation

1. Problem Formulation

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. 1. Problem Formulation

  2. General Structure • Objective Function: The objective function is usually formulated on the basis of economic criterion, e.g. profit, cost, energy and yield, etc., as a function of key variables of the system under study. • Process Model: They are used to describe the interrelations of the key variables.

  3. Example – Thickness of Insulation

  4. Essential Features of Optimization Problems At least one objective function, usually an economic model; Equality constraints; Inequality constraints. Categories 2 and 3 are mathematical formulations of the process model. A feasible solution satisfies both the equality and inequality constraints, while an optimal solution is a feasible solution that optimize the objective function.

  5. Mathematical Notation Objective function Equality constraints Inequality constraints

  6. Economic Objective Function Objective function = income - operating costs - capital costs

  7. EXAMPLE: OPTIMUM THICKNESS OF INSULATION

  8. The insulation has a lifetime of 5 years. • The fund to purchase and install the insulation can be borrowed from a bank and paid back in 5 annual installments. • Let r be the fraction of the installed cost to be paid each year to the bank. (r>0.2)

  9. Time Value of Money • The economic analysis of projects that incur income and expense over time should include the concept of the time value of money. • This concept means that a unit of money on hand NOW is worth more than the same unit of money in the future.

  10. Investment Time Line Diagram

  11. Example • You deposit $1000 now (the present value P) in a bank saving account that pays 5% annual interest compounded monthly. • You plan to deposit $100 per month at the end of month for the next year • What will the future value F of your investment be at the end of next year?

  12. Present Value and Future Worth

  13. Present Value of a Series of (not Necessarily Equal) Payments

  14. Present Value of a Series of Uniform Future Payments

  15. Repayment Multiplier

  16. Future Value of a Series of (not Necessarily Equal) Payments

  17. Future Value of a Series of Uniform Future Payments

  18. Measures of Profitability

  19. Measures of Profitability • Net present value (NPV) is calculated by adding the initial investment (represented as a negative cash flow) to the present value of the anticipated future positive (and negative) cash flows. • Internal rate of return (IRR) is the rate of return (i.e. interest rate or discount rate) at which the future cash flows (positive plus negative) would equal the initial cash outlay (a negative cash flow).

  20. 2. Basic Concepts

  21. Continuity of Functions

  22. Continuity of Functions

  23. Stationary Point

  24. Unimodal and Multimodal Functions • A unimodal function has one extremum. • A multimodal function has more than one extrema. • A global extremum is the biggest (or smallest) among a set of extrema. • A local extremum is just one of the extrema.

  25. Two extrema: f=3 f=7

  26. Two extrema: a and b

  27. Definition of Unimodal Function

  28. Convex and Concave Single-Variable Functions A function is called convex over a region R, if,for any two values of x inR, the following inequality holds

  29. Hessian Matrix

  30. Hessian Matrix

  31. Positive and Negative Definiteness

  32. Remarks • A function is convex (strictly convex) iff its Hessian matrix is positive semi-definite (definite). • A function is concave (strictly concave) iff its Hessian matrix is negative semi-definite (definite).

  33. Tests for Strictly Convexity • All diagonal elements of Hessian matrix must be positive. Also, the determinants of Hessian matrix and all its leading principal minors must all be positive. • All eigenvalues of Hessian matrix must be positive.

  34. Convex Region

  35. Convex Region

  36. Why do we need to discuss convexity and concavity? • Determination of convexity or concavity can be used to establish whether a local optimal solution is also a global optimal solution. • If the objective function is known to be convex or concave, computation of optimum can be accelerated by using appropriate algorithm.

  37. Convex Programming Problem

  38. A NLP is generally not a convex programming problem!

  39. Proposition

  40. Linear Varieties

More Related