Consider an arbitrary program in standard equation form: maximise cTx subject to Ax = b, Show that if y and z are two different optimal solutions to this program, then 1) every convex combination of y and z is also an optimal solution of the program. 2) Consider two vectors y and z with y z and consider two values 0 E [0, 1] and O e [0, 1] with 0 0. Show that dy + (1-0)z 0'y + (1 – 0')z. In other words, every distinct way of choosing the value A E [0, 1] gives a distinct convex combination Ay + (1- )z. Hint: let a = Oy + (1-0)z and b 0'y + (1 0')z, then consider a b. 3) Using the result from parts (a) and (b), show that every linear program has either 0, 1, or infinitely many optimal solutions.
Consider an arbitrary program in standard equation form: maximise cTx subject to Ax = b, Show that if y and z are two different optimal solutions to this program, then 1) every convex combination of y and z is also an optimal solution of the program. 2) Consider two vectors y and z with y z and consider two values 0 E [0, 1] and O e [0, 1] with 0 0. Show that dy + (1-0)z 0'y + (1 – 0')z. In other words, every distinct way of choosing the value A E [0, 1] gives a distinct convex combination Ay + (1- )z. Hint: let a = Oy + (1-0)z and b 0'y + (1 0')z, then consider a b. 3) Using the result from parts (a) and (b), show that every linear program has either 0, 1, or infinitely many optimal solutions.
Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
Related questions
Question
![Consider an arbitrary program in standard equation form:
maximise
cTx
subject to Ax = b,
x 2 0
Show that if
1)
and z are two different optimal solutions to this program, then
every convex combination of y and z is also an optimal solution of the program.
2) Consider two vectors y and z with y z and consider two values 0 E [0, 1
and 0 e [0, 1] with 0 0. Show that Oy + (1 – 0)z 0'y + (1 – 0')z. In
other words, every distinct way of choosing the value A E [0, 1] gives a distinct
convex combination Ay + (1 – A)z.
Hint: let a = Oy + (1-0)z and b 0'y + (1- 0)z, then consider a -
3) Using the result from parts (a) and (b), show that every linear program has
either 0, 1, or infinitely many optimal solutions.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fa586075f-e62a-4dbd-99d5-0873e381613a%2Fd52218ca-f9a0-4849-af2d-2cb6ee3aa966%2Fk918nz_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Consider an arbitrary program in standard equation form:
maximise
cTx
subject to Ax = b,
x 2 0
Show that if
1)
and z are two different optimal solutions to this program, then
every convex combination of y and z is also an optimal solution of the program.
2) Consider two vectors y and z with y z and consider two values 0 E [0, 1
and 0 e [0, 1] with 0 0. Show that Oy + (1 – 0)z 0'y + (1 – 0')z. In
other words, every distinct way of choosing the value A E [0, 1] gives a distinct
convex combination Ay + (1 – A)z.
Hint: let a = Oy + (1-0)z and b 0'y + (1- 0)z, then consider a -
3) Using the result from parts (a) and (b), show that every linear program has
either 0, 1, or infinitely many optimal solutions.
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 5 steps with 5 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Advanced Engineering Mathematics](https://www.bartleby.com/isbn_cover_images/9780470458365/9780470458365_smallCoverImage.gif)
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
![Numerical Methods for Engineers](https://www.bartleby.com/isbn_cover_images/9780073397924/9780073397924_smallCoverImage.gif)
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
![Introductory Mathematics for Engineering Applicat…](https://www.bartleby.com/isbn_cover_images/9781118141809/9781118141809_smallCoverImage.gif)
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
![Advanced Engineering Mathematics](https://www.bartleby.com/isbn_cover_images/9780470458365/9780470458365_smallCoverImage.gif)
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
![Numerical Methods for Engineers](https://www.bartleby.com/isbn_cover_images/9780073397924/9780073397924_smallCoverImage.gif)
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
![Introductory Mathematics for Engineering Applicat…](https://www.bartleby.com/isbn_cover_images/9781118141809/9781118141809_smallCoverImage.gif)
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
![Mathematics For Machine Technology](https://www.bartleby.com/isbn_cover_images/9781337798310/9781337798310_smallCoverImage.jpg)
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
![Basic Technical Mathematics](https://www.bartleby.com/isbn_cover_images/9780134437705/9780134437705_smallCoverImage.gif)
![Topology](https://www.bartleby.com/isbn_cover_images/9780134689517/9780134689517_smallCoverImage.gif)