Ask Questions, Get Answers
Menu
X
JEEMAIN Crash Practice
15 Test Series
NEET Crash Practice
5 Test Series
CBSE XII
Math
JEEMAIN
Math
Physics
Chemistry
Practice Test Series
CBSE XI
Math
NEET
Physics
Chemistry
Biology - XII
Biology - XI
Olympiad class V
Math - 5 Test Series
Olympiad class VI
Math - 5 Test Series
studyplans
JEEMAIN Crash Practice
15 Test Series
NEET Crash Practice
5 Test Series
CBSE XII
Math
JEEMAIN
Math
Physics
Chemistry
Practice Test Series
CBSE XI
Math
NEET
Physics
Chemistry
Biology - XII
Biology - XI
Olympiad class V
Math - 5 Test Series
Olympiad class VI
Math - 5 Test Series
mobile
exams
ask
sample papers
tutors
pricing
sign-in
Download our FREE mobile app with 1000+ tests for CBSE, JEE MAIN, NEET
X
Search
Topics
Want to ask us a question?
Click here
Browse Questions
Student Questions
Ad
Home
>>
CBSE XII
>>
Math
>>
Linear Programming
0
votes
Fill in the blank. Any point in the feasible region that gives the ____ value (maximum or minimum) of the objective function is called ____ solution.
related to an answer for:
True or False. The common region determined by all the constraints including non-negative constraints $\; x, y \geq 0$ of a linear programming problem is called the infeasible region.
cbse
class12
toolbox
concepts
ch12
math
Share
asked
Apr 16, 2013
by
balaji.thirumalai
Please
log in
or
register
to add a comment.
Can you answer this question?
Do not ask me again to answer questions
Please
log in
or
register
to answer this question.
1 Answer
0
votes
Answer: Optimal (feasible) solution: Any point in the feasible region that gives the optimal value (maximum or minimum) of the objective function is called an optimal solution.
answered
Apr 16, 2013
by
balaji.thirumalai
Let $R$ be the feasible region for a linear programming problem and let $Z = ax + by$ be the objective function. When $Z$ has an optimal value (maximum or minimum), where the variables $x$ and $y$ are subject to constraints described by linear inequalities, this optimal value must occur where in the feasible region?
Please
log in
or
register
to add a comment.
Related questions
0
votes
1
answer
Let $R$ be the feasible region for a linear programming problem and let $Z = ax + by$ be the objective function. Say the objective function Z has both a maximum and a minimum value on R and each of these occurs at a corner point (vertex) of R. For this to be true, R must be unbounded. True or False.
asked
Apr 16, 2013
by
balaji.thirumalai
toolbox
ch12
easy
concepts
cbse
class12
math
0
votes
1
answer
Let $R$ be the feasible region for a linear programming problem and let $Z = ax + by$ be the objective function. Say $R$ is unbounded, and a maximum or a minimum value of the objective function exists. If so, where can it exist?
asked
Apr 16, 2013
by
balaji.thirumalai
class12
toolbox
cbse
concepts
ch12
easy
math
0
votes
1
answer
Let $R$ be the feasible region for a linear programming problem and let $Z = ax + by$ be the objective function. When $Z$ has an optimal value (maximum or minimum), where the variables $x$ and $y$ are subject to constraints described by linear inequalities, this optimal value must occur where in the feasible region?
asked
Apr 16, 2013
by
balaji.thirumalai
ch12
class12
cbse
easy
concepts
toolbox
math
0
votes
1
answer
True or False. If two corner points of the feasible region are both optimal solutions of the same type, i.e., both produce the same maximum or minimum, then any point on the line segment joining these two points is also an optimal solution of the same type.
asked
Apr 16, 2013
by
balaji.thirumalai
class12
cbse
toolbox
concepts
ch12
easy
true-or-false
math
0
votes
1
answer
True or False: In a LPP, the minimum value of the objective function $Z=ax+by$ is always 0 if origin is one of the corner point of the feasible region.
asked
Jan 8, 2013
by
sreemathi.v
cbse
class12
ch12
q44
p257
true-or-false
exemplar
sec-a
easy
math
0
votes
1
answer
True or False: If the feasible region for a LPP is unbounded,maximum or minimum of the objective function $Z=ax+by$ may or may not exist
asked
Jan 8, 2013
by
sreemathi.v
cbse
class12
ch12
q42
p257
true-or-false
exemplar
sec-a
easy
math
0
votes
1
answer
True or False: Maximum value of the objective function $Z=ax+by$ in a LPP always occurs at only one corner point of the feasible region.
asked
Jan 8, 2013
by
sreemathi.v
cbse
class12
ch12
q43
p257
true-or-false
exemplar
sec-a
easy
math
Ask Question
SUBMIT QUESTION
►
Please Wait
Take Test
JEEMAIN Crash Practice
15 Test Series
NEET Crash Practice
5 Test Series
JEEMAIN
350+ TESTS
NEET
320+ TESTS
CBSE XI MATH
50+ TESTS
CBSE XII MATH
80+ TESTS
x
JEE MAIN, CBSE, NEET Mobile and Tablet App
The ultimate mobile app to help you crack your examinations
Get the Android App
...