Linear programming graph T/F questions

Click For Summary
SUMMARY

The discussion centers on evaluating the truthfulness of statements regarding optimal solutions in linear programming, specifically using graphical methods. The participants analyze three statements about points (3,3), (0,2), (6,3), and (0,0) in relation to an objective function that needs to be maximized. The consensus is that statement (a) is False, (b) is False, and (c) is True, with justifications based on the properties of feasible regions and optimal solutions in linear programming.

PREREQUISITES
  • Understanding of linear programming concepts
  • Familiarity with feasible regions in graphical methods
  • Knowledge of objective functions and optimization
  • Ability to interpret graphical data in mathematical contexts
NEXT STEPS
  • Study the graphical method for solving linear programming problems
  • Learn about the properties of feasible regions in linear programming
  • Explore examples of objective functions and their maximization
  • Investigate the concept of multiple optimal solutions in linear programming
USEFUL FOR

Students and educators in mathematics, particularly those focusing on optimization techniques in linear programming, as well as professionals involved in operations research and decision-making processes.

csc2iffy
Messages
74
Reaction score
0

Homework Statement


The shaded area on graph represents the feasible region of a linear programmin problem whose objective function is to be maximized.

Label each of the following statements as True or False, and then justify your answer based on the graphical method. In each case, give an example of an objective function that illustrates your answer.

(a) If (3,3) produces a larger value of the objective function than (0,2) and (6,3), then (3,3) must be an optimal solution.

(b) If (3, 3) is an optimal solution and multiple optimal solutions exist, then either (0,2) or (6,3) must also be an optimal solution.

(c) The point (0,0) cannot be an optimal solution.2. The attempt at a solution
I said...

(a) True

(b) True

(c) False
 

Attachments

  • Untitled.png
    Untitled.png
    15.2 KB · Views: 1,036
Last edited:
Physics news on Phys.org
csc2iffy said:

Homework Statement


The shaded area on graph represents the feasible region of a linear programmin problem whose objective function is to be maximized.

Label each of the following statements as True or False, and then justify your answer based on the graphical method. In each case, give an example of an objective function that illustrates your answer.

(a) If (3,3) produces a larger value of the objective function than (0,2) and (6,3), then (3,3) must be an optimal solution.

(b) If (3, 3) is an optimal solution and multiple optimal solutions exist, then either (0,2) or (6,3) must also be an optimal solution.

(c) The point (0,0) cannot be an optimal solution.


2. The attempt at a solution
I said...

(a) False, (3,3) cannot be an optimal solution because ? I just think it's because (6,3) would always be greater, I can't think of an example where it wouldn't be

(b) False, either (3,3) and (0,2) are optimal, or (3,3) and (6,3) are optimal.

(c) True

I need a little help justifying my answers and finding an example of an objective function illustrating my answers. Also, I'm not 100% sure they're correct to begin with... :/

(a) You are not allowed to say "I just think it's because (6,3) would always be greater..", as you were TOLD that (3,3) gave the greater value! I can think of millions of examples where (3,3) gives a larger objective value than (6,3).
(b) You are saying something is both false and true at the same time.
(c) Why?

RGV
 
I am just learning this stuff ok! thanks for all your "help" but i figured it out
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
Replies
9
Views
2K
  • · Replies 15 ·
Replies
15
Views
2K
  • · Replies 2 ·
Replies
2
Views
5K
Replies
1
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
Replies
8
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 12 ·
Replies
12
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K