answersLogoWhite

0


Best Answer

No, it will not. In fact, there is a special branch of linear programming which is called integer programming and which caters for situations where the solution must consist of integers.

User Avatar

Wiki User

7y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: Will the solution to an linear programming problem always consist of integers?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

What is the relation between problem and programming?

Problem -> Programming Programming can be a solution to a problem. If you have a problem and it can be solved by a computer program, so you can create such a program - so you can solve this problem by programming.


What is a step by step solution of a programming problem?

An algorithm.


What is integer programming?

Integer programming is a special kind of an optimising problem where the solution must be an integer.


What is a description of what is solute?

Solutions consist of a solvent, a liquid medium into which solutes can dissolve.


What do interger's allow you to do that whole numbers do not?

Integers are closed under subtraction, meaning that any subtraction problem with integers has a solution in the set of integers.


Is it possible for a linear programming problem to have no solution?

Yes. There need not be a feasible region.


How do I figure out the programming decision and variables for anything?

There is no programming solution for "anything". Programs are specifically designed to solve a particular problem.


What is degeneracy in linear programing problem?

the phenomenon of obtaining a degenerate basic feasible solution in a linear programming problem known as degeneracy.


What do you understand by linear programming problem?

1. What do you understand by Linear Programming Problem? What are the requirements of Linear Programming Problem? What are the basic assumptions of Linear Programming Problem?


How do you solve a fixed cost problem?

Fixed Cost Problem is a kind of the Mixed Linear Programming Problem(MILP).Also, MILP is a Parametric Quadratic Concave Programming Problem. The optimal solution is existence of vertix set of the domain set. Then, you can use the domain cutting method.


What do you understand by linear programming?

1. What do you understand by Linear Programming Problem? What are the requirements of Linear Programming Problem? What are the basic assumptions of Linear Programming Problem?


Why does the programming domains affect the concept of programming language?

The domain affects the way we express solutions to problems. A language that closely reflects the problem domain makes it much easier to express the solution.