Chapter 17: Problem 422
Give an example of a two-person non-zero-sum game.
Short Answer
Step by step solution
Key Concepts
These are the key concepts you need to understand to accurately answer the question.
/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none}
Learning Materials
Features
Discover
Chapter 17: Problem 422
Give an example of a two-person non-zero-sum game.
These are the key concepts you need to understand to accurately answer the question.
All the tools & learning materials you need for study success - in one app.
Get started for free
Find a solution to the following problem by solving its dual: Minimize \(\quad 9 \mathrm{x}_{1}+12 \mathrm{x}_{2}+15 \mathrm{x}_{3}\) subject to $$ \begin{aligned} &2 \mathrm{x}_{1}+2 \mathrm{x}_{2}+\mathrm{x}_{3} \geq 10 \\ &2 \mathrm{x}_{1}+3 \mathrm{x}_{2}+\mathrm{x}_{3} \geq 12 \\ &\mathrm{x}_{1}+\mathrm{x}_{2}+5 \mathrm{x}_{3} \geq 14 \\ &\mathrm{x}_{1} \geq 0, \mathrm{x}_{2} \geq 0, \mathrm{x}_{3} \geq 0 \end{aligned} $$
Consider the following integer programming problem: Maximize \(\quad P=6 x_{1}+3 x_{2}+x_{3}+2 x_{4}\) subject to $$ \begin{array}{|l|l|l|l|l|l|} \hline \mathrm{x}_{1} & +\mathrm{x}_{2} & +\mathrm{x}_{3} & +\mathrm{x}_{4} & \leq & 8 \\ \hline 2 \mathrm{x}_{1} & +\mathrm{x}_{2} & +3 \mathrm{x}_{3} & & \leq & 12 \\\ \hline & 5 \mathrm{x}_{2} & +\mathrm{x}_{3} & +3 \mathrm{x}_{4} & \leq & 6 \\ \hline \mathrm{x}_{1} & & & & \leq & 1 \\ \hline & \mathrm{x}_{2} & & & \leq & 1 \\ \hline & & \mathrm{x}_{3} & & \leq & 4 \\ \hline & & & \mathrm{x}_{4} & \leq & 2 \\ \hline \end{array} $$ \(\mathrm{x}_{1}, \mathrm{x}_{2}, \mathrm{x}_{3}, \mathrm{x}_{4}\) all non- negative integers. Use the branch and bound algorithm to solve this problem.
A manufacturer of electronic instruments produces two types of timer: a standard and a precision model with net profits of \(\$ 10\) and \(\$ 15\), respectively. His work force cannot produce more than 50 instruments per day. Moreover, the four main components used in production are in short supply so that the following stock constraints hold: $$ \begin{array}{|c|c|c|c|} \hline & & \text { Number used } & \text { per timer } \\ \hline \text { Component } & \text { Stock } & \text { Standard } & \text { Precision } \\ \hline \mathrm{a} & 220 & 4 & 2 \\ \hline \mathrm{b} & 160 & 2 & 4 \\ \hline \mathrm{c} & 370 & 2 & 10 \\ \hline \mathrm{d} & 300 & 5 & 6 \\ \hline \end{array} $$ Graphically determine the point of optimum profit. If profits on the standard timer were to change, by how much could they change without altering the original solution?
The following problem is an illustration of degeneracy. Maximize \(\quad \mathrm{P}=4 \mathrm{x}_{1}+3 \mathrm{x}_{2}\) subject to $$ \begin{aligned} &4 \mathrm{x}_{1}+2 \mathrm{x}_{2} \leq 10.0 \\ &2 \mathrm{x}_{1}+8 / 3 \mathrm{x}_{2} \leq 8.0 \\ &\mathrm{x}_{1} \geq 0, \mathrm{x}_{2} \geq 1.8 \end{aligned} $$ What are the signs of degeneracy a) in the simplex tableau b) graphically?
In a manufacturing process, the final product has a requirement that it must weigh exactly 150 pounds. The two raw materials used are \(\mathrm{A}\), with a cost of \(\$ 4\) per unit and \(\mathrm{B}\), with a cost of \(\$ 8\) per unit. At least 14 units of \(\mathrm{B}\) and no more than 20 units of A must be used. Each unit of A weighs 5 pounds; each unit of \(\mathrm{B}\) weighs 10 pounds. How much of each type of raw material should be used for each unit of final product if we wish to minimize cost?
What do you think about this solution?
We value your feedback to improve our textbook solutions.