Linear and Convex Optimization. Michael H. Veatch
Чтение книги онлайн.

Читать онлайн книгу Linear and Convex Optimization - Michael H. Veatch страница 15

Название: Linear and Convex Optimization

Автор: Michael H. Veatch

Издательство: John Wiley & Sons Limited

Жанр: Математика

Серия:

isbn: 9781119664055

isbn:

СКАЧАТЬ representation of the feasible integer solutions for."/>

      Although the graphical method was fairly simple for this example, it is quite different than when solving linear programs. Note that:

       There is not necessarily an optimal solution at the intersection of two constraints. In our example, lies only on the constraint line . In other examples, the optimal solution may not lie on any constraint.

       The optimal solution is not necessarily obtained by rounding the linear program optimal solution. In fact, there is no limit to how far the optimal solution could be from the linear programming solution.

       The integer program can be infeasible when the linear program is feasible.

      These difficulties suggest that integer programs are harder to solve than linear programs, which we will see is true. Even solving a two‐variable integer program graphically can be tedious. However, we do not necessarily need to generate all integer feasible solutions. For example, if we start by generating the feasible point images, then we draw the contour line through it and check for integer points in the linear program's feasible region and above the contour. Checking points to the right of images (because this contour does not touch the feasible region for images), images is infeasible but images qualifies, so it is optimal. The idea of using a feasible integer solution to eliminate other integer points from consideration will be used in Chapter 13.

      The general form of an integer program is the same as a linear program with the added constraint that the variables are integers. If only some of the variables are restricted to be integer, it is called a mixed integer program. When variables represent logical choices, they are usually defined so that images if true (decide to take the action) and images if false (decide not to take the action). A variable whose possible values are images is called a binary variable. An integer program with all binary variables is called a binary program.

      General Form of an Integer Program

equation

      1.4.3 Nonlinear Programs

      General Form of a Nonlinear Program

equation

      We have not stated the nonnegativity constraints separately. However, a nonnegativity constraint can be included in the functional constraints if needed.

      The ability to solve a nonlinear program depends on the type of objective function images and constraints images. A class of more easily solved nonlinear programs called convex programs is discussed in Chapters 14 and 15. Also, Chapter 3 shows how certain piece‐wise linear convex programs can be converted into linear programs, which is useful because convex programs are somewhat harder to solve than linear programs.

      Problems

      For Exercises 1–6, solve the linear program graphically.

      For Exercises 6–8, solve the integer program graphically.

      1 

      2 

      3 

      4 a) Solve as stated. b) Change “min” to “max” and solve.

      5 

      6 

      7 

      8 

      9 For the linear program (1.1)Suppose the objective is to minimize the cost of aid given in 1.2. What is the optimal solution? Explain why minimizing cost is not a reasonable objective for this problem.Find an objective function for which , is optimal. Show graphically that this point is optimal.

      Конец ознакомительного фрагмента.

      Текст предоставлен ООО «ЛитРес».

      Прочитайте эту книгу целиком, купив полную легальную версию на ЛитРес.

      Безопасно оплатить книгу можно банковской картой Visa, MasterCard, Maestro, со счета мобильного телефона, с платежного терминала, в салоне МТС или Связной, через PayPal, WebMoney, Яндекс.Деньги, QIWI Кошелек, бонусными картами или другим удобным Вам способом.

/9j/4AAQSkZJRgABAQEBLAEsAAD/7SCeUGhvdG9zaG9wIDMuMAA4QklNBAQAAAAAAAccAgAAAgAA ADhCSU0EJQAAAAAAEOjxXPMvwRihontnrcVk1bo4QklNBDoAAAAAAOUAAAAQAAAAAQAAAAAAC3By aW50T3V0cHV0AAAABQAAAABQc3RTYm9vbAEAAAAASW50ZWVudW0AAAAASW50ZQAAAABJbWcgAAAA D3ByaW50U2l4dGVlbkJpdGJvb2wAAAAAC3ByaW50ZXJOYW1lVEVYVAAAAAEAAAAAAA9wcmludFBy b29mU2V0dXBPYmpjAAAADABQAHIAbwBvAGYAIABTAGUAdAB1AHAAAAAAAApwcm9vZlNldHVwAAAA AQAAAABCbHRuZW51bQAAAAxidWlsdGluUHJvb2YAAAAJcHJvb2ZDTVlLADhCSU0EOwAAAAACLQAA ABAAAAABAAAAAAAScHJpbnRPdXRwdXRPcHRpb25zAAAAFwAAAABDcHRuYm9vbAAAAAAAQ2xicmJv b2wAAAAAAFJnc01ib29sAAAAAABDcm5DYm9vbAAAAAAAQ250Q2Jvb2wAAAAAAExibHNib29sAAAA AABOZ3R2Ym9vbAAAAAAARW1sRGJvb2wAAAAAAEludHJib29sAAAAAABCY2tnT2JqYwAAAAEAAAAA AABSR0JDAAAAAwAAAABSZCAgZG91YkBv4AAAAAAAAAAAAEdybiBkb3ViQG/gAAAAAAAAAAAAQmwg IGRvdWJAb+AAAAAA СКАЧАТЬ