The bilevel linear/linear fractional programming problem

Article Abstract:

A study was conducted to analyze the bilevel linear/linear fractional programming problem. The objective function of the first level was linear while that of the second level was linear fraction. The feasible region was a polyhedron. An algorithm was proposed to determine a global optimum to the problem in a finite number of stages. Results determined an optimal solution that is an extreme point of the polyhedron.

Linear programming

---

A note on 'bilevel linear fractional programming problem'

Article Abstract:

Bilevel programming involves two optimization problems where the constraint region of the first level problem is implicitly determined by another optimization problem. Several proofs, which were incorrect in the previous Thirwani and Arora paper, were corrected and alternative proofs were provided.

Mathematical programming, Linear systems, Fractions

---

A goal programming approach to vehicle routing problems with soft time windows

Article Abstract:

The application of the methods of enumeration and optimization for the performance of goal programming, to solve the vehicle routing problem during the management of logistics, is described.

Strategy & planning, Spain, Planning, Logistics, Business logistics, Company business planning, Combinatorial enumeration problems

Similar abstracts:

• Abstracts: A goal programming procedure for solving problems with multiple fuzzy goals using dynamic programming. An interactive method for inventory control with fuzzy lead-time and dynamic demand
• Abstracts: Solving a vehicle routing problem by balancing the vehicles time utilization. An exact algorithm for the identical parallel machine scheduling problem
• Abstracts: An extended formulation approach to the edge-weighted maximal clique problem. Algorithms for the variable bin packing problem
• Abstracts: A stochastic programming approach for supply chain network design under uncertainty. Rough approximation of a preference relation by a multi-attribute stochastic dominance for determinist and stochastic evaluation problems
• Abstracts: The two-machine total completion time flow shop problem. Scheduling trainees at a hospital department using a branch-and-price approach

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.