• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.501-505
• /
• 1998

In this paper, an LP problem with convex polyhedral objective coefficients is treated. In the problem, the interactivities of the uncertain objective coefficients are represented by a bounded convex polyhedron (a convex polytope). We develop a computation algorithm of a maxmin achievement rate solution. To solve the problem, first, we introduce the relaxation procedure. In the algorithm, a sub-problem, a bilevel programing problem, should be solved. To solve the sub-problem, we develop a solution method based on a branch and bound method. As a result, it is shown that the problem can be solved by the repetitional use of the simplex method.

• Journal of Korean Society of Forest Science
• /
• v.83 no.3
• /
• pp.271-279
• /
• 1994

This paper descbibes a fuzzy multiobjective linear programming, which is a relatively new approach in forestry in solving forest management problems. At first, the fuzzy set theory is explained briefly and the fuzzy linear programming(FLP) and the fuzzy multiobjective linear programming(FMLP) are introduced conceptionally. With the information obtained from the study area in Thailand, a standard linear programming problem is formulated, and optimal solutions (present net worth) are calculated for four groups of timber price by this LP model, respectively. This LP model is reformulated to a fuzzy multiobjective linear programming model to accommodate uncertain timber values and with this FMLP model a compromise solution is attained. Optimal solutions of four objective functions for four timber price groups and the compromise solution are compared and discussed.