answersLogoWhite

0


Best Answer

There are no branches listed to select from!

User Avatar

Wiki User

11y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: Which of these branches of mathematics to obtain an optimal best solution to a problem that can be stated in a mathematical form?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

What has the author V N Fomin written?

V. N. Fomin has written: 'Optimal filtering' -- subject(s): Mathematical optimization, Filters (Mathematics)


What is the difference between feasible and optimal solution?

The optimal solution is the best feasible solution


State the difference between a feasible solution basic feasible solution and an optimal solution of a lpp?

the optimal solution is best of feasible solution.this is as simple as it seems


Why optimal solution is only at corner point?

feasible region gives a solution but not necessarily optimal . All the values more/better than optimal will lie beyond the feasible .So, there is a good chance that the optimal value will be on a corner point


What is Tree searching?

rearranging branches to find the most optimal tree topology.


What has the author Yukio Inukai written?

Yukio Inukai has written: 'Optimal versus partially optimal scaling of polychotomous item' -- subject(s): Mathematical optimization


What is the similar property between dynamic programming and greedy approach?

Both are using Optimal substructure , that is if an optimal solution to the problem contains optimal solutions to the sub-problems


What is the difference between feasible solution and basic feasible solution?

optimal solution is the possible solution that we able to do something and feasible solution is the solution in which we can achieve best way of the solution


Is it possible for an linear programming model to have exact two optimal solutions?

Yes, but only if the solution must be integral. There is a segment of a straight line joining the two optimal solutions. Since the two solutions are in the feasible region part of that line must lie inside the convex simplex. Therefore any solution on the straight line joining the two optimal solutions would also be an optimal solution.


What is optimal solution?

It is usually the answer in linear programming. The objective of linear programming is to find the optimum solution (maximum or minimum) of an objective function under a number of linear constraints. The constraints should generate a feasible region: a region in which all the constraints are satisfied. The optimal feasible solution is a solution that lies in this region and also optimises the obective function.


What has the author Hans Sollacher written?

Hans Sollacher has written: 'Stoppregeln' -- subject(s): Decision making, Industrial management, Mathematical models, Optimal stopping (Mathematical statistics)


What has the author Stefan Hildebrandt written?

Stefan Hildebrandt has written: 'Mathematics and optimal form' -- subject(s): Mathematics, Form (Philosophy), Nature (Aesthetics), Motion, Calculus of variations